SearcharxivSearch

arXiv subjects

Ivan Mitrofanov

Publications and source records attributed to Ivan Mitrofanov.

15 recordsLinked to original sources

Triangle covering problems and the Viterbo inequality in the plane

We review a certain problem on covering triangles in the plane. Equivalently, it can be viewed as a family of 'isobilliard' inequalities in convex shapes, and as a special case of Viterbo's conjecture in symplectic geometry. We give an elementary overview of these topics and, using the optics of the covering problem, we establish several new special cases of Viterbo's conjecture, provide a simple explanation of the counterexample of Haim-Kislev and Ostrover, and state a few open questions. The main novel result is a proof of Viterbo's conjecture for lagrangian products $K \times Q$, where $Q \subset \mathbb{R}^2$ is any quadrilateral and $K \subset \mathbb{R}^2$ is any convex shape.

math.MG

Super-Arrhenius relaxation of the triangular plaquette model in any dimension

Consider the following plaquette model from statistical physics: a lamp lies at every vertex of the triangular lattice and a switch lies at every even vertex of the (bipartite) dual hexagonal lattice. Each switch toggles the three lamps on its face. The energy of a configuration is the number of ON lamps. For the Glauber dynamics associated with the Gibbs measure defined by this Hamiltonian at any inverse temperature $β>0$, we show that, in any dimension $d\ge 2$, the infinite volume relaxation time satisfies \[e^{β^2/C}/C \le T_{\mathrm{rel}}\le Ce^{e^{Cβ}}\] for some $C>0$. Our result entails that the Gibbs measure is unique. The $e^{β^2}$ scaling was conjectured by Newman and Moore in 1999 and matches the behaviour of supercritical rooted kinetically constrained models such as the East model, thus recovering fragile glass phenomenology in the absence of kinetic constraints. More precisely, we show that, on a torus of side length $2^k$, when $β\to\infty$ and $k/β\to0$, we have $T_{\mathrm{rel}}=e^{2βk(1+o(1))}$. Quite surprisingly, however, we also prove that, on non-periodic finite domains of size $n\le e^{β/C}$ for large $C>0$, we have the much larger asymptotics $\ln T_{\mathrm{rel}}=βn^{Θ(1)}$. The main ingredients of the proofs are new results in extremal and enumerative combinatorics and rely on renormalisation ideas for the dynamics and its groundstates also known as the Ledrappier subshift. We note consequences of our results to geometric group theory (more precisely to the complexity of the word problem for the Baumslag finitely presented group) and to ergodic theory.

math.PR

Finite dimensional amenable groups

We show that an amenable group of finite Assouad-Nagata dimension satisfies the property $H_{FD}$ of Shalom. Such infinite groups are known to admit a virtual homomorphism onto $\mathbb{Z}$, and thus our result implies that an amenable group of finite $AN$-dimension cannot be a simple group. We can also conclude that an amenable group of finite $AN$-dimension cannot be a torsion group. Our proof is based on new estimates of diameters of Følner couples. We prove that any amenable group of finite $AN$-dimension admits Følner couples inside balls of linear diameter and more generally estimate the radius of the balls containing Følner couples in groups of finite asymptotic dimension. This result strengthens the result of Nowak about diameters of Følner sets.

math.GR

Factor Complexity of the Most Significant Digits of~$a^{n^d}$

We investigate unipotent dynamics on a torus and apply these techniques to the following problem. Let \(d\) be a positive integer, and let \(a > 0\) be a real number. For an integer \(b \geqslant 5\), such that \(a\) and \(b\) are multiplicatively independent, consider the sequence \((\mathbf{w}_n)\), where \(\mathbf{w}_n\) is the most significant digit of \(a^{n^d}\) when expressed in base \(b\). We prove that the complexity function of the sequence \((\mathbf{w}_n)\) is, up to finitely many exceptions, a polynomial function.

math.DS

Spaces that can be ordered effectively: virtually free groups and hyperbolicity

We study asymptotic invariants of metric spaces, defined in terms of the travelling salesman problem, and our goal is to classify groups and spaces depending on how well they can be ordered in this context. We characterize virtually free groups as those admitting an order which has some efficiency on $4$-point subsets. We show that all $δ$-hyperbolic spaces can be ordered extremely efficiently, for the question when the number of points of a subset tends to $\infty$.

math.CO

Assouad-Nagata dimension and gap for ordered metric spaces

We prove that all spaces of finite Assouad-Nagata dimension admit a good order for Travelling Salesman Problem, and provide sufficient conditions under which the converse is true. We formulate a conjectural characterisation of spaces of finite $AN$-dimension, which would yield a gap statement for the efficiency of orders on metric spaces. Under assumption of doubling, we prove a stronger gap phenomenon about all orders on a given metric space.

math.GR

Periodicity of Rauzy Scheme for substitution words

From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes. This fact has consequence in discrete dynamic systems and logic. This fact is also generalization of fact that quadratic irrationals have periodic chain fractions.

math.DS

Periodicity of Rauzy scheme and substitutional systems

In the paper the notion of {\em Rauzy scheme} is introduced. From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes. This is generalization of fact that quadratic irrationals have periodic chain fractions.

math.DS

On uniform recurrence of HD0l systems

We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.

math.CO