Related papers: Upper bounds for integer solutions to a system of …

In this paper we prove that there exist infinitely many integers which can be expressed as a sum of four cubes of polynomials with integer coefficients. We give several identities that express the integers 1 and 2 as a sum of four cubes of…

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Let C be an extremal binary doubly even self-dual code of length n and s(C) denote the largest integer t such that the support design of C holds a t-design for some weight. In this paper, we prove s(C) \leq 7.

Recently, Agievich proposed an interesting upper bound on binomial coefficients in the de Moivre-Laplace form. In this article, we show that the latter bound, in the specific case of a central binomial coefficient, is larger than the one…

We find a formula for the number of solutions of linear congruence systems, by using elementary methods.

We consider the size of the nodal set of the solution of the second order parabolic-type equation with Gevrey regular coefficients. We provide an upper bound as a function of time. The dependence agrees with a sharp upper bound when the…

This paper gives a sharp upper bound for the Betti numbers of a finitely generated multigraded $R$-module, where $R=\Bbbk [x_{1},...,x_{m}]$ is the polynomial ring over a field $\Bbbk$ in $m$ variables. The bound is given in terms of the…

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

We describe an algorithm for finding sharp upper bounds for the total Betti numbers of a saturated ideal given certain constraints on its Hilbert function. This algorithm is implemented in the Macaulay2 package, MaxBettiNumbers, along with…

We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…

For $e$ a positive integer, we find restrictions modulo $2^e$ on the coefficients of the characteristic polynomial $\chi_S(x)$ of a Seidel matrix $S$. We show that, for a Seidel matrix of order $n$ even (resp. odd), there are at most…

For numbers $x$ coprime to $10$ there exist infinitely many binary numbers $b$ such that the greatest common divisor of $b$ and rev($b$) = $x$ and the sum of digits of $b = x$ (rev($b$) is the digit reversal of $b$). In most cases, the…

This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…

An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

This paper presents an energy estimate in terms of the total variation of the control for bilinear infinite dimensional quantum systems with unbounded potentials. These estimates allow a rigorous construction of propagators associated with…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…