相关论文: Euclidean Tours in Fairy Chess

We introduce a two player game on an n x n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the number of queens already on the board which can attack that square modulo two.…

The paper deals with some problems related to recovering information about an obstacle in an Euclidean space from certain measurements of lengths of generalized geodesics in the exterior of the obstacle. The main result is that if two…

Given any $n \in \mathbb{Z}^{+}$, we constructively prove the existence of covering paths and circuits in the plane which are characterized by the same link length of the minimum-link covering trails for the two-dimensional grid $G_n^2 :=…

We consider the integrable dynamics of a Kepler billiard in the plane bounded by a branch of a conic section focused at the Kepler center. We show that in this case, for non-zero-energy orbits, the lines of consecutive second orbital foci…

Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…

We study the problem of computing a shortest tour that visits a sequence of $k$ polygons $P_1,\dots, P_k$ with a total number of $n$ vertices. A tour is an oriented curve such that there exist points $p_i\in P_i$ for all $i$ where $p_i$…

The k-Visits problem is a recently introduced finite version of Pinwheel Scheduling [Kanellopoulos et al., SODA 2026]. Given the deadlines of n tasks, the problem asks whether there exists a schedule of length kn executing each task exactly…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

In this paper we prove two asymptotic estimates for pairs of closed trajectories for open billiards similar to those established by Pollicott and Sharp for closed geodesics on negatively curved compact surfaces. The first of these estimates…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

An approach due to Wojtkovski [9], based on the Jacobi fields, is applied to study sets of 3-period orbits in billiards on hyperbolic plane and on two-dimensional sphere. It is found that the set of 3-period orbits in billiards on…

Quantum computing promises to improve the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than…

Given a domain or, more generally, a Riemannian manifold with boundary, a billiard is the motion of a particle when the field of force is absent. Trajectories of such a motion are geodesics inside the domain; and the particle reflects from…

In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph $G$ with the integer lattice, seen as a…

We analyze Solo Chess puzzles, where the input is an $n \times n$ board containing some standard Chess pieces of the same color, and the goal is to make a sequence of capture moves to reduce down to a single piece. Prior work analyzes this…

We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…

We give the asymptotic growth of the number of primitive periodic trajectories of a two dimensional dispersive billiard, when we prescribe their number of bounces on one of the obstacles.

One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, albeit the system is translationally invariant. The effect is…

Gao and Richter (1994) showed that every $3$-connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most $2$ times. Brunet, Ellingham, Gao, Metzlar, and Richter (1995) extended…

In this paper we consider the problem of approximating Euclidean distances by the infinite integer grid graph. Although the topology of the graph is fixed, we have control over the edge-weight assignment $w:E\to \mathbb{R}_{\ge 0}$, and…