Related papers: Complexity for billiards in regular N-gons
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
The celebrated Hardy-Landau lower bound for the error term in the Gauss's circle problem can be viewed as an estimate from below for the remainder in Weyl's law on a square, with either Dirichlet or Neumann boundary conditions. We prove an…
We study the computational complexity of model checking and satisfiability problems of polyadic modal logics extended with permutations and Boolean operators on accessibility relations. First, we show that the combined complexity of the…
We show how to solve computationally a combinatorial problem about the possible number of roots orthogonal to a vector of given length in $E_8$. We show that the moduli space of K3 surfaces with polarisation of degree 2d is also of general…
We consider a non-minimal billiard trajectory inside the cube. We study the language of the associated orbit when the map is coded with three letters associated to three non-parallel faces of the cube.
We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a…
We study geometry of confocal quadrics in pseudo-Euclidean spaces of an arbitrary dimension $d$ and any signature, and related billiard dynamics. The goal is to give a complete description of periodic billiard trajectories within…
Polygonal billiards exhibit a rich and complex dynamical behavior. In recent years polygonal billiards have attracted great attention due to their application in the understanding of anomalous transport, but also at the fundamental level,…
We provide lower bounds on the number of periodic Finsler billiard trajectories inside a quadratically convex smooth closed hypersurface $M$ in a $d$-dimensional Finsler space with possibly irreversible Finsler metric. An example of such a…
We completely characterize rational polygons whose billiard flow is weakly mixing in almost every direction as those which are not almost integrable, in the terminology of Gutkin, modulo some low complexity exceptions. This proves a…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
A lower bound for the number of 3-periodical billiard trajectories in a manifold embedded in Euclidean space is obtained.
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
The thirty years old programme of Griffiths and Harris of understanding higher-dimensional analogues of Poncelet-type problems and synthetic approach to higher genera addition theorems has been settled and completed in this paper. Starting…
We show how to generate an expression for the number of k-line Latin rectangles for any k. The computational complexity of the resulting expression, as measured by the number of additions and multiplications required to evaluate it, is on…
In any periodic direction on the regular pentagon billiard table, there exists two combinatorially different billiard paths, with one longer than the other. For each periodic direction, McMullen asked if one could determine whether the…
We study the deep interplay between geometry of quadrics in d-dimensional space and the dynamics of related integrable billiard systems. Various generalizations of Poncelet theorem are reviewed. The corresponding analytic conditions of…
We review a virial-type estimate which bounds the strength of interaction for a gas of $N$ hard spheres (billiard balls) dispersing into Euclidean space $\mathbb{R}^d$. This type of estimate has been known for decades in the context of…
We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities…
We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…