Related papers: Complexity for billiards in regular N-gons
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
We give the first explicit computations of rational homotopy groups of spaces of "long knots" in Euclidean spaces. We define a spectral sequence which converges to these rational homotopy groups whose E^1 term is defined in terms of braid…
For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…
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…
The Golodness of a simplicial complex is defined algebraically in terms of the Stanley-Reisner ring, and it has been a long-standing problem to find its combinatorial characterization. The tightness of a simplicial complex is a…
We investigate the large scale chaotic, topological structure of the trajectories of an infinite sequence of dispersing, hence ergodic, $2D$ billiards with the configuration space $Q_n=\mathbb{T}^2 \setminus \bigcup_{i=0}^{n-1} D_i$, where…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We compute an explicit rank bound on the Picard group of the compact surfaces, which can serve as the base of an elliptic Calabi-Yau variety with canonical singularities. To bound the Picard rank from above, we develop a novel strategy in…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
For a given rotation number we compute the Hausdorff dimension of the set of well approximable numbers. We use this result and an inhomogeneous version of Jarnik's theorem to show strong recurrence properties of the billiard flow in certain…
Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…
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…
A rational triangle has rational edge-lengths and area; a rational tetrahedron has rational faces and volume; either is Heronian when its edge-lengths are integer, and proper when its content is nonzero. A variant proof is given, via…
Dogru and Tabachnikov in 2003 explored the polygonal outer billiard map in the hyperbolic plane and introduced a class of convex polygons called 'large'. They particularly sought conditions for a triangle to be classified as large. For a…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
This paper is devoted to the quantum chaology of three-dimensional systems. A trace formula is derived for compact polyhedral billiards which tessellate the three-dimensional hyperbolic space of constant negative curvature. The exact trace…
We consider an arrangement $\A$ of $n$ hyperplanes in $\R^d$ and the zone $\Z$ in $\A$ of the boundary of an arbitrary convex set in $\R^d$ in such an arrangement. We show that, whereas the combinatorial complexity of $\Z$ is known only to…
Using heuristic arguments based on the trace formulas, we analytically calculate the semiclassical two-point correlation form factor for a family of rectangular billiards with a barrier of height irrational with respect to the side of the…