English
Related papers

Related papers: On the Morse-Hedlund complexity gap

200 papers

In this paper we consider the existence of dense embeddings of Limit groups in locally compact groups generalizing earlier work of Breuillard, Gelander, Souto and Storm [GBSS] where surface groups were considered. Our main results are…

Group Theory · Mathematics 2012-04-17 Jonathan Barlev , Tsachik Gelander

We prove that a free boundary curve shortening flow on closed surfaces with a strictly convex boundary remains noncollapsed for a finite time in the sense of the reflected chord-arc profile introduced by Langford-Zhu. This shows that such…

Differential Geometry · Mathematics 2023-11-07 Dongyeong Ko

Gordeev and Haeusler [GH19] claim that each tautology $\rho$ of minimal propositional logic can be proved with a natural deduction of size polynomial in $|\rho|$. This builds on work from Hudelmaier [Hud93] that found a similar result for…

Computational Complexity · Computer Science 2022-12-26 Michael C. Chavrimootoo , Ethan Ferland , Erin Gibson , Ashley H. Wilson

We study the approximation of halfspaces $h:\{0,1\}^n\to\{0,1\}$ in the infinity norm by polynomials and rational functions of any given degree. Our main result is an explicit construction of the "hardest" halfspace, for which we prove…

Computational Complexity · Computer Science 2019-02-06 Alexander A. Sherstov

We prove a new lower bound on the algorithmic information content of points lying on a line in $\mathbb{R}^n$. More precisely, we show that a typical point $z$ on any line $\ell$ satisfies \begin{equation*} K_r(z)\geq \frac{K_r(\ell)}{2} +…

Classical Analysis and ODEs · Mathematics 2025-10-14 Jacob B. Fiedler

For a finite word $w$ we define and study the Kolmogorov structure function $h_w$ for nondeterministic automatic complexity. We prove upper bounds on $h_w$ that appear to be quite sharp, based on numerical evidence.

Formal Languages and Automata Theory · Computer Science 2020-01-31 Bjørn Kjos-Hanssen

In 1982, Seebold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue-Morse word and its complement. We strengthen Seebold's result by showing that the same result holds if the term…

Combinatorics · Mathematics 2007-05-23 Narad Rampersad

We introduce a notion of a length function exponentially distorted on a (compactly generated) subgroup of a locally compact group. We prove that for a connected linear complex Lie group there is a maximum equivalence class of length…

Functional Analysis · Mathematics 2024-10-03 Oleg Aristov

Let $f(z)=\sum_{n\ge0}a_n z^n$ be a transcendental entire function and write $M(r,f):=\max_{|z|=r}|f(z)|$ and $\mu(r,f):=\max_{n\ge0}|a_n|\,r^n$. A problem of Erd\H{o}s asks for the value of $$ B:=\sup_f…

Complex Variables · Mathematics 2026-02-13 Yixin He , Quanyu Tang

In this article, we show that the Kamae-Xue complexity function for an infinite sequence classifies eventual periodicity completely. We prove that an infinite binary word $x_1x_2 \cdots $ is eventually periodic if and only if…

Computational Complexity · Computer Science 2014-04-18 Teturo Kamae , Dong Han Kim

The prefix palindromic length $PPL_u(n)$ of an infinite word $u$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $u$. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that…

Discrete Mathematics · Computer Science 2020-01-09 Anna E. Frid

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…

Combinatorics · Mathematics 2007-05-23 Peter Baláži , Zuzana Masáková , Edita Pelantová

We consider the Gelfand problem with rapidly growing nonlinearities in the two-dimensional bounded strictly convex domains. In this paper, we prove the uniformly boundedness of finite Morse index solutions. As a result, we show that there…

Analysis of PDEs · Mathematics 2025-06-17 Kenta Kumagai

We prove a few uniform versions of the Mordell-Lang Conjecture and of the Shafarevich Conjecture for curves over function fields and their rational points. The main focus is on function fields having high transcendence degree over the…

Algebraic Geometry · Mathematics 2007-05-23 Lucia Caporaso

In 1956 Marguerite Frank and Paul Wolfe proved that a quadratic function which is bounded below on a polyhedron $P$ attains its infimum on $P$. In this work we search for larger classes of sets $F$ with this Frank-and-Wolfe property. We…

Optimization and Control · Mathematics 2018-05-10 J. E. Martinez-Legaz , D. Noll , W. Sosa

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

Combinatorics · Mathematics 2021-09-01 Hiêp Hàn , Marcos Kiwi , Matías Pavez-Signé

Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…

General Topology · Mathematics 2011-01-18 Vassiliki Farmaki , Andreas Koutsogiannis

This paper answers a question raised by Grothendieck in 1970 on the "Grothendieck closure" of an integral linear group and proves a conjecture of the first author made in 1980. This is done by a detailed study of the congruence topology of…

Group Theory · Mathematics 2017-09-20 Alexander Lubotzky , T. N. Venkataramana

Recent progress building on the groundbreaking work of Mabillard and Wagner has shown that there are important differences between the affine and continuous theory for Tverberg-type results. These results aim to describe the intersection…

Combinatorics · Mathematics 2017-02-20 Florian Frick

In this paper, we give an improved Morse index bound of minimal hypersurfaces from Almgren-Pitts min-max construction in any closed Riemannian manifold $M^{n+1}$ $(n+1 \geq 3$), which generalizes a result by X. Zhou…

Differential Geometry · Mathematics 2020-08-24 Yangyang Li