Related papers: Abelian-square factors and binary words
In this paper, we prove a conjecture by Daniele Mundici on the sum of squared distances between consecutive elements in the $Q$-th Farey sequence for $Q\in\mathbb{Z}$ and $Q\geq 2$.
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…
The Ciliberto-Di Gennaro conjecture addresses the factoriality of three-dimensional nodal hypersurfaces, and their geometric properties. We prove this conjecture for hypersurfaces of degree 6 by adapting a recent technique due to R.…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…
Buch and Fulton conjectured the nonnegativity of the quiver coefficients appearing in their formula for a quiver variety. Knutson, Miller and Shimozono proved this conjecture as an immediate consequence of their ``component formula''. We…
Bourbaki seminar 1062, October 2012.
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…
In this paper we prove the WALA conjecture.
Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…
Deciding periodicity of infinite words generated by morphisms is a classical result in combinatorics on words from 80's by Harju, Linna and Pansiot. In this paper, we are interested in this question in the abelian setting. Two words are…
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
Recently, Ni and Pan proved a $q$-congruence on certain sums involving central $q$-binomial coefficients, which was conjectured by Guo. In this paper, we give a generalization of this $q$-congruence and confirm another $q$-congruence, also…
Defining the biperiodic Fibonacci words as a class of words over the alphabet $\{0,1\}$, and two specializations the $k-$Fibonacci and classical Fibonacci words, we provide a self-similar decomposition of these words into overlapping words…
A famous conjecture attributed to Dardano-Dikranjan-Rinauro-Salce states that any uniformly fully inert subgroup of a given group is commensurable with a fully invariant subgroup (see, respectively, [5] and [6]). In this short note, we…
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$,…
The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We…
We present a proof of a conjecture of Goh and Wildberger on the factorization of the spread polynomials. We indicate how the factors can be effectively calculated and exhibit a connection to the factorization of Fibonacci numbers into…