English
Related papers

Related papers: Characterization of substitution invariant 3iet wo…

200 papers

Inversion sequences of length $n$, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and…

Combinatorics · Mathematics 2018-01-09 Megan A. Martinez , Carla D. Savage

We consider Parikh images of languages accepted by non-deterministic finite automata and context-free grammars; in other words, we treat the languages in a commutative way --- we do not care about the order of letters in the accepted word,…

Formal Languages and Automata Theory · Computer Science 2010-03-23 Eryk Kopczyński

We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…

Complex Variables · Mathematics 2025-12-08 John P. D'Angelo , Dusty E. Grundmeier , Daniel A. Lichtblau

We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Benoît Rittaud , Laurent Vivier

We prove that for every integer $n > 0$ and for every alphabet $\Sigma_k$ of size $k \geq 3$, there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely unclustered, i.e., it consists of exactly $n$ runs with…

Discrete Mathematics · Computer Science 2025-08-29 Gabriele Fici , Estéban Gabory , Giuseppe Romana , Marinella Sciortino

A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence…

Discrete Mathematics · Computer Science 2018-05-28 Alessandro De Luca , Gabriele Fici , Luca Q. Zamboni

Define $I_n^k(\alpha)$ to be the set of involutions of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_i$, for some $i \geq 2$, and define $I_n^k(\emptyset;\alpha)$ to be the set of involutions of…

Combinatorics · Mathematics 2007-05-23 Emeric Deutsch , Aaron Robertson , Dan Saracino

We study the Witten--Reshetikhin--Turaev SU(2) invariant for the Seifert manifold with 4-singular fibers. We define the Eichler integrals of the modular forms with half-integral weight, and we show that the invariant is rewritten as a sum…

Mathematical Physics · Physics 2007-05-23 Kazuhiro Hikami

We study the invariant theory of trilinear forms over a three-dimensional complex vector space, and apply it to investigate the behaviour of pure entangled three-partite qutrit states and their normal forms under local filtering operations…

Quantum Physics · Physics 2013-02-12 E. Briand , J. -G. Luque , J. -Y. Thibon , F. Verstraete

The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary…

Combinatorics · Mathematics 2024-02-14 Aseem Baranwal , James Currie , Lucas Mol , Pascal Ochem , Narad Rampersad , Jeffrey Shallit

The celebrated Thue-Morse sequence, or the Prouhet-Thue-Morse sequence (A010060 in the OEIS), has a number of interesting properties and is a rich source to many (counter)examples. We introduce two different square-free sequences on three…

Dynamical Systems · Mathematics 2024-02-13 Diyath Pannipitiya

A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove…

Combinatorics · Mathematics 2014-07-15 Alessandro De Luca , Gabriele Fici

We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, intersection, and difference, 2^m+n and 2^m+n+1 for concatenation,…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Galina Jirásková

Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their…

Formal Languages and Automata Theory · Computer Science 2013-01-22 Michelangelo Bucci , Alessandro De Luca , Gabriele Fici

In the following article, we construct an interaction model (a variant of the SIR-model) of general language change. In the context of language change it is desirable to deduce the long-term behaviour of the corresponding dynamical system…

Dynamical Systems · Mathematics 2024-07-01 Alfred Fuchs , Martin Schwingenheuer , Elisabeth Steinegger , Thomas Voglmaier

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an…

Combinatorics · Mathematics 2007-05-23 J. Bernat , Z. Masáková , E. Pelantová

The space of n (ordered) points on the projective line, modulo automorphisms of the line, is one of the most important and classical examples of an invariant theory quotient, and is one of the first examples given in any course. Generators…

Algebraic Geometry · Mathematics 2007-05-23 Benjamin J. Howard , John Millson , Andrew Snowden , Ravi Vakil

Regular episturmian words are episturmian words whose directive words have a regular and restricted form making them behave more like Sturmian words than general episturmian words. We present a method to evaluate the initial nonrepetitive…

Formal Languages and Automata Theory · Computer Science 2024-03-28 Jarkko Peltomäki

Point transformations of the 3-rd order ordinary differential equations are considered. Special classes of ordinary differential equations that are invariant under the general point transformations are constructed.

Classical Analysis and ODEs · Mathematics 2007-05-23 Vera V. Dmitrieva

The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Janusz Brzozowski , Gareth Davies