Related papers: On combinatorial compexity of convex sequences

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

We provide a lower bound for the ratio between the ordinary and uniform exponent of both simultaneous Diophantine approximation and Diophantine approximation by linear forms in any dimension. This lower bound was conjectured by Schmidt and…

Following Schmidt, Thurnheer and Bugeaud-Kristensen, we study how Dirichlet's theorem on linear forms needs to be modified when one requires that the vectors of coefficients of the linear forms make a bounded acute angle with respect to a…

We describe an explicit symplectic resolution for the quotient singularity arising from the four-dimensional symplectic represenation of the binary tetrahedral group.

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

We give several upper bounds for the uniform simultaneous Diophantine exponent $\widehat{\lambda}_n(\xi)$ of a transcendental number $\xi\in\mathbb{R}$. The most important one relates $\widehat{\lambda}_n(\xi)$ and the ordinary simultaneous…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

This paper solves the open problem on the sharp bound for the number of isolated solutions in $\mathbf{R}_*^n$ to the real system of $n$ polynomial equations in $n$ variables, i.e., the real $n$ by $n$ fewnomial system. For an unmixed…

We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…

In this work, we give upper bounds for $n$ on the title equation. Our results depend on assertions describing the precise exponents of $2$ and $3$ appearing in the prime factorization of $T_{k}(x)=(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}$. Further,…

We prove new results, related to the Littlewood and Mixed Littlewood conjectures in Diophantine approximation.

We establish upper bounds on the lengths of minimal conjugators in 2-step nilpotent groups. These bounds exploit the existence of small integral solutions to systems of linear Diophantine equations. We prove that in some cases these bounds…

We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…

In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…

We study a one-dimensional ordinary differential equation modelling optical conveyor belts, showing in particular cases of physical interest that periodic solutions exist. Moreover, under rather general assumptions it is proved that the set…