相关论文: Euclidean Tours in Fairy Chess
How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We provide a comprehensive overview of…
We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete confirms a conjecture of Chung, Diaconis and Graham from 1989…
Consider the entire function $f(z)=\cosh(z)$. We show that the escaping set of this function - that is, the set of points whose orbits tend to infinity under iteration - has a structure known as a "spider's web". This disproves a conjecture…
Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, ... Consider the cells in order, placing a queen in a cell if and only if it would not attack any earlier queen. The problem is to determine the…
We give an optical physicist view of the problem of the trajectories in a polygonal billiard using only basic facts of Optics and the theory of functions of a complex variable. This approach allow us to stablish a certain correspondence…
This paper addresses the question of genericity of existence of elliptic islands for the billiard map associated to strictly convex closed curves. More precisely, we study 2-periodic orbits of billiards associated to C5 closed and strictly…
We introduce a new class of billiard-like system, ``bouncing outer billiards" which are 3-dimensional cousins of outer billiards of Neumann and Moser. We prove that bouncing outer billiard on a smooth convex body has at least four…
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
We study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…
We construct a topological ladder model, one-dimensional, following the steps which lead to the Kane-Mele model in two dimensions. Starting with a Creutz ladder we modify it so that the gap closure points can occur at either $k = \pi / 2$…
We describe a general method of detecting valid chains or links of pieces on a two-dimensional grid. Specifically, using the example of the chess variant known as Switch-Side Chain-Chess (SSCC). Presently, no foolproof method of detecting…
The dynamic geometry of the family of 3-periodics in the Elliptic Billiard is mystifying. Besides conserving perimeter and the ratio of inradius-to-circumradius, it has a stationary point. Furthermore, its triangle centers sweep out…
The Searchlight Scheduling Problem was first studied in 2D polygons, where the goal is for point guards in fixed positions to rotate searchlights to catch an evasive intruder. Here the problem is extended to 3D polyhedra, with the guards…
We solve the general problem of visiting all the $2^k$ nodes of a $k$-dimensional hypercube by using a polygonal chain that has minimum link-length, and we show that this optimal value is given by $h(2,k):=3 \cdot 2^{k-2}$ if and only if $k…
Quantum walk followed by some amplitude amplification technique has been successfully used to search for marked vertices on various graphs. Lackadaisical quantum walk can search for target vertices on graphs without the help of any…
The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the…
Consider a periodic tiling of a plane by equal triangles obtained from the equilateral tiling by a linear transformation. We study a following tiling billiard: a ball follows straight segments and bounces of the boundaries of the tiles into…
We review some properties of periodic orbit families in polygonal billiards and discuss in particular a sum rule that they obey. In addition, we provide algorithms to determine periodic orbit families and present numerical results that shed…
The famous conjecture of V.Ya.Ivrii (1978) says that {\it in every billiard with infinitely-smooth boundary in a Euclidean space the set of periodic orbits has measure zero}. In the present paper we study the complex version of Ivrii's…
In this note we show that every tournament on $n$ vertices contains the $k$-th power of a directed path of length $n/2^{6k+7}$, which improves upon the recent bound of Scott and Kor\'{a}ndi of $n/2^{2^{3k}}$. By doing so, we get an inverse…