Related papers: A remark on the slicing problem

We study the problem of approximation of 2D set of points. Such type of problems always occur in physical experiments, econometrics, data analysis and other areas. The often problems of outliers or spikes usually make researchers to apply…

In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…

This paper is a follow-up to the recent paper "A note on isotropic discrepancy and spectral test of lattice point sets" [J. Complexity, 58:101441, 2020]. We show that the isotropic discrepancy of a lattice point set is at most $d \,…

We consider an overdetermined problem for Laplace equation on a disk with partial boundary data where additional pointwise data inside the disk have to be taken into account. After reformulation, this ill-posed problem reduces to a bounded…

In this paper we prove the optimal upper bound $\frac{\lambda_{n}}{\lambda_{m}}\leq\frac{n^{2}}{m^{2}}$ $\Big(\lambda_{n}>\lambda_{m}\geq 11\sup\limits_{x\in[0,1]}q(x)\Big)$ for one-dimensional Schrodinger operators with a nonnegative…

In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…

The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…

We study a shape optimization problem involving a solid $K\subset\mathbb{R}^n$ that is maintained at constant temperature and is enveloped by a layer of insulating material $\Omega$ which obeys a generalized boundary heat transfer law. We…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

In this paper, we define a new, special second order cone as a type-$k$ second order cone. We focus on the case of $k=2$, which can be viewed as SOCO with an additional {\em complicating variable}. For this new problem, we develop the…

In this work, we obtain the following new results. 1. Given a sequence $D=((h_1,s_1), (h_2,s_2) ..., (h_n,s_n))$ of number pairs, where $s_i>0$ for all $i$, and a number $L_h$, we propose an O(n)-time algorithm for finding an index interval…

To investigate the fundamental limit to far-field incoherent imaging, the prequels to this work [M. Tsang, Phys. Rev. A 99, 012305 (2019); 104, 052411 (2021)] have studied a quantum lower bound on the error of estimating an object moment…

Given a convex polygon $P$ with $k$ vertices and a polygonal domain $Q$ consisting of polygonal obstacles with total size $n$ in the plane, we study the optimization problem of finding a largest similar copy of $P$ that can be placed in $Q$…

Let K be a knot in S^3. We study the iterated Bing doubles of K, giving a new proof for the following statement: If BD_n(K) is slice for some n, then K is algebraically slice. This result was first proved by Cha and Kim using covering link…

We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…

We provide bounds on the sizes of the gaps -- defined broadly -- in the set $\{k_1\beta_1 + \ldots + k_n\beta_n \mbox{ (mod 1)} : k_i \in \mathbb Z \cap (0,Q^\frac{1}{n}]\}$ for generic $\beta_1, \ldots, \beta_n \in \mathbb R^m$ and all…

The present paper deals with the problem of computing (or at least estimating) the LW-number $\lambda(n)$, i.e., the supremum of all $\gamma$ such that for each convex body $K$ in $\mathbb{R}^n$ there exists an orthonormal basis…

Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…