Related papers: A circle method approach to K-multimagic squares
We show arithmetic triplets of Gaussian squares are in 3-to-1 correspondence with Pythagorean triples thereof. This correspondence would transform a solution to the Magic Square of Squares puzzle into a larger structure of perfect Gaussian…
Let K be an algebraic number field and O_K be its ring of integers. Let S_K be the set of elements in O_K which are sums of squares in O_K and s(O_K) the minimal number of squares necessary to represent -1in O_K. Let g( S_K ) be the…
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…
An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…
In this paper we provide a new technique to find solutions to the Klein-Gordon-Maxwell system. The method, based on an iterative argument, permits to improve previous results where the reduction method was used. We also show how this device…
Motivated by a recent question of Peyre, we apply the Hardy-Littlewood circle method to count "sufficiently free" rational points of bounded height on arbitrary smooth projective hypersurfaces of low degree that are defined over the…
We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…
There has been recent interest in a hybrid form of the celebrated conjectures of Hardy-Littlewood and of Chowla. We prove that for any $k,\ell\ge1$ and distinct integers $h_2,\ldots,h_k,a_1,\ldots,a_\ell$, we have $$\sum_{n\leq…
A multi-latin square of order $n$ and index $k$ is an $n\times n$ array of multisets, each of cardinality $k$, such that each symbol from a fixed set of size $n$ occurs $k$ times in each row and $k$ times in each column. A multi-latin…
A knight's tour on a board is a sequence of knight moves that visits each square exactly once. A knight's tour on a square board is called magic knight's tour if the sum of the numbers in each row and column is the same (magic constant).…
The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…
Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…
Magic squares have been an enthralling topic in mathematics for centuries. They are formed by filling in all the cells of a square matrix with the numbers starting from one so that the sum of all rows, columns, and diagonals is the same.…
The classical Waring problem deals with expressing every natural number as a sum of g(k) k-th powers. Similar problems were recently studied in group theory, where we aim to present group elements as short products of values of a given…
The amplituhedron $A_{n,k,m}$ is a geometric object introduced in the context of scattering amplitudes in $N=4$ super Yang Mills. It generalizes the positive Grassmannian (when $n=k+m$), cyclic polytopes (when $k=1$), and the bounded…
Let $K$ be a proper (i.e., closed, pointed, full convex) cone in ${\Bbb R}^n$. An $n\times n$ matrix $A$ is said to be $K$-primitive if there exists a positive integer $k$ such that $A^k(K \setminus \{0 \}) \subseteq$ int $K$; the least…
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…
Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…
We examine the problem of writing every sufficiently large even number as the sum of two primes and at most $K$ powers of 2. We outline an approach that only just falls short of improving the current bounds on $K$. Finally, we improve the…
For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…