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.
Recommendations
Cited in
(26)- scientific article; zbMATH DE number 1052838 (Why is no real title available?)
- Bounded affine permutations. II: Avoidance of decreasing patterns
- Some arithmetic properties of short random walk integrals
- Abelian combinatorics on words: a survey
- Counting results for thin Butson matrices
- Asymptotic analysis of sums of powers of multinomial coefficients: a saddle point approach
- Norms of composition operators on the \(H^2\) space of Dirichlet series
- Graded polynomial identities for matrices with the transpose involution
- Densities of short uniform random walks in higher dimensions
- A graph theoretic approach to graded identities for matrices.
- Generalized Lucas congruences and linear \(p\)-schemes
- On two congruence conjectures
- A supercongruence for generalized Domb numbers
- 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
- Counting Perron numbers by absolute value
- String reconstruction from substring compositions
- Anagram-free graph colouring
- Words with the maximum number of abelian squares
- Two triple binomial sum supercongruences
- Counting abelian squares efficiently for a problem in quantum computing
- Telescoping method and congruences for double sums
- Some conjectural supercongruences related to Bernoulli and Euler numbers
- Mahler measures, short walks and log-sine integrals
- Abelian-primitive partial words
- Arithmetic properties of Apéry-like numbers
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)
