Related papers: A lower bound for the minimum deviation of the Che…

We establish an $\varepsilon$-regularity result for the derivative of a map of bounded variation that minimizes a strongly quasiconvex variational integral of linear growth, and, as a consequence, the partial regularity of such BV…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

We prove upper and lower bounds for leading coefficient of Kolchin dimension polynomial of systems of partial linear differential equations in codimension two.

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…

Trigonometric polynomials are usually defined on the lattice of integers.We consider the larger class of weight and root lattices with crystallographic symmetry.This article gives a new approach to minimize trigonometric polynomials, which…

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.

We obtain the sharp lower bound for the uniform norm of the orthogonal polynomials in the Steklov class. We also prove the sharp estimates for the polynomial entropy in this class.

In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), $\sharp$P19], we determined the minimum number of vertices of one-realizations of a given finite set $S$, and constructed the corresponding mixed hypergraphs.…

In this paper, we propose a new approach to justify a round-off error impact on the accuracy of the linear least squares (LS) solution using Cholesky decomposition. This decomposition is widely employed to inverse a matrix in the linear…

We calculate the minimal surface bounded by four-sided figures whose projection on a plane is a rectangle, starting with the bilinear interpolation and using, for smoothness, the Chebyshev polynomial expansion in our discretized numerical…

We answer a question of Erd\"os, Herzog, and Piranian on the minimal area of polynomial lemniscates when all the zeros of the polynomial are constrained to lie on a compact set K whose logarithmic capacity is strictly larger than 1.

A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…

We show that a general lower bound for the global Tjurina number of a reduced complex projective plane curve, given by A. A. du Plessis and C.T.C. Wall, can be improved when the curve is a line arrangement.

In this paper, we study a part of approximation theory that presents the conditions under which a closed set in a normed linear space is proximinal or Chebyshev.

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…

Some results on existence of global Chebyshev coordinates on a Riemannian manifold or, more generally, on Aleksandrov surface are proved. For instance, if the positive and the negative parts of integral curvature of a Riemannian manifold M…

Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…