English
Related papers

Related papers: A convex set with a rich difference

200 papers

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

Logic · Mathematics 2026-04-09 Hrafn Valtýr Oddsson

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound…

Combinatorics · Mathematics 2013-05-06 Christine Bachoc , Imre Z. Ruzsa , Mate Matolcsi

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

Combinatorics · Mathematics 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz

Let F be a finite set of circles in the plane. We point out that the usual convex closure restricted to F yields a convex geometry, that is, a combinatorial structure introduced by P. H Edelman in 1980 under the name "anti-exchange closure…

Rings and Algebras · Mathematics 2013-05-22 Gábor Czédli

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…

Dynamical Systems · Mathematics 2026-01-13 Pierre-Antoine Guihéneuf

How large can a family \cal A \subset \cal P [n] be if it does not contain A,B with |A\setminus B| = 1? Our aim in this paper is to show that any such family has size at most \frac{2+o(1)}{n} \binom {n}{\lfloor n/2\rfloor }. This is tight…

Combinatorics · Mathematics 2013-11-25 Imre Leader , Eoin Long

Let $A$ and $B$ be sets of $k\ge5$ elements in $F=\mathbb{Z}/p\mathbb{Z}$ the field with $p>2k-2$ elements. We denote by $A\dot{+}B$ the set of different elements of $F$ that can be written in the form $a+b$, where $a\in A$, $b\in B$,…

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

Combinatorics · Mathematics 2026-03-10 Stijn Cambie , Arne Decadt , Yanni Dong , Tao Hu , Quanyu Tang

Let $c$ be the family of irreducible representations of a Weyl group $W$ corresponding to a two-sided cell of $W$. We define a subset $A_c$ of $c$ which contains the special representation of $W$ in $c$ and is in canonical bijection with…

Representation Theory · Mathematics 2024-05-08 G. Lusztig

In this paper, we study the pure $\kappa-$sparse gapsets and our focus on getting information about the sequence observed in Table 3 at [1], this sequence is listed in OEIS as A374773. We verify that the cardinality of the set of gapsets…

Combinatorics · Mathematics 2024-08-01 Gilberto Brito , Stéfani Vieira

A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.…

Combinatorics · Mathematics 2023-06-22 Christoph Brause , Michael A. Henning , Marcin Krzywkowski

Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…

Logic · Mathematics 2022-08-02 Jonathan Schilhan

We show that for any Minkowski centered planar convex compact set $C$ the Harmonic mean of $C$ and $-C$ can be optimally contained in the arithmetic mean of the same sets if and only if the Minkowski asymmetry of $C$ is at most the golden…

Metric Geometry · Mathematics 2022-01-12 René Brandenberg , Katherina von Dichter , Bernardo González Merino

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

Computational Geometry · Computer Science 2010-09-16 Amol Aggarwal

We show that, if a building is endowed with its complete system of apartments, and if each panel is contained in at least four chambers, then the intersection of two apartments can be any convex subcomplex contained in an apartment. This…

Combinatorics · Mathematics 2008-05-30 Peter Abramenko , Hendrik Van Maldeghem

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…

Metric Geometry · Mathematics 2012-09-06 Zsolt Lángi , Márton Naszódi , István Talata

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

This paper shows that---under suitable conditions on a cone $C$---any element in the convex hull of a decomposably $C$-antichain-convex set $Y$ is $C$-Pareto dominated by some element of $Y$. Building on this, the paper proves the…

Optimization and Control · Mathematics 2019-09-04 Maria Carmela Ceparano , Federico Quartieri