Related papers: Counting Abelian Squares More Efficiently

We give some higher dimensional analogues of the Durfee square formula and point out their relation to dissections of multipartitions. We apply the results to write certain affine Lie algebra characters in terms of Universal Chiral…

We prove that the frequency of abc equations c^n = a+b satisfying the strong abc - conjecture is phi(c^n)/2+o(phi(c^n)/2), for n going to infinity.

We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…

We prove that for any two integers $g\geq 4$ and $g'\leq 2g-1$, there exist abelian varieties over $\overline{\mathbb{Q}}$ which are not quotients of a Jacobian of dimension $g'$. Our method in fact proves that most Abelian varieties…

In this work, a rationalized algorithm for calculating the quotient of two quaternions is presented which reduces the number of underlying real multiplications. Hardware for fast multiplication is much more expensive than hardware for fast…

The aim of this paper is to determine the non-abelian tensor square and Schur multiplier of groups of square free order and of groups of orders $p^2q$, $pq^2$ and $p^2qr$, where $p$, $q$ and $r$ are primes and $p<q<r$.

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…

In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of…

We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…

An associative magic square is a magic square such that the sum of any 2 cells at symmetric positions with respect to the center is constant. The total number of associative magic squares of order 7 is enormous, and thus, it is not…

Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement…

Triangular numbers that are multiple of other triangular numbers are investigated. It is known that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers which are triangular numbers. If the…

Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…

For a rational number $q$, a rational $D(q)$-$n$-tuple is a set of $n$ distinct nonzero rationals $\{a_1, a_2, \dots, a_n\}$ such that $a_ia_j+q$ is a rational square for all $1 \leqslant i < j \leqslant n$. For every $q$ we find all…

In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…

We prove that the irregularity of a smooth abelian scroll whose dimension is at least half of that of the surrounding projective space is bounded by 2. In addition we discuss some existence results and open problems.

In this paper, we give a fast algorithm for the computation of the Arf closure of an algebroid curve with more than one branch, generalizing an algorithm presented by Arslan and Sahin for the algebroid branch case.

We present a method, illustrated by several examples, to find explicit counts of permutations containing a given multiset of three letter patterns. The method is recursive, depending on bijections to reduce to the case of a smaller…

Let $P$ be an arbitrary point on an elliptic curve over the complex numbers of the form $y^2=x^3+a_4\,x+a_6$ or of the form $y^2=x^3+a_2\,x^2+a_4\,x$. We provide explicit formulae to compute the points $P/2$, i.e., the points $Q$ such that…