Searcharxiv⌕ Search

arXiv subjects

A. Prymak

Publications and source records attributed to A. Prymak.

At least 19 recordsLinked to original sources
arXiv2022

Every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies

We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's approach and develop a discretization technique that reduces the problem to verification of feasibility of a number of linear programs with rational coefficients, which is done with computer assistance using exact arithmetic.

math.MG↗
arXiv2022

On the cardinality of lower sets and universal discretization

A set $Q$ in $\mathbb{Z}_+^d$ is a lower set if $(k_1,\dots,k_d)\in Q$ implies $(l_1,\dots,l_d)\in Q$ whenever $0\le l_i\le k_i$ for all $i$. We derive new and refine known results regarding the cardinality of the lower sets of size $n$ in $\mathbb{Z}_+^d$. Next we apply these results for universal discretization of the $L_2$-norm of elements from $n$-dimensional subspaces of trigonometric polynomials generated by lower sets.

math.NA↗
arXiv2021

Geometric computation of Christoffel functions on planar convex domains

For arbitrary planar convex domain, we compute the behavior of Christoffel function up to a constant factor using comparison with other simple reference domains. The lower bound is obtained by constructing an appropriate ellipse contained in the domain, while for the upper bound an appropriate parallelepiped containing the domain is constructed. As an application we obtain a new proof of existence of optimal polynomial meshes in planar convex domains.

math.CA↗
arXiv2020

Spherical coverings and X-raying convex bodies of constant width

K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in $\mathbb{E}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos\sqrt{\frac{n-1}{2n}}$ implies the $X$-ray conjecture and the illumination conjecture for convex bodies of constant width in $\mathbb{E}^n$, and constructed such coverings for $4\le n\le 6$. Here we give such constructions with fewer than $2^n$ caps for $5\le n\le 15$. For the illumination number of any convex body of constant width in $\mathbb{E}^n$, O.~Schramm proved an upper estimate with exponential growth of order $(3/2)^{n/2}$. In particular, that estimate is less than $3\cdot 2^{n-2}$ for $n\ge 16$, confirming the above mentioned conjectures for the class of convex bodies of constant width. Thus, our result settles the outstanding cases $7\le n\le 15$. We also show how to calculate the covering radius of a given discrete point set on the sphere efficiently on a computer.

math.MG↗
arXiv2020

On the Hadwiger covering problem in low dimensions

Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources. The best known upper bound in three-dimensional case is $H_3\le 16$ and is due to Papadoperakis. We use Papadoperakis' approach to show that $H_4\le 96$, $H_5\le 1091$ and $H_6\le 15373$ which significantly improve the previously known upper bounds on $H_n$ in these dimensions.

math.MG↗
arXiv2020

Entropy numbers and Marcinkiewicz-type discretization theorem

This paper studies the behavior of the entropy numbers of classes of functions with bounded integral norms from a given finite dimensional linear subspace. Upper bounds of these entropy numbers in the uniform norm are obtained and applied to establish a Marcinkiewicz type discretization theorem for integral norms of functions from a given finite dimensional subspace.

math.CA↗
arXiv2020

Sampling discretization of integral norms

The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. Even though this problem is extremely important in applications, its systematic study has begun recently. In this paper we obtain a conditional theorem for all integral norms $L_q$, $1\le q<\infty$, which is an extension of known results for $q=1$. To discretize the integral norms successfully, we introduce a new technique, which is a combination of probabilistic technique with results on the entropy numbers in the uniform norm. As an application of the general conditional theorem, we derive a new Marcinkiewicz type discretization for the multivariate trigonometric polynomials with frequencies from the hyperbolic crosses.

math.CA↗
arXiv2019

Christoffel function on planar domains with piecewise smooth boundary

We compute up to a constant factor the Christoffel function on planar domains with boundary consisting of finitely many $C^2$ curves such that each corner point of the boundary has interior angle strictly between $0$ and $π$. The resulting formula uses the distances from the point of interest to the curves or certain parts of the curves defining the boundary of the domain.

math.CA↗
arXiv2018

Integral norm discretization and related problems

The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite dimensional spaces. Also, discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of the multivariate trigonometric polynomials with frequencies from a finite set with fixed cardinality. Both new results and a survey of known results are presented.

math.NA↗
arXiv2017

Pointwise behavior of Christoffel function on planar convex domains

