English
Related papers

Related papers: On the almost-palindromic width of free groups

200 papers

The Golomb-Welch conjecture deals with the existence of perfect $e$% -error correcting Lee codes of word length $n,$ $PL(n,e)$ codes. Although there are many papers on the topic, the conjecture is still far from being solved. In this paper…

Information Theory · Computer Science 2013-11-12 Peter Horak , Otokar Grosek

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

Let $S$ be a compact orientable surface, and $\Mod(S)$ its mapping class group. Then there exists a constant $M(S)$, which depends on $S$, with the following property. Suppose $a,b \in \Mod(S)$ are independent (i.e., $[a^n,b^m]\not=1$ for…

Geometric Topology · Mathematics 2009-08-10 Koji Fujiwara

For a subset $A$ of $\{1,2,\ldots,N\}^2$ of size $\alpha N^2$ we show existence of $(m,n)\neq(0,0)$ such that the set $A$ contains at least $(\alpha^3 - o(1))N^2$ triples of points of the form $(a,b)$, $(a+m,b+n)$, $(a-n,b+m)$. This answers…

Combinatorics · Mathematics 2021-12-06 Vjekoslav Kovač

We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…

Formal Languages and Automata Theory · Computer Science 2018-07-13 Anna Frid

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

Number Theory · Mathematics 2024-11-27 Bora Çalım , Ioannis Iakovakis , Sophie Long , Jack Moffatt , Deborah Wooton

Let $A_{s,k}(m)$ be the maximum number of distinct letters in any sequence which can be partitioned into $m$ contiguous blocks of pairwise distinct letters, has at least $k$ occurrences of every letter, and has no subsequence forming an…

Combinatorics · Mathematics 2014-09-23 Jesse Geneson

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…

Logic · Mathematics 2012-06-12 Saharon Shelah

We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub , Mike Müller

Let $\mathcal A$ be a separable, unital, approximately divisible C$^*$-algebra. We show that $\mathcal A$ is generated by two self-adjoint elements and the topological free entropy dimension of any finite generating set of $\mathcal A$ is…

Operator Algebras · Mathematics 2008-04-21 Weihua Li , Junhao Shen

In this paper we introduce a generalization of palindromic continued fractions as studied by Adamczewski and Bugeaud. We refer to these generalized palindromes as $m$-palindromes, where $m$ ranges over the positive integers. We provide a…

Number Theory · Mathematics 2017-01-27 David M. Freeman

We prove a generalisation of Vinogradov's theorem by finding for $m\geqslant 3$ and fixed positive integers $c_1, \dots ,c_m, r_1, \dots , r_m$ the asymptotics of the number of sequences $(n_1, \dots ,n_m) \in \mathbf{N}^{m}$ such that…

Number Theory · Mathematics 2022-03-21 Paweł Lewulis

A palindrome in a free group F_n is a word on some fixed free basis of F_n that reads the same backwards as forwards. The palindromic automorphism group \Pi A_n of the free group F_n consists of automorphisms that take each member of some…

Geometric Topology · Mathematics 2016-01-27 Neil J. Fullarton

In this note, we obtain an upper bound on the maximum number of distinct non-empty palindromes in starlike trees. This bound implies, in particular, that there are at most $4n$ distinct non-empty palindromes in a starlike tree with three…

Combinatorics · Mathematics 2018-05-29 Amy Glen , Jamie Simpson , W. F. Smyth

In this paper we describe the profinite completion of the free solvable group on m generators of solvability length r>1. Then, we show that for m=r=2, the free metabelian group on two generators does not have the Congruence Subgroup…

Group Theory · Mathematics 2014-07-22 David El-Chai Ben-Ezra

A complex number $\lambda$ is said to be non-free if the subgroup of $SL(2,\bc)$ generated by $$X=\begin{pmatrix} 1& 1\\ 0 & 1 \end{pmatrix} \,\, \text{and}\,\,\,Y_{\lambda}=\begin{pmatrix} 1& 0\\ \lambda & 1 \end{pmatrix}$$ is not a free…

Group Theory · Mathematics 2024-06-18 Philip Choi , Kyeonghee Jo , Hyuk Kim , Junho Lee

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Group Theory · Mathematics 2017-06-27 Michael Larsen , Aner Shalev

We study presentations, defined by Sidki, resulting in groups $y(m,n)$ that are conjectured to be finite orthogonal groups of dimension $m+1$ in characteristic two. This conjecture, if true, shows an interesting pattern, possibly connected…

Group Theory · Mathematics 2017-07-27 Justin McInroy , Sergey Shpectorov

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

Combinatorics · Mathematics 2016-03-17 Terence Tao , Van Vu

Let $F$ be a non-Abelian free group with basis $A$, $M$ and $N$ be the normal closures of sets $R_M$ and $R_N$ of words in the alphabet $A^{\pm 1}$. As is known, the group $F/[N, N]$ is torsion-free, but, in general, torsion in $F/[M, N]$…

Group Theory · Mathematics 2024-02-19 O. V. Kulikova