Related papers: Counting Abelian Squares More Efficiently

In this paper we obtain an explicit formula for the higher Schur-multiplicator of an arbitrary finite abelian group with respect to the variety of nilpotent groups of class at most $c\geq 1$ .

In the present paper I shall clarify the Babylonian method by which many large tables of reciprocals could be constructed.

The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate…

We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves…

This note gives a simple approach to q-analogues of some results associated with Abel polynomials.

We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string. In particular, we conclude conditional optimality…

In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.

In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit…

Computational approaches to finding non-trivial integer solutions of the equation in the title are discussed. We summarize previous work and provide several new solutions.

We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique, we give the affirmative answer to the open question posed…

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

In this paper, we define an $n$-magic square in a group to be an $(n\times n)$ array of group elements whose rows, columns, and diagonals have the same product. This definition is akin to the idea of magic squares in the integers. Groups…

This paper contains two parts toward studying abelian varieties from the classification point of view. In a series of papers, the current authors and T.-C. Yang obtain explicit formulas for the numbers of superspecial abelian surfaces over…

Until now the problem counting Latin rectangles m x n has been solved with an explicit formula for m = 2, 3 and 4 only. In the present paper an explicit formula is provided for the calculation of the number of Latin rectangles for any order…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

We give a new proof of Milne's formulas for the number of representations of an integer as a sum of 4m^2 and 4m(m+1) squares. The proof is based on explicit evaluation of pfaffians with elliptic function entries, and relates Milne's…

In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…

Magic squares are a fascinating mathematical challenge that has intrigued mathematicians for centuries. Given a positive (and possibly large) integer \( n \), one of the main challenges that still remains is to find, within a computational…