Related papers: Counting Abelian Squares
The online square detection problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. Recall that a square is a string that is a concatenation of two identical strings. In this…
A k-magic square of order n is an arrangement of the numbers from 0 to kn-1 in an n by n matrix, such that each row and each column has exactly k filled cells, each number occurs exactly once, and the sum of the entries of any row or any…
Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$. We give an algorithm that finds all the abelian runs of…
We introduce the concept of the modularity of an abelian variety defined over the rational number field extending the modularity of an elliptic curve. We discuss the modularity of an abelian variety over the rational number field. We…
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…
We describe the set of characteristic polynomials of abelian varieties of dimension 4 over finite fields.
The number of maximal abelian subgroups of a finite p-group is shown to be congruent to 1 modulo p.
In an $n \times n$ array filled with symbols, a transversal is a collection of entries with distinct rows, columns and symbols. In this note we show that if no symbol appears more than $\beta n$ times, the array contains a transversal of…
We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half…
We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.
For any given Salem number, we construct an automorphism on a simple abelian variety whose first dynamical degree is the square of the Salem number. Our construction works for both simple abelian varieties with totally indefinite quaternion…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
Lagrange's Four Squares Theorem states that any positive integer can be expressed as the sum of four integer squares. We investigate the analogous question over Quaternion rings, focusing on squares of elements of Quaternion rings with…
A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…
We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…
An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…
We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
A Heronian triangle is a triangle that has integer side lengths and integer area. Praton and Shalqini [1] define amicable Heronian triangles to be two Heronian triangles where the area of one equals the perimeter of the other, and vice…
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.