Related papers: Counting Abelian Squares

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…

The Babylonian graph B has the positive integers as vertices and connects two if they define a Pythagorean triple. Triangular subgraphs correspond to Euler bricks. What are the properties of this graph? Are there tetrahedral subgraphs…

Using Abelian Bosonization, we develop a simple and powerful method to calculate the correlation functions of the two channel Kondo model and its variants. The method can also be used to identify all the possible boundary fixed points and…

We generalize two well-known enumerative facts. The first, due to Clebsch, says that a general binary sextic form is expressible as the sum of a cube and a square in 40 different ways. The second, due to Zariski and later Vakil, states that…

Let $n$ be a positive integer. In this paper we estimate the size of the set of linear forms $b_1\log a_1 + b_2\log a_2+...+b_n\log a_n$, where $|b_i|\leq B_i$ and $1\leq a_i\leq A_i$ are integers, as $A_i,B_i\to \infty$.

We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.

In recreational mathematics, a normal magic square is an $n \times n$ square matrix whose entries are distinctly the integers $1 \ldots n^2$, such that each row, column, and major and minor traces sum to one constant $\mu$. It has been…

The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as…

We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.

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 finite group G is called Schur, if every Schur ring over G is associated in a natural way with a regular subgroup of Sym(G) that is isomorphic to G. We prove that any nonabelian Schur group G is metabelian and the number of distinct prime…

Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear to the string length. As an application, we show how to compute the tree topology of the…

A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A square-free permutation of length $n$ is $P$-crucial, where $P$ is a subset of $\{0,1,\ldots,n\}$, if any of its…

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

This paper deals with surfaces with many lines. It is well-known that a cubic contains 27 of them and that the maximal number for a quartic is 64. In higher degree the question remains open. Here we study classical and new constructions of…

Let $a_k(n)$ denotes the number of representations of a non-negative integer $n$ as sum of $k$ quadratic forms of the type $x^2+xy+y^2$ and $a_{\lambda_1,\lambda_2,\lambda_3\dots\lambda_k}(n)$ denotes the number of representations $n$ as a…

In this article, we give a complete description of the characteristic polynomials of supersingular abelian varieties over finite fields. We list them for the dimensions upto 7.

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

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$.

Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…