Related papers: Optimal stretching for lattice points under convex…
Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…
Through the establishment of several extension theorems, we provide explicit expressions for all contractive projections and 1-complemented subspaces in the Hardy space $H^p(\mathbb{T})$ for $1\leq p<\infty$, $p\neq 2$. Our characterization…
Extending the methods developed in the author's previous paper and using adapted coordinate systems in two variables, an L^p boundedness theorem is proven for maximal operators over hypersurfaces in R^3 when p > 2. When the best possible p…
In the Sobolev space $L_2^{(m)}(0,1)$ optimal quadrature formulas with the nodes (1.5) are investigated. For optimal coefficients explicit form are obtained and norm of the error functional is calculated. In particular, by choosing…
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
We study the Fr\'echet queries problem. It is a data structure problem, where we are given a set $S$ of $n$ polygonal curves and a distance threshold $\rho$. The data structure should support queries with a polygonal curve $q$ for the…
In this paper we study optimal control problems with either fractional or regional fractional $p$-Laplace equation, of order $s$ and $p\in [2,\infty)$, as constraints over a bounded open set with Lipschitz continuous boundary. The control,…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
In this paper we study a perturbative approach to the problem of quantization of measures in the plane. Motivated by the fact that, as the number of points tends to infinity, hexagonal lattices are asymptotically optimal from an energetic…
The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial…
Motivated by the inequality $\|f+g\|_{2}^{2} \leq \|f\|_{2}^{2}+2\|fg\|_{1}+\|g\|^{2}_{2}$, Carbery (2006) raised the question what is the "right" analogue of this estimate in $L^{p}$ for $p \neq 2$. Carlen, Frank, Ivanisvili and Lieb…
We show that the linear or quadratic 0/1 program\[P:\quad\min\{ c^Tx+x^TFx : \:A\,x =b;\:x\in\{0,1\}^n\},\]can be formulated as a MAX-CUT problem whose associated graph is simply related to the matrices $\F$ and $\A^T\A$.Hence the whole…
We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.
We consider a long-range growth dynamics on the two-dimensional integer lattice, initialized by a finite set of occupied points. Subsequently, a site $x$ becomes occupied if the pair consisting of the counts of occupied sites along the…
For points $p_1,\ldots , p_n$ in the unit square $[0,1]^2$, an \emph{anchored rectangle packing} consists of interior-disjoint axis-aligned empty rectangles $r_1,\ldots , r_n\subseteq [0,1]^2$ such that point $p_i$ is a corner of the…
We look for minimizers of the buckling load problem with perimeter constraint in any dimension. In dimension 2, we show that the minimizing plates are convex; in higher dimension, by passing through a weaker formulation of the problem, we…
A convex relaxation of a quadratically constrained quadratic program (QCQP) is called exact if it has a rank-$1$ optimal solution that corresponds to an optimal solution of the QCQP. Given a QCQP whose convex relaxation is exact, this paper…
Recent work has pinned down the existentially optimal size bounds for vertex fault-tolerant spanners: for any positive integer $k$, every $n$-node graph has a $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges resilient to $f$ vertex…
The purpose of this article is twofold. First, we prove that the squeezing function approaches 1 near strongly pseudoconvex boundary points of bounded domains in $\mathbb{C}^{n+1}$. Second, we show that the squeezing function approaches 1…