Counting abelian squares
From MaRDI portal
Abstract: An abelian square is a string of length 2n where the last n symbols form a permutation of the first n symbols. In this note we count the number of abelian squares and give an asymptotic estimate of this quantity.
Summary: An abelian square is a nonempty string of length \(2n\) where the last \(n\) symbols form a permutation of the first \(n\) symbols. Similarly, an abelian \(r\)'th power is a concatenation of \(r\) blocks, each of length \(n\), where each block is a permutation of the first \(n\) symbols. In this note we point out that some familiar combinatorial identities can be interpreted in terms of abelian powers. We count the number of abelian squares and give an asymptotic estimate of this quantity.
Recommendations
Cited in
(29)- Anagram-free graph colouring
- A graph theoretic approach to graded identities for matrices.
- A supercongruence for generalized Domb numbers
- Norms of composition operators on the H^2 space of Dirichlet series
- Supercongruences for sums involving Domb numbers
- Moments in Pearson's four-step uniform random walk problem and other applications of very well-poised generalized hypergeometric series
- Some conjectural supercongruences related to Bernoulli and Euler numbers
- Generalized Lucas congruences and linear \(p\)-schemes
- On two congruence conjectures
- Counting abelian squares efficiently for a problem in quantum computing
- Words with the maximum number of abelian squares
- Mahler measures, short walks and log-sine integrals
- Abelian-primitive partial words
- Counting results for thin Butson matrices
- scientific article; zbMATH DE number 1052838 (Why is no real title available?)
- Arithmetic properties of Apéry-like numbers
- Telescoping method and congruences for double sums
- Two triple binomial sum supercongruences
- Counting Perron numbers by absolute value
- Asymptotic analysis of sums of powers of multinomial coefficients: a saddle point approach
- String reconstruction from substring compositions
- Densities of short uniform random walks in higher dimensions
- Abelian combinatorics on words: a survey
- Some arithmetic properties of short random walk integrals
- An improved algorithm for code equivalence
- Powers of 2 in high-dimensional lattice walks
- Gaussian broadcast on grids
- Graded polynomial identities for matrices with the transpose involution
- Bounded affine permutations. II: Avoidance of decreasing patterns
This page was built for publication: Counting abelian squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380226)
