English
Related papers

Related papers: A proof of the Corrected Beiter conjecture

200 papers

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

Number Theory · Mathematics 2025-01-09 Zhiguo Ding , Michael E. Zieve

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

Number Theory · Mathematics 2015-07-23 Tristan Freiberg , Carl Pomerance

Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through…

Number Theory · Mathematics 2014-02-26 Ben Green , Olof Sisask

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

General Mathematics · Mathematics 2016-06-20 N. A. Carella

By means of the $q$-Zeilberger algorithm, we prove a basic hypergeometric supercongruence modulo the fifth power of the cyclotomic polynomial $\Phi_n(q)$. This result appears to be quite unique, as in the existing literature so far no basic…

Number Theory · Mathematics 2020-08-04 Victor J. W. Guo , Michael J. Schlosser

In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal ones. We disproved Dimitrov's conjecture…

Complex Variables · Mathematics 2018-08-28 Dmitriy Dmitrishin , Ivan Skrinnik , Andrey Smorodin , Alex Stokolos

It is proven that for any representation over a field of characteristic 0 of the non-abelian semidirect product of a cyclic group of prime order p and the group of order 3 the corresponding algebra of polynomial invariants is generated by…

Representation Theory · Mathematics 2012-05-29 K. Cziszter

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple…

Combinatorics · Mathematics 2011-02-10 Bruce E. Sagan

In 1888, Hilbert proved that every non-negative quartic form f=f(x,y,z) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up…

Algebraic Geometry · Mathematics 2010-09-17 Albrecht Pfister , Claus Scheiderer

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

Combinatorics · Mathematics 2007-05-23 Christian Haase , Günter M. Ziegler

Let Q(N;q,a) denotes the number of squares in the arithmetic progression qn+a, for n=0, 1,...,N-1, and let Q(N) be the maximum of Q(N;q,a) over all non-trivial arithmetic progressions qn + a. Rudin's conjecture asserts that Q(N)=O(Sqrt(N)),…

Number Theory · Mathematics 2014-11-12 Enrique González-Jiménez , Xavier Xarles

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…

Number Theory · Mathematics 2018-09-25 Guo-Shuai Mao , Zhi-Wei Sun

In 1927, Artin conjectured that any integer other than -1 or a perfect square generates the multiplicative group $\mathbb{Z}/p\mathbb{Z}^\times$ for infinitely many $p$. In \cite{MoSt}, Moree and Stevenhagen considered a two-variable…

Number Theory · Mathematics 2017-11-20 M. Ram Murty , François Séguin , Cameron L. Stewart

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski

Let xi be a real number which is neither rational nor quadratic over Q. Based on work of Davenport and Schmidt, Bugeaud and Laurent have shown that, for any real number theta, there exist a constant c>0 and infinitely many non-zero…

Number Theory · Mathematics 2014-02-26 Damien Roy , Dmitrij Zelo

We study a family of inverse ternary cyclotomic polynomials $\Psi_{pqr}$ in which $r\le\varphi(pq)$ is a positive linear combination of $p$ and $q$. We derive a formula for the height of such polynomial and characterize all flat polynomials…

Number Theory · Mathematics 2014-07-15 Bartlomiej Bzdega

In 1967, Gr\"unbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. We prove this conjecture and also…

Combinatorics · Mathematics 2020-04-21 Lei Xue

The homogeneous form $\Phi_n(X,Y)$ of degree $\varphi(n)$ which is associated with the cyclotomic polynomial $\phi_n(X)$ is dubbed a {\it cyclotomic binary form}. A positive integer $m\ge 1$ is said to be {\it representable by a cyclotomic…

Number Theory · Mathematics 2017-12-27 Etienne Fouvry , Claude Levesque , Michel Waldschmidt