Related papers: Inverse Additive Problems for Minkowski Sumsets I

We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…

The notion of cross intersecting set pair system of size $m$, $\Big(\{A_i\}_{i=1}^m, \{B_i\}_{i=1}^m\Big)$ with $A_i\cap B_i=\emptyset$ and $A_i\cap B_j\ne\emptyset$, was introduced by Bollob\'as and it became an important tool of extremal…

The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is…

A two-intersection set with parameters $(j;\alpha,\beta)$ for a block design is a $j$-subset of the point set of the design, which intersects every block in $\alpha$ or $\beta$ points. In this paper, we show the existence of a…

In this paper our aim is to characterize the set of extreme points of the set of all n-dimensional copulas (n > 1). We have shown that a copula must induce a singular measure with respect to Lebesgue measure in order to be an extreme point…

For a projective variety $X$ defined over a non-Archimedean complete non-trivially valued field $k$, and a semipositive metrized line bundle $(L, \phi)$ over it, we establish a metric extension result for sections of $L^{\otimes n}$ from a…

We study classes of Borel subsets of the real line $\mathbb{R}$ such as levels of the Borel hierarchy and the class of sets that are reducible to the set $\mathbb{Q}$ of rationals, endowed with the Wadge quasi-order of reducibility with…

We study identifiability for bilinear inverse problems under sparsity and subspace constraints. We show that, up to a global scaling ambiguity, almost all such maps are injective on the set of pairs of sparse vectors if the number of…

This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium…

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…

Let $0\le \alpha \le \beta\le 1$. For any finite set $B\subset\mathbb{N}$, we show that there exists a set $A\subset\mathbb{N}$ such that $\underline{d}(A+B) = \alpha$ and $\bar{d}(A+B) = \beta$, where $\underline{d}(A+ B)$ and…

For each positive integer $m$ and each real finite dimensional Banach space $X$, we set $\beta(X,m)$ to be the infimum of $\delta\in (0,1]$ such that each set $A\subset X$ having diameter $1$ can be represented as the union of $m$ subsets…

We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…

This article investigates the exceptional set of the boundary for the following problem: \begin{equation*} \begin{aligned} -\frac{\partial u}{\partial t} + \mathcal{M}_{\lambda,\Lambda}^+(D^2u) + b(x,t)\cdot Du + c(x,t)u =0 \quad \rm{in} ~…

An $n \times m$ non-negative matrix with row sum $m$ and column sum $n$ is called doubly stochastic. We answer the problem of finding doubly stochastic matrices of smallest posible support for every $1 <n \leq m$. Any matrix of minimum…

The Schur product of two complex m x n matrices is their entry wise product. We show that an extremal element X in the convex set of m x n complex matrices of Schur multiplier norm at most 1 satisfies the inequality rank(X) =< (m +n)^(1/2)…

Approximation problems involving a single convex body in $d$-dimensional space have received a great deal of attention in the computational geometry community. In contrast, works involving multiple convex bodies are generally limited to…

In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite index set of the inequality constraints, we are primarily interested in the…

In this paper we revisit the anisotropic isoperimetric and the Brunn-Minkowski inequalities for convex sets. The best known constant $C(n)=Cn^{7}$ depending on the space dimension $n$ in both inequalities is due to Segal [\ref{bib:Seg.}].…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…