English
Related papers

Related papers: There exist infinite cube-free words over any sequ…

200 papers

In this paper we answer two recent questions from Charlier et al. and Harju about self-shuffling words. An infinite word $w$ is called self-shuffling, if $w=\prod_{i=0}^\infty U_iV_i=\prod_{i=0}^\infty U_i=\prod_{i=0}^\infty V_i$ for some…

Discrete Mathematics · Computer Science 2014-11-11 Mike Müller , Svetlana Puzynina , Michaël Rao

For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$.

Combinatorics · Mathematics 2009-04-14 James D. Currie , Narad Rampersad

In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Evelyn Nelson , Saharon Shelah

We show that the set of binary words containing overlaps is not unambiguously context-free and that the set of ternary words containing overlaps is not context-free. We also show that the set of binary words that are not subwords of the…

Combinatorics · Mathematics 2009-03-29 Narad Rampersad

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

Number Theory · Mathematics 2020-10-30 Jorge Urroz

Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an alphabet with $k$ letters, where $\alpha$ is a positive rational number and $k$ is positive integer. We prove that if $\alpha\geq 5$, $k\geq…

Formal Languages and Automata Theory · Computer Science 2023-07-10 Josef Rukavicka

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

Number Theory · Mathematics 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is congruent to 2 mod 4. This result, together with a recent proof for 4|N, shows that the conjecture is true for all even N.

Number Theory · Mathematics 2010-09-22 Noam D. Elkies

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…

Dynamical Systems · Mathematics 2019-08-15 Patrick Ingram

Two finite words $u$ and $v$ are called abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of an infinite word $\mathbf{x}$ is the set of infinite words…

Combinatorics · Mathematics 2021-01-01 Juhani Karhumäki , Svetlana Puzynina , Markus A. Whiteland

Let $\mathfrak A$ be an alphabet and $W$ be a set of words in the free monoid ${\mathfrak A}^*$. Let $S(W)$ denote the Rees quotient over the ideal of ${\mathfrak A}^*$ consisting of all words that are not subwords of words in $W$. A set of…

Group Theory · Mathematics 2020-03-25 Olga Sapir

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…

Discrete Mathematics · Computer Science 2015-06-12 Gabriele Fici , Filippo Mignosi

Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…

Rings and Algebras · Mathematics 2019-06-07 Mikhail V. Zaicev , Dušan D. Repovš

We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side $2n$ equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube,…

Combinatorics · Mathematics 2007-05-23 Mihai Ciucu

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…

Number Theory · Mathematics 2025-09-19 Pavlo Yatsyna , Błażej Żmija

The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of the $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. In an article of 2016 Ashrafi and his co-authors proved the non-existence of perfect…

Combinatorics · Mathematics 2018-01-15 Michel Mollard

We solve two long-standing open problems on word equations. Firstly, we prove that a one-variable word equation with constants has either at most three or an infinite number of solutions. The existence of such a bound had been conjectured,…

Combinatorics · Mathematics 2018-05-25 Dirk Nowotka , Aleksi Saarela

Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+sqrt(5))/4. Over larger alphabets, we give…

Combinatorics · Mathematics 2018-01-17 Narad Rampersad , Jeffrey Shallit , Élise Vandomme

We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…

Combinatorics · Mathematics 2025-10-01 Pascal Ochem , Matthieu Rosenfeld

We prove that all cubulated groups are semistable at infinity. In doing so we prove two further results about cubulations of groups. The first of these states that any one-ended cubulated group has a cubulation for which all halfspaces are…

Group Theory · Mathematics 2022-10-17 Sam Shepherd