English
Related papers

Related papers: A universal sequence of integers generating balanc…

200 papers

We study universal cycles of the set ${\cal P}(n,k)$ of $k$-partitions of the set $[n]:=\{1,2,\ldots,n\}$ and prove that the transition digraph associated with ${\cal P}(n,k)$ is Eulerian. But this does not imply that universal cycles (or…

Combinatorics · Mathematics 2015-02-16 Zach Higgins , Elizabeth Kelley , Bertilla Sieben , Anant Godbole

The enumeration $d_k(n)$ of $k$-elongated plane partition diamonds has emerged as a generalization of the classical integer partition function $p(n)$. Congruences for $d_k(n)$ modulo certain powers of primes have been proven via elementary…

Number Theory · Mathematics 2025-08-19 Dandan Chen , Tianjian Xu , Siyu Yin

We give a computer assisted proof of the full listing of central configuration for $n$-body problem for Newtonian potential on the plane for $n=5,6,7$ with equal masses. We show all these central configurations have a reflective symmetry…

Dynamical Systems · Mathematics 2019-10-02 Małgorzata Moczurad , Piotr Zgliczyński

A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…

Combinatorics · Mathematics 2020-03-02 Stefan Glock , Daniela Kühn , Allan Lo , Deryk Osthus

In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.

Number Theory · Mathematics 2016-06-14 Helmut Maier , Michael Th. Rassias

By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…

Number Theory · Mathematics 2023-09-28 Toufik Zaimi

We answer the question positively. In fact, we believe to have proved that every even integer $2N\geq3\times10^{6}$ is the sum of two odd distinct primes. Numerical calculations extend this result for $2N$ in the range $8-3\times10^{6}$.…

General Mathematics · Mathematics 2017-10-12 Paolo Starni

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

Combinatorics · Mathematics 2007-05-23 S. Corteel , C. D. Savage

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

Number Theory · Mathematics 2013-04-25 Javier Cilleruelo

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Number Theory · Mathematics 2025-04-25 Jean-Paul Allouche , Manon Stipulanti , Jia-Yan Yao

For all positive even integers $n$, graphs of order $n$ with degree sequence \begin{equation*} S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1 \end{equation*} naturally arose in the study of a labeling problem in \cite{IMO}. This fact…

Combinatorics · Mathematics 2023-03-15 Rikio Ichishima , Francesc A. Muntaner-Batle

Set out here are some fundamental theories that may be regarded as newly discovered metamathematics of the odd integers in relation to the Collatz conjecture (also called the 3x+1 problem). Originally motivated by the requirement to invent…

General Mathematics · Mathematics 2015-03-19 Michael A. Idowu

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Combinatorics · Mathematics 2025-11-06 Owen John Levens

In a series of papers and in his 2009 book on configurations Branko Gr\"unbaum described a sequence of operations to produce new $(n_{4})$ configurations from various input configurations. These operations were later called the "Gr\"unbaum…

Combinatorics · Mathematics 2021-04-02 Leah Wrenn Berman , Gábor Gévay , Tomaž Pisanski

Positivstellensatz is a fundamental result in real algebraic geometry providing algebraic certificates for positivity of polynomials on semialgebraic sets. In this article Positivstellens\"atze for trace polynomials positive on…

Rings and Algebras · Mathematics 2019-01-23 Igor Klep , Špela Špenko , Jurij Volčič

Using Pascal triangle, we give a simple generalization to the so-called STRAND Puzzle solved by Srinivasa Ramanujan. Thus we are interested in computing the median, first and third quartiles of some integer valued distributions, arising…

Number Theory · Mathematics 2022-02-08 Daniel Gandolfo , Michel Rouleux

We show that several families of classical orthogonal polynomials on the real line are also orthogonal on the interior of an ellipse in the complex plane, subject to a weighted planar Lebesgue measure. In particular these include Gegenbauer…

Mathematical Physics · Physics 2021-05-13 G. Akemann , T. Nagao , I. Parra , G. Vernizzi

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

Combinatorics · Mathematics 2020-03-11 Chuanqi Xiao , Gyula O. H. Katona

A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their…

Number Theory · Mathematics 2016-01-05 R. R. Gallyamov , I. R. Kadyrov , D. D. Kashelevskiy , N. G. Kutlugallyamov , R. A. Sharipov

Lagrange's four-square theorem states that every natural number $n$ can be represented as the sum of four integer squares: $n=x_1^2+x_2^2+x_3^2+x_4^2$. Ramanujan generalized Lagrange's result by providing, up to equivalence, all $54$…

Number Theory · Mathematics 2018-05-14 Jesús Lacalle , Laura N. Gatti