相关论文: Sharp bounds for the cubic Parsell-Vinogradov syst…

In this paper we determine the value of the best constants in the 2-uniform PL-convexity estimates of $\mathbb C$. This solves a problem posed by W. J. Davis, D. J. H. Garling and N. Tomczak-Jaegermann.

An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.

Let $V\subset\R^m$ be a centrally symmetric convex body and let $V^*\subset\R^m$ be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials…

Let $V$ be a smooth, projective, rationally connected variety, defined over a number field $k$, and let $Z\subset V$ be a closed subset of codimension at least two. In this paper, for certain choices of $V$, we prove that the set of…

We prove that any smooth cubic surface defined over any number field satisfies the lower bound predicted by Manin's conjecture possibly after an extension of small degree.

Strichartz estimates are derived from $\ell^2$-decoupling for phase functions satisfying a curvature condition. Bilinear refinements without loss in the high frequency are discussed. Estimates are established from uniform curvature…

In this note, we establish an asymptotic formula for the number of rational points of bounded height on the singular cubic surface $$ x_0(x_1^2 + x_2^2)=x_3^3 $$ with a power-saving error term, which verifies the Manin-Peyre conjectures for…

For each $d\geq 0$, we prove decoupling inequalities in $\mathbb R^3$ for the graphs of all bivariate polynomials of degree at most $d$ with bounded coefficients, with the decoupling constant depending uniformly in $d$ but not the…

QCD sum rules for decuplet baryon two-point functions are investigated using a comprehensive Monte-Carlo based procedure. In this procedure, all uncertainties in the QCD input parameters are incorporated simultaneously, resulting in…

Many protocols of quantum information processing use entangled states. Hence, separability criteria are of great importance. We propose new separability conditions for a bipartite finite-dimensional system. They are derived by using…

The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…

The $2n$ dimensional manifold with two mutually commutative operators of differentiation is introduced. Nontrivial multidimensional integrable systems connected with arbitrary graded (semisimple) algebras are constructed. The general…

We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…

Computable and sharp error bounds are derived for asymptotic expansions for linear differential equations having a simple turning point. The expansions involve Airy functions and slowly varying coefficient functions. The sharpness of the…

We prove some new degeneracy results for integral points and entire curves on surfaces; in particular, we provide the first example, to our knowledge, of a simply connected smooth variety whose sets of integral points are never…

We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…

In this short note, we prove a sharp quantization for positive solutions of Lane-Emden problems in a bounded planar domain. This result has been conjectured by De Marchis, Ianni and Pacella [6, Remark 1.2].

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative weakly irreducible tensor. We also apply these bounds to the adjacency spectral radius and signless Laplacian spectral radius of a uniform…

The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…

We consider diagonal cubic surfaces defined by an equation of the form ax^3+by^3+cz^3+dt^3 = 0. Numerically, one can find all rational points of height < B for B in the range of up to 100 000, thanks to a program due to D. J. Bernstein. On…