English
Related papers

Related papers: Anti-Powers in Primitive Uniform Substitutions

200 papers

Fici, Restivo, Silva, and Zamboni define a $k$-antipower to be a word composed of $k$ pairwise distinct, concatenated words of equal length. Berger and Defant conjecture that for any sufficiently well-behaved aperiodic morphic word $w$,…

Combinatorics · Mathematics 2023-06-22 Swapnil Garg

Fici, Restivo, Silva, and Zamboni define a $\textit{$k$-anti-power}$ to be a concatenation of $k$ consecutive words that are pairwise distinct and have the same length. They ask for the maximum $k$ such that every aperiodic recurrent word…

Combinatorics · Mathematics 2019-02-05 Aaron Berger , Colin Defant

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise…

Discrete Mathematics · Computer Science 2018-05-28 Gabriele Fici , Antonio Restivo , Manuel Silva , Luca Q. Zamboni

We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least…

Combinatorics · Mathematics 2023-09-04 Lara Pudwell , Eric Rowland

Recently, Fici, Restivo, Silva, and Zamboni introduced the notion of a $k$-anti-power, which is defined as a word of the form $w^{(1)} w^{(2)} \cdots w^{(k)}$, where $w^{(1)}, w^{(2)}, \ldots, w^{(k)}$ are distinct words of the same length.…

Combinatorics · Mathematics 2023-06-22 Marisa Gaetz

Words whose three successive factors of the same length are all different i.e. 3-anti-power words are a natural extension of square-free words (two successive factors of the same length are different). We give a way to verify whether a…

Formal Languages and Automata Theory · Computer Science 2023-12-25 Francis Wlazinski

Fici et al. defined a word to be a k-power if it is the concatenation of k consecutive identical blocks, and an r-antipower if it is the concatenation of r pairwise distinct blocks of the same size. They defined N (k, r) as the smallest l…

Formal Languages and Automata Theory · Computer Science 2020-07-07 Lukas Fleischer , Samin Riasat , Jeffrey Shallit

Given a word, we are interested in the structure of its contiguous subwords split into $k$ blocks of equal length, especially in the homogeneous and anti-homogeneous cases. We introduce the notion of $(\mu_1,\dots,\mu_k)$-block-patterns,…

Combinatorics · Mathematics 2018-12-27 Amanda Burcroff

Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word…

Combinatorics · Mathematics 2019-11-28 Karel Klouda , Kateřina Medková , Edita Pelantová , Štěpán Starosta

This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This makes the article almost self-contained. I also contribute by…

Formal Languages and Automata Theory · Computer Science 2026-01-28 Francis Wlazinski

An abelian anti-power of order $k$ (or simply an abelian $k$-anti-power) is a concatenation of $k$ consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion…

Combinatorics · Mathematics 2019-03-26 Gabriele Fici , Mickael Postic , Manuel Silva

Recently, Fici, Restivo, Silva, and Zamboni defined a $k$-anti-power to be a word of the form $w_1w_2\cdots w_k$, where $w_1,w_2,\ldots,w_k$ are distinct words of the same length. They defined $AP(x,k)$ to be the set of all positive…

Combinatorics · Mathematics 2016-10-11 Colin Defant

We prove that there exists a universal constant $c$ such that any finite primitive permutation group of degree $n$ with a non-trivial point stabilizer is a product of no more than $c\log n$ point stabilizers.

Group Theory · Mathematics 2015-08-25 Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

We show that the problem of whether the fixed point of a morphism avoids Abelian $k$-powers is decidable under rather general conditions

Formal Languages and Automata Theory · Computer Science 2011-07-05 James D. Currie , Narad Rampersad

A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. We provide such an algorithm when k >= 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite…

Discrete Mathematics · Computer Science 2016-08-16 Gwénaël Richomme , Francis Wlazinski

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

Group Theory · Mathematics 2015-10-19 Timothy C. Burness , Hung P. Tong-Viet

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Number Theory · Mathematics 2024-01-04 Cathal O'Sullivan , Jonathan P. Sorenson , Aryn Stahl

Let $K$ be an algebraically closed field. Let $G$ be a non-trivial connected unipotent group, which acts effectively on an affine variety $X.$ Then every non-empty component $R$ of the set of fixed points of $G$ is a $K$-uniruled variety,…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

If $f:[a,b]\to \mathbb{R}$, with $a<b$, is continuous and such that $a$ and $b$ are mapped in opposite directions by $f$, then $f$ has a fixed point in $I$. Suppose that $f:\mathbb{C}\to\mathbb{C}$ is map and $X$ is a continuum. We extend…

General Topology · Mathematics 2016-01-25 Alexander Blokh , Lex Oversteegen
‹ Prev 1 2 3 10 Next ›