Related papers: Complexity lower bound for typical right triangula…
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…
We characterize quantum dynamics in triangular billiards in terms of five properties: (1) the level spacing ratio (LSR), (2) spectral complexity (SC), (3) Lanczos coefficient variance, (4) energy eigenstate localisation in the Krylov basis,…
The barrier billiard is the simplest example of pseudo-integrable models with interesting and intricate classical and quantum properties. Using the Wiener-Hopf method it is demonstrated that quantum mechanics of a rectangular billiard with…
We construct an explicit lower bound for the volume of a complex hyperbolic orbifold that depends only on dimension.
We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…
The aim of this paper is to study quasi-rational polygons related to the outer billiard. We compare different notions introduced, and make a synthesis of those.
Let T be a triangulation of S^3 containing a link L in its 1-skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
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 apply the technique of K\'aroly Bezdek and Daniel Bezdek to study billiard trajectories in convex bodies, when the length is measured with a (possibly asymmetric) norm. We prove a lower bound for the length of the shortest closed…
We show ergodicity of (asymmetric) lemon billiards, billiard tables that are the intersection of two circles of which one contains the centers of both. These do not satisfy the Wojtkowski criteria for hyperbolicity, but we establish…
In specific types of partially rectangular billiards we estimate the mass of an eigenfunction of energy $E$ in the region outside the rectangular set in the high-energy limit. We use the adiabatic ansatz to compare the Dirichlet energy form…
We establish sharp lower bounds for the $2k$-th moment in the range $k \geq 1/2$ of the family of quadratic twists of modular $L$-functions at the central point.
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
We classify integrable bounded simple weight modules over classical Lie superalgebras at infinity. We also study the categories of such modules, and we prove that for most of the classical Lie superalgebras at infinity the respective…
This article is concerned with the study of Mather's \beta-function associated to Birkhoff billiards. This function corresponds to the minimal average action of orbits with a prescribed rotation number and, from a different perspective, it…
We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…
We provide a Mahler/Elkies-style lower bound for the average values of dynamical Green's functions on the projective line over an arbitrary valued field, and give some dynamical and arithmetic applications.
We study the semiclassical quantization of an ensemble of billiards with a small random shape deformation. We derive a trace formula averaged over shape disorder. The results are illustrated by the study of supershells in rough metal…
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…