Related papers: Block designs and prime values of polynomials
We propose a procedure of constructing new block designs starting from a given one by looking at the intersections of its blocks with various sets and grouping those sets according to the structure of the intersections. We introduce a…
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…
Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to…
Broadhurst conjectured that the Feynman integral associated to the polynomial corresponding to $t=1$ in the one-parameter family $(1+x_1+x_2+x_3)(1+x_1^{-1}+x_2^{-1}+x_3^{-1})-t$ is expressible in terms of $L(f,2),$ where $f$ is a cusp form…
In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences,…
Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…
We prove a conjecture about the initial values of ML-degree polynomials stated by Micha{\l}ek, Monin, and Wi\'sniewski.
The problem of constructing polynomials with all coefficients $1$ or $-1$ and large merit factor (equivalently with small $L^4$ norm on the unit circle) arises naturally in complex analysis, condensed matter physics, and digital…
H. Miyachi and W. Turner have independently proved that Broue's Abelian Defect Group Conjecture holds for certain unipotent blocks of the finite general linear group, the so-called Rouquier blocks. This together with A. Marcus and J. Chuang…
In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…
We use Vaughan's variation on Vinogradov's three-primes theorem to prove Zariski-density of prime points in several infinite families of hypersurfaces, including level sets of some quadratic forms, the Permanent polynomial, and the defining…
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…
In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the…
The recently introduced polynomial time integration framework proposes a novel way to construct time integrators for solving systems of first-order ordinary differential equation by using interpolating polynomials in the complex time plane.…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…
We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…
We use the results by Eisenbud and Schreyer to prove that any Betti diagram of a graded module over a standard graded polynomial ring is a positive linear combination Betti diagrams of modules with a pure resolution. This implies the…