Related papers: A note on the Polignac numbers

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

In the paper we prove Harbourne-Hirschowitz conjecture for quasi-homogeneous linear systems on $\mathbb P^2$ for $m=7$, 8, 9, 10, i.e. systems of curves of given degree passing through points in general position with multiplicities at least…

Let $\A$ be a line arrangement in the complex projective plane $\PP^2$. Denote by $M$ its complement and by $\M$ the set of points in $\A$ with multiplicity at least 3. A rank one local system $\mathcal{L}$ on $M$ is admissible if roughly…

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

A set of m distinct positive integers {a_{1},...a_{m}} is called a Diophantine m-tuple if a_{i}a_{j}+n is a square for each 1\leqi<j\leqm . The aim of this study is to show that some P_{k} sets can not be extendible to a Diophantine…

A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is 1-admissible if the dimension of the first cohomology group $H^1(M,\LL)$ can be computed from the cohomology algebra $H^*(M,\C)$ in degrees $\leq 2$. Under the…

A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is admissible roughly speaking if the dimension of the cohomology groups $H^m(M,\LL)$ can be computed directly from the cohomology algebra $H^*(M,\C)$. We say that a…

Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…

Consider the sub level set K := {x : g(x) $\le$ 1} where g is a positive and homogeneous polynomial. We show that its Lebesgue volume can be approximated as closely as desired by solving a sequence of generalized eigenvalue problems with…

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

Given a real univariate degree $d$ polynomial $P$, the numbers $pos_k$ and $neg_k$ of positive and negative roots of $P^{(k)}$, $k=0$, $\ldots$, $d-1$, must be admissible, i.e. they must satisfy certain inequalities resulting from Rolle's…

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…

We show that for a large class of cubic polynomials $f$, every sufficiently large number can be written as a sum of seven positive values of $f$. As a special case, we show that every number greater than $e^{10^7}$ is a sum of seven…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

What is the maximum number of holes that a polyomino with $n$ tiles can enclose? Call this number $f(n)$. We show that if $n_k = \left( 2^{2k+1} + 3 \cdot 2^{k+1}+4 \right) / 3$ and $h_k = \left( 2^{2k}-1 \right) /3$, then $f(n_k) = h_k$…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…