English
Related papers

Related papers: Words avoiding 7/3-powers and the Thue-Morse morph…

200 papers

We prove that if $A$ is a string algebra then there are not three irreducible morphisms between indecomposable $A$-modules such that its composition belongs to $\Re^{6} \backslash \Re^{7}$, whenever the compositions of two of them are not…

Representation Theory · Mathematics 2021-02-17 Claudia Chaio , Victoria Guazzelli , Pamela Suarez

Let $(M,\omega)$ be a geometrically bounded symplectic manifold, $N\subseteq M$ a closed, regular (i.e. "fibering") coisotropic submanifold, and $\phi:M\to M$ a Hamiltonian diffeomorphism. The main result of this article is that the number…

Symplectic Geometry · Mathematics 2012-09-04 Fabian Ziltener

Repetition avoidance has been studied since Thue's work. In this paper, we considered another type of repetition, which is called pseudo-power. This concept is inspired by Watson-Crick complementarity in DNA sequence and is defined over an…

Formal Languages and Automata Theory · Computer Science 2009-11-13 Ehsan Chiniforooshan , Lila Kari , Zhi Xu

Given an infinite word ${\bf w}$ on a finite alphabet, an immediate question arises:~can we understand the frequency of letters in ${\bf w}$\,? For words that are the fixed points of substitutions, the answer to this question is often `yes'…

Combinatorics · Mathematics 2024-10-17 Michael Coons , Christopher Ramsey , Nicolae Strungaru

A bubble of nothing is a spacetime instability where a compact dimension collapses. After nucleation, it expands at the speed of light, leaving "nothing" behind. We argue that the topological and dynamical mechanisms which could protect a…

High Energy Physics - Theory · Physics 2020-05-15 Iñaki García Etxebarria , Miguel Montero , Kepa Sousa , Irene Valenzuela

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

Combinatorics · Mathematics 2015-03-13 Stefka Bouyuklieva , Nikolay Yankov , Radka Russeva

We study a question of Harju from 2019 regarding the existence of infinite ternary square-free words whose subsequences modulo $p$ and $q$ are also square-free for relatively prime integers $p$ and $q$. Among such pairs $(p, q)$ with $p, q…

Combinatorics · Mathematics 2026-05-29 Thomas Delépine , Pascal Ochem , Matthieu Rosenfeld

A smooth, compact 4-manifold with a Riemannian metric and b^(2+) > 0 has a non-trivial, closed, self-dual 2-form. If the metric is generic, then the zero set of this form is a disjoint union of circles. On the complement of this zero set,…

Symplectic Geometry · Mathematics 2014-11-11 Clifford Henry Taubes

We revisit the question of classification of balanced circular words and focus on the case of a ternary alphabet. We propose a $3$-dimensional generalisation of the discrete approximation representation of Christoffel words. By considering…

Combinatorics · Mathematics 2021-05-03 D. V. Bulgakova , N. Buzhinsky , Y. O. Goncharov

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

Combinatorics · Mathematics 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

The aim of this paper is to demonstrate that very many Dehn fillings on a cusped hyperbolic 3-manifold yield a 3-manifold which is irreducible, atoroidal and not Seifert fibred, and which has infinite, word hyperbolic fundamental group. We…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).

Discrete Mathematics · Computer Science 2008-05-12 Brendan Lucier

Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden.…

Information Theory · Computer Science 2023-08-23 Simon R. Blackburn , Navid Nasr Esfahani , Donald L. Kreher , Douglas R. Stinson

In this paper we study the privileged complexity function of the Thue-Morse word. We prove a recursive formula describing this function, and using the formula we show that the function is unbounded and that the values of the function have…

Combinatorics · Mathematics 2015-07-23 Jarkko Peltomäki

Non-alternating Hamiltonian Lie algebras in three variables over a perfect field of characteristic 2 are considered. A classification of non-alternating Hamiltonian forms over an algebra of divided powers in three variables and of the…

Rings and Algebras · Mathematics 2021-01-05 A. V. Kondrateva

Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…

Algebraic Geometry · Mathematics 2024-12-20 Chatchai Noytaptim , Xiao Zhong

Generalized pseudostandard word $\bf u$, as introduced in 2006 by de Luca and De Luca, is given by a directive sequence of letters from an alphabet ${\cal A}$ and by a directive sequence of involutory antimorphisms acting on ${\cal A}^*$.…

Combinatorics · Mathematics 2015-03-12 Tatiana Jajcayová , Edita Pelantová , Štěpán Starosta

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

Combinatorics · Mathematics 2025-12-04 Vuong Bui , Matthieu Rosenfeld

We explore some curious implications of Seiberg duality for an SU(2) four-dimensional gauge theory with eight chiral doublets. We argue that two copies of the theory can be deformed by an exactly marginal quartic superpotential so that they…

High Energy Physics - Theory · Physics 2015-06-11 Tudor Dimofte , Davide Gaiotto

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins
‹ Prev 1 4 5 6 7 8 10 Next ›