English
Related papers

Related papers: Abelian Repetition Threshold Revisited

200 papers

We define a new quantitative measure for an arbitrary factorial language: the entropy of a random walk in the prefix tree associated with the language; we call it Markov entropy. We relate Markov entropy to the growth rate of the language…

Formal Languages and Automata Theory · Computer Science 2021-05-07 Elena A. Petrova , Arseny M. Shur

Frequency of letters in a symbolic sequence ${\bf u}$ over a finite alphabet is one of the basic characteristics of ${\bf u}$. The notion of $k$-balancedness captures the property that the number of any letter occurring in two arbitrary…

Combinatorics · Mathematics 2025-09-09 Lubomíra Dvořáková , Edita Pelantová

We give various estimates of the minimal number of self-intersections of a nontrivial element of the kth term of the lower central series and derived series of the fundamental group of a surface. As an application, we obtain a new…

Geometric Topology · Mathematics 2020-06-08 Justin Malestein , Andrew Putman

An arc is a subset of $\mathbb F_q^2$ which does not contain any collinear triples. Let $A(q,k)$ denote the number of arcs in $\mathbb F_q^2$ with cardinality $k$. This paper is primarily concerned with estimating the size of $A(q,k)$ when…

Combinatorics · Mathematics 2020-10-13 Oliver Roche-Newton , Audie Warren

We examine the reset threshold of randomly generated deterministic automata. We present a simple proof that an automaton with a random mapping and two random permutation letters has a reset threshold of $\mathcal{O}\big( \sqrt{n \log^3 n}…

Combinatorics · Mathematics 2023-12-05 Balázs Gerencsér , Zsombor Várkonyi

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

Number Theory · Mathematics 2026-05-12 Christian Bernert , Tim Browning , Jared Duker Lichtman , Joni Teräväinen

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

A tri-colored sum-free set in an abelian group $H$ is a collection of ordered triples in $H^3$, $\{(a_i,b_i,c_i)\}_{i=1}^m$, such that the equation $a_i+b_j+c_k=0$ holds if and only if $i=j=k$. Using a variant of the lemma introduced by…

Combinatorics · Mathematics 2016-05-27 Robert Kleinberg

Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We…

Algebraic Geometry · Mathematics 2015-07-08 Jan Draisma , Rob H. Eggermont

The combinatorics of squares in a word depends on how the equivalence of halves of the square is defined. We consider Abelian squares, parameterized squares, and order-preserving squares. The word $uv$ is an Abelian (parameterized,…

Discrete Mathematics · Computer Science 2016-04-11 Tomasz Kociumaka , Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń

In 2001 Allen and Steel showed that, if subtree and chain reduction rules have been applied to two unrooted phylogenetic trees, the reduced trees will have at most 28k taxa where k is the TBR (Tree Bisection and Reconnection) distance…

Data Structures and Algorithms · Computer Science 2021-04-13 Steven Kelk , Simone Linz

We show that for every $k\in\mathbb{N}$ and $\varepsilon>0$, for large enough alphabet $R$, given a $k$-CSP with alphabet size $R$, it is NP-hard to distinguish between the case that there is an assignment satisfying at least…

Computational Complexity · Computer Science 2025-10-29 Dor Minzer , Kai Zhe Zheng

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Combinatorics · Mathematics 2010-11-04 Balazs Szegedy

We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…

Combinatorics · Mathematics 2015-03-13 Joel Brewster Lewis

For a given integer $k$, let $\ell_k$ denote the supremum $\ell$ such that every sufficiently large graph $G$ with average degree less than $2\ell$ admits a separator $X \subseteq V(G)$ for which $\chi(G[X]) < k$. Motivated by the values of…

Combinatorics · Mathematics 2025-10-03 Guillaume Aubian , Marthe Bonamy , Romain Bourneuf , Oscar Fontaine , Lucas Picasarri-Arrieta

Let $K$ be a field finitely generated over ${\Q}$, and $A$ an Abelian variety defined over $K$. Then by the Mordell-Weil Theorem, the set of rational points $A(K)$ is a finitely-generated Abelian group. In this paper, assuming Tate's…

Number Theory · Mathematics 2007-05-23 Rania Wazir

A finite word $w$ is an abelian square if $w = xx^\prime$ with $x^\prime$ a permutation of $x$. In 1972, Entringer, Jackson, and Schatz proved that every binary word of length $k^2 + 6k$ contains an abelian square of length $\geq 2k$. We…

Combinatorics · Mathematics 2010-12-03 Elyot Grant

A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…

Combinatorics · Mathematics 2022-09-16 Shuo Li

We prove an inequality that complements the famous Araki-Lieb-Thirring (ALT) inequality for positive matrices $A$ and $B$, by giving a lower bound on the quantity $\trace[A^r B^r A^r]^q$ in terms of $\trace[ABA]^{rq}$ for $0\le r\le 1$ and…

Functional Analysis · Mathematics 2011-07-01 Koenraad M. R. Audenaert

Let $A$ be an abelian variety defined over a number field $\mathbb{Q}$, and let $\hat{h}$ be the N\'eron-Tate height on $A(\overline{\mathbb{Q}})$ corresponding to a symmetric ample line bundle on $A$. In this article, we prove that the…

Number Theory · Mathematics 2026-01-22 Sushant Kala