English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We prove nonexistence of minimal-time solutions for three variations of thefiring squad synchronization problem (FSSP, for short). Configurations of thesevariations are paths in the two-dimensional grid space having simple geometricshapes. In the first variation a configuration is an L-shaped path such thatthe ratio of the length of horizontal line to that of the vertical line isfixed. The general may be at any position. In the second and the thirdvariations a configuration is a rectangular wall such that the ratio of thelength of the two horizontal walls to that of the two vertical walls is fixed.The general is at the left down corner in the second variation and may be atany position in the third variation. We use the idea used in the proof ofYamashita et al's recent similar result for variations of FSSP withsub-generals.

Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations