Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Stipulanti, Manon"'
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which gives the
Externí odkaz:
http://arxiv.org/abs/2410.02409
Autor:
Popoli, Pierre, Stipulanti, Manon
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence possesses go
Externí odkaz:
http://arxiv.org/abs/2408.14059
In combinatorics on words, the well-studied factor complexity function $\rho_{\bf x}$ of a sequence ${\bf x}$ over a finite alphabet counts, for any nonnegative integer $n$, the number of distinct length-$n$ factors of $\mathbf{x}$. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2406.09302
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of Parikh-collinear morphi
Externí odkaz:
http://arxiv.org/abs/2405.18032
Autor:
Jahannia, Marieh, Stipulanti, Manon
We explore the Ziv-Lempel and Crochemore factorizations of some classical automatic sequences making an extensive use of the theorem prover Walnut.
Comment: 15 pages, 2 figures
Comment: 15 pages, 2 figures
Externí odkaz:
http://arxiv.org/abs/2403.15215
Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential generating
Externí odkaz:
http://arxiv.org/abs/2401.13524
Autor:
Allouche, Jean-Paul, Stipulanti, Manon
Publikováno v:
Communications in Mathematics, Volume 33 (2025), Issue 2 (Special issue: Numeration, Liège 2023, dedicated to the 75th birthday of professor Christiane Frougny) (May 9, 2024) cm:12610
We revisit and generalize inequalities for the summatory function of the sum of digits in a given integer base. We prove that several known results can be deduced from a theorem in a 2023 paper by Mohanty, Greenbury, Sarkany, Narayanan, Dingle, Ahner
Externí odkaz:
http://arxiv.org/abs/2311.16806
Christol's theorem states that a power series with coefficients in a finite field is algebraic if and only if its coefficient sequence is automatic. A natural question is how the size of a polynomial describing such a sequence relates to the size of
Externí odkaz:
http://arxiv.org/abs/2308.10977
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with d states t
Externí odkaz:
http://arxiv.org/abs/2304.03268
Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have been studie
Externí odkaz:
http://arxiv.org/abs/2302.13647