Related papers: Complexity for billiards in regular N-gons
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…
We introduce the iteration theory for periodic billiard trajectories in a compact and convex domain of the Euclidean space, and we apply it to establish a multiplicity result for non-iterated trajectories.
We study length-minimizing closed generalized Euclidean billiard trajectories in convex bodies in $\mathbb{R}^n$ and investigate their relation to the inclusion minimal affine sections that contain these trajectories. We show that when…
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…
A correspondence between the orbits of a system of 2 complex, homogeneous, polynomial ordinary differential equations with real coefficients and those of a polygonal billiard is displayed. This correspondence is general, in the sense that…
In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the…
We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank…
In this paper the problem of estimating the number of periodical billiard trajectories is considered. The main result is the theorem on Morse theory for periodical billiard trajectories.
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…
We formulate the following general problem. To the best of our knowledge, it is open and has not previously been considered. It seems (at least to us!) to be difficult; at any rate, more difficult than enumerating the dissections…
We describe the set of possible vector valued side lengths of n-gons in thick Euclidean buildings of rank 2. This set is determined by a finite set of homogeneous linear inequalities, which we call the generalized triangle inequalities.…
We study the recurrence and ergodicity for the billiard on noncompact polygonal surfaces with a free, cocompact action of $\Z$ or $\Z^2$. In the $\Z$-periodic case, we establish criteria for recurrence. In the more difficult $\Z^2$-periodic…
We study the complexity (that is, the weight of the multiplication table) of the elliptic normal bases introduced by Couveignes and Lercier. We give an upper bound on the complexity of these elliptic normal bases, and we analyze the weight…
A comprehensive analysis of periodic trajectories of billiards within ellipses in the Euclidean plane is presented. The novelty of the approach is based on a relationship recently established by the authors between periodic billiard…
This work continues the study of tiling billiards, a class of dynamical system introduced by Davis et al. in 2018. We develop the study of generalized tiling billiards in a cyclic polygon. This work shows that the behavior of generalized…
We show that in the space of all convex billiard boundaries, the set of boundaries with rational caustics is dense. More precisely, the set of billiard boundaries with caustics of rotation number $1/q$ is polynomial sense in the smooth…
In this article, we study polygonal symplectic billiards. We provide new results, some of which are inspired by numerical investigations. In particular, we present several polygons for which all orbits are periodic. We demonstrate their…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…