相关论文: Euclidean Tours in Fairy Chess
We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations $G(k)$ and a related double sequence $G(k,m)$. Exact expressions for these are derived, and we…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…
We derive Cayley's type conditions for periodical trajectories for the billiard within an ellipsoid in the Lobachevsky space. It appears that these new conditions are of the same form as those obtained before for the Euclidean case. We…
The authors propose a new variation of random walks called ladder chains $L(r,s,p)$. We extend concepts such as ruin probability, hitting time, transience and recurrence of random walks to ladder chain. Take $L(2,2,p)$ for instance, we find…
In our recent paper, we studied periodic billiard trajectories in the regular pentagon and closed geodesic on the double pentagon, a translation surface of genus two. In particular, we made a number of conjectures concerning symbolic…
The goal of this paper is an analysis of the geometry of billiards in ellipses, based on properties of confocal central conics. The extended sides of the billiards meet at points which are located on confocal ellipses and hyperbolas. They…
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
Periodic orbits (equivalence classes of closed paths up to cyclic shifts) play an important role in applications of graph theory. For example, they appear in the definition of the Ihara zeta function and exact trace formulae for the spectra…
Euclidean outer billiard on a regular polygon (that is not a triangle, square or a hexagon) has aperiodic points, i.e., points where all iterates of the outer billiard map are defined and yield pairwise distinct images. This result answers…
We apply to the $n\times n$ chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I showed that the number of ways to place $q$ identical…
By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices…
We review the state of the art in the problem of counting the number open knight tours, since the publication in internet of a computation of this quantity.
In this paper we define and study the billiard problem on bounded regions on surfaces of constant curvature. We show that this problem defines a 2-dimensional conservative and reversible dynamical system, defined by a Twist diffeomorphism,…
In the Tricolored Euclidean Traveling Salesperson problem, we are given~$k=3$ sets of points in the plane and are looking for disjoint tours, each covering one of the sets. Arora (1998) famously gave a PTAS based on ``patching'' for the…
In how many ways can $n$ queens be placed on an $n \times n$ chessboard so that no two queens attack each other? This is the famous $n$-queens problem. Let $Q(n)$ denote the number of such configurations, and let $T(n)$ be the number of…
The function that counts the number of ways to place nonattacking identical chess or fairy chess pieces in a rectangular strip of fixed height and variable width, as a function of the width, is a piecewise polynomial which is eventually a…
For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erd\H{o}s-Taylor conjecture and obtain the…
A lower bound for the number of 3-periodical billiard trajectories in a manifold embedded in Euclidean space is obtained.
The classical measure of similarity between two polygonal chains in Euclidean space is the Fr\'echet distance, which corresponds to the coordinated motion of two mobile agents along the chains while minimizing their maximum distance. As…