We prove a general lower bound on Christoffel function on planar convex domains in terms of a modification of the parallel section function of the domain. For a certain class of planar convex domains, in combination with a recent general upper bound, this allows to compute the pointwise behavior of Christoffel function. We illustrate this approach for the domains $\{(x,y):|x|^α+|y|^α\le1\}$, $1<α<2$, and compute up to a constant factor the required modification of the parallel section function, and, consequently, Christoffel function at an arbitrary interior point of the domain.

math.CA↗
arXiv2017

Upper estimates of Christoffel function on convex domains

New upper bounds on the pointwise behaviour of Christoffel function on convex domains in ${\mathbb{R}}^d$ are obtained. These estimates are established by explicitly constructing the corresponding "needle"-like algebraic polynomials having small integral norm on the domain, and are stated in terms of few easy-to-measure geometric characteristics of the location of the point of interest in the domain. Sharpness of the results is shown and examples of applications are given.

math.CA↗
arXiv2017

Non-existence of (76,30,8,14) strongly regular graph

We prove the non-existence of strongly regular graph with parameters $(76,30,8,14)$. We use Euclidean representation of a strongly regular graph together with a new lower bound on the number of 4-cliques to derive strong structural properties of the graph, and then use these properties to show that the graph cannot exist.

math.CO↗
arXiv2016

Yet another look at positive linear operators, $q$-monotonicity and applications

For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c \omega_2^{\varphi^\lambda} \left(f, n^{-1} \varphi^{1-\lambda/2}(x) \left(\varphi(x) + 1/n \right)^{-\lambda/2} \right) , \] for $x\in [0,1]$ and $\lambda\in [0, 2)$, where $\varphi(x) := \sqrt{x(1-x)}$ and $\omega_2^{\psi}$ is the second Ditzian-Totik modulus of smoothness corresponding to the "step-weight function" $\psi$. In particular, this implies that the rate of best uniform $q$-monotone polynomial approximation can be estimated in terms of $\omega_2^{\varphi} \left(f, 1/n \right)$.

math.CA↗
arXiv2016

On Nikol'skii inequalities for domains in $R^d$

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree $n$ on a bounded convex domain $D$. That is, we study $σ:= σ(D,d)$ for which \[ \|P\|_{L_q(D)}\le c n^{σ(\frac1p-\frac1q)}\|P\|_{L_p(D)},\quad 0<p\le q\le\infty, \] where $P$ is a polynomial of total degree $n$. We use geometric properties of the boundary of $D$ to determine $σ(D,n)$ with the aid of comparison between domains. Computing the asymptotics of the Christoffel function of various domains is crucial in our investigation. The methods will be illustrated by the numerous examples in which the optimal $σ(D,n)$ will be computed explicitly.

math.CA↗
arXiv2014

On concentrators and related approximation constants

Pippenger ([Pippenger, 1977]) showed the existence of $(6m,4m,3m,6)$-concentrator for each positive integer $m$ using a probabilistic method. We generalize his approach and prove existence of $(6m,4m,3m,5.05)$-concentrator (which is no longer regular, but has fewer edges). We apply this result to improve the constant of approximation of almost additive set functions by additive set functions from $44.5$ (established in [Kalton, Roberts, 1983]) to $39$. We show a more direct connection of the latter problem to the Whitney type estimate for approximation of continuous functions on a cube in $\mathbb{R}^d$ by linear functions, and improve the estimate of this Whitney constant from $802$ (proved in [Brudnyi, Kalton, 2000]) to $73$.

math.CA↗
arXiv2014

Discrete $d$-dimensional moduli of smoothness

We show that on the $d$-dimensional cube $I^d\equiv [0,1]^d$ the discrete moduli of smoothness which use only the values of the function on a diadic mesh are sufficient to determine the moduli of smoothness of that function. As an important special case our result implies for $f\in C(I^d)$ and given integer $r$ that when $0<\alpha 0$ and $|u|=1$ such that $x,x+rhu\in I^d$.

math.NA↗
arXiv2014

Constrained Spline Smoothing

Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf, $q\geq 3$, with one additional degree of smoothness) to be of minimal defect while keeping it close to the original function in the ${\mathbb L}_p$-(quasi)norm. It is well known that approximating a function by ppf's of minimal defect (splines) avoids introduction of artifacts which may be unrelated to the original function, thus it is always preferable. On the other hand, it is usually easier to construct constrained ppf's with as little requirements on smoothness as possible. Our results allow to obtain shape-preserving splines of minimal defect with equidistant or Chebyshev knots. The validity of the corresponding Jackson-type estimates for shape-preserving spline approximation is summarized, in particular we show, that the ${\mathbb L}_p$-estimates, $p\ge1$, can be immediately derived from the ${\mathbb L}_\infty$-estimates.

math.NA↗