English
Related papers

Related papers: Generalized Thue-Morse words and palindromic richn…

200 papers

Recently, an analogue over $\mathbb{F}_q[T]$ of Landau's theorem on sums of two squares was considered by Bary-Soroker, Smilansky and Wolf. They counted the number of monic polynomials in $\mathbb{F}_q[T]$ of degree $n$ of the form…

Number Theory · Mathematics 2024-11-20 Ofir Gorodetsky

Let Y denote a symmetric association scheme which is Q-polynomial with respect to an ordering E_0,...,E_D of the primitive idempotents. Bannai and Ito conjectured that the associated sequence of multiplicities m_0,...,m_D is unimodal. We…

Combinatorics · Mathematics 2012-08-27 John S. Caughman , IV , Bruce E. Sagan

This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…

Rings and Algebras · Mathematics 2026-05-12 Arijit Mukherjee , Gobinda Sau , Arindam Sutradhar

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina

Let $1 \leq a \leq b$ be integers. A triple of the form $(x,ax+d,bx+2d)$, where $x,d$ are positive integers is called an {\em (a,b)-triple}. The {\em degree of regularity} of the family of all $(a,b)$-triples, denoted dor($a,b)$, is the…

Combinatorics · Mathematics 2007-05-23 Nikos Frantzikinakis , Bruce Landman , Aaron Robertson

We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free…

Number Theory · Mathematics 2026-01-21 Daniel R. Johnston , Bryce Kerr

This paper naturally extends and generalizes our previous work "Thue-Morse constant is not badly approximable", arXiv:1407.3182 [math.NT]. Here we consider the Laurent series $f_d(x) = \prod_{n=0}^\infty (1 - x^{-d^n})$, $d\in\mathbb{N}$,…

Number Theory · Mathematics 2015-09-02 Dzmitry Badziahin , Evgeny Zorin

Suppose a positive integer $n$ is written as a sum of squares of $m$ integers. What can one say about the value $T$ of the sum of these $m$ integers itself? Which $T$ can be obtained if one considers all possible representations of $n$ as a…

Number Theory · Mathematics 2019-02-22 Detlev W. Hoffmann

In this paper we consider the palindromes that can be formed by taking unordered sets of $n$ elements from an alphabet of $b$ letters. In particular, we seek to find the probability that given a random member of this space we are able to…

Combinatorics · Mathematics 2016-04-11 Alexander Burlton

A map between manifolds induces stratifications of both the source and the target according to the occurring multisingularities. In this paper, we study universal expressions-called higher Thom polynomials-that describe the…

Algebraic Geometry · Mathematics 2025-10-28 Jakub Koncki , Richárd Rimányi

Chessboard complexes and their generalizations, as objects, and Discrete Morse theory, as a tool, are presented as a unifying theme linking different areas of geometry, topology, algebra and combinatorics. Edmonds and Fulkerson bottleneck…

Metric Geometry · Mathematics 2020-03-10 Duško Jojić , Gaiane Panina , Siniša T. Vrećica , Rade T. Živaljević

The classical Tutte polynomial is a two-variate polynomial $T_G(x,y)$ associated to graphs or more generally, matroids. In this paper, we introduce a polynomial $\widetilde{T}_H(x,y)$ associated to a bipartite graph $H$ that we call the…

Combinatorics · Mathematics 2024-05-08 Csongor Beke , Gergely Kál Csáji , Péter Csikvári , Sára Pituk

Taking the product of (2n+1)/(2n+2) raised to the power +1 or -1 according to the n-th term of the Thue-Morse sequence gives rise to an infinite product P while replacing (2n+1)/(2n+2) with (2n)/(2n+1) yields an infinite product Q, where P…

Number Theory · Mathematics 2014-07-01 Jean-Paul Allouche

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

Combinatorics · Mathematics 2009-06-12 E. Rodney Canfield , Brendan D. McKay

Suppose ${\bf b}=\{b_n\}_{n=1}^{\infty}$ is a sequence of integers bigger than 1 and ${\bf D}=\{{\mathcal D}_{n}\}_{n=1}^{\infty}$ is a sequence of consecutive digit sets. Let $\mu_{{\bf b},{\bf D}}$ be the Cantor-Moran measure defined by…

Functional Analysis · Mathematics 2025-02-12 Lixiang An , Qian Li , Minmin Zhang

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u)=\sum_{n=0}^{\infty} T(n) in which D(u) denotes the defect of u and T(n) denotes C(n+1)-C(n)+2-P(n+1)-P(n), where C…

Combinatorics · Mathematics 2013-02-05 Lubomira Balkova , Edita Pelantova , Stepan Starosta

In this paper, we construct a mixed-base number system over the generalized symmetric group $G(m,1,n)$, which is a complex reflection group with a root system of type $B_n^{(m)}$. We also establish one-to-one correspondence between all…

Combinatorics · Mathematics 2023-05-09 Hasan Arslan , Alnour Altoum , Mariam Zaarour

For a positive integer $m$ and a subgroup $\Lambda$ of the unit group $(\mathbb{Z}/m\mathbb{Z})^\times$, the corresponding generalized Kloosterman sum is the function $K(a,b,m,\Lambda) = \sum_{u \in \Lambda}e(\frac{au + bu^{-1}}{m})$.…

We study morphisms from certain classes and their action on episturmian words. The first class is $P_{ret}$. In general, a morphism of class $P_{ret}$ can map an infinite word having zero palindromic defect to a word having infinite…

Combinatorics · Mathematics 2015-10-09 Štěpán Starosta

The prefix palindromic length $\mathrm{PPL}_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. Since 2013, it is still unknown if…

Formal Languages and Automata Theory · Computer Science 2021-06-10 Anna E. Frid , Enzo Laborde , Jarkko Peltomäki