Related papers: Large Convex sets in Difference sets

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

This article consists in applications of [arXiv:2511.14232] in the case of homemomorphisms of higher genus surfaces whose homological rotation set is big enough -- a class of dynamics that is open. We first prove a structure theorem for the…

Let $X$ be a vertex subset of a graph $G$. Then $u, v\in V(G)$ are $X$-positionable if $V(P)\cap X \subseteq \{u,v\}$ holds for any shortest $u,v$-path $P$. If each two vertices from $X$ are $X$-positionable, then $X$ is a general position…

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

This paper considers the problem of finding maximum volume (axis-aligned) inscribed boxes in a compact convex set, defined by a finite number of convex inequalities, and presents optimization and geometric approaches for solving them.…

Let $\Omega \subset \mathbb{R}^n$ be a convex domain and let $f:\Omega \rightarrow \mathbb{R}$ be a positive, subharmonic function (i.e. $\Delta f \geq 0$). Then $$ \frac{1}{|\Omega|} \int_{\Omega}{f dx} \leq \frac{c_n}{ |\partial \Omega| }…

For a set W of vertices and a vertex v in a graph G, the k-vector r2(v|W) = (aG(v,w1),...,aG(v,wk)) is the adjacency representation of v with respect to W, where W = {w1,...,wk} and aG(x,y) is the minimum of 2 and the distance between the…

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

Let $K$ be a field and let $V$ be a vector space of dimension $n$ over $K$. Let $M$ be a subspace of bilinear forms defined on $V\times V$. Let $r$ be the number of different non-zero ranks that occur among the elements of $M$. Our aim is…

This is a slightly corrected version of an old work. For a cardinal $\mu$ we give a sufficient condition $\oplus_\mu$ (involving ranks measuring existence of independent sets) for: $\otimes_\mu$ if a Borel set $B\subseteq \mathbb{R} \times…

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks. Examples are subset-minimal model-based diagnosis, nonmonotonic reasoning by means of circumscription, or…

The maximal dimension of a commutative subalgebra of the Grassmann algebra is determined. It is shown that for any commutative subalgebra there exists a commutative subalgebra which is spanned by monomials and has the same dimension. It…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…