Related papers: On integer solutions of Parsell-Vinogradov systems
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
We consider the imbedding inequality || f ||_{L^r(R^d)} <= S_{r,n,d} || f ||_{H^{n}(R^d)}; H^{n}(R^d) is the Sobolev space (or Bessel potential space) of L^2 type and (integer or fractional) order n. We write down upper bounds for the…
The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2\pi i (x_1 n+\ldots +x_d…
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…
The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let r_k(n) be the maximum size of a…
Let $p$ be a prime divisor of the order of a finite group $G$. Then $G$ has at least $2 \sqrt{p-1}$ complex irreducible characters of degrees prime to $p$. In case $p$ is a prime with $\sqrt{p-1}$ an integer this bound is sharp for…
In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In…
We prove that a component of the closure of the set of star points on a hypersurface X of degree d>2 in N-dimensional projective space is linear. Afterwards, we focus on the case where the component is of maximal dimension N-2 and the case…
We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ("guards") that are "universal" in their ability to guard any of a set of possible polygonal domains in the plane. We give…
The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…
We study existence and regularity properties of solutions to the singular $p$-Laplacean parabolic system in a bounded domain $\Omega$. The main purpose is to prove global $L^r(\varepsilon,T;L^q(\Omega))$, $\varepsilon\geq0$, integrability…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
Verma modules of superconfomal algebras can have singular vector spaces with dimensions greater than 1. Following a method developed for the Virasoro algebra by Kent, we introduce the concept of adapted orderings on superconformal algebras.…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
For solving constrained (pseudo)-monotone variational inequality, we prove that the upper bound of stepsize $\frac{1}{2L}$ established for the Popov's algorithm and the forward-reflected-backward algorithm is tight. For unconstrained case,…
We prove there exist infinitely many odd integers $n$ for which there exists a pair of positive divisors $d_1, d_2>1$ of $(n^2+1)/2$ such that $$d_1+d_2=\delta n+(\delta+2).$$ We prove the similar result for $\varepsilon=\delta-2$ and…
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…
Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…
We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.