Related papers: Admissable sets do not exist for all parameters
Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…
Fix $\alpha \in (0,1/3)$. We show that, from a topological point of view, almost all sets $A\subseteq \mathbb{N}$ have the property that, if $A^\prime=A$ for all but $o(n^{\alpha})$ elements, then $A^\prime$ is not a nontrivial sumset…
We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…
Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…
We address the problem of producing a lower bound for the mean of a discrete probability distribution, with known support over a finite set of real numbers, from an iid sample of that distribution. Up to a constant, this is equivalent to…
We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…
In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
A family I of subsets of a set X is an ideal on X if it is closed under taking subsets and finite unions of its elements. An ideal I on X is below an ideal J on Y in the Katetov order if there is a function $f:Y\to X$ such that…
A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…
Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…
Admissible vectors lead to frames or coherent states under the action of a group by means of square integrable representations. This work shows that admissible vectors can be seen as weights with central support on the (left) group von…
We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…
Let $C, W \subseteq \mathbb{Z}$. If $C + W = \mathbb{Z}$, then the set $C$ is called an additive complement to $W$ in $\mathbb{Z}$. If no proper subset of $C$ is an additive complement to $W$, then $C$ is called a minimal additive…
A graph on $n$ vertices is said to be \emph{$C$-Ramsey} if every clique or independent set of the graph has size at most $C \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed…
A frame in an $n$-dimensional Hilbert space $H_n$ is a possibly redundant collection of vectors $\{f_i\}_{i\in I}$ that span the space. A tight frame is a generalization of an orthonormal basis. A frame $\{f_i\}_{i\in I}$ is said to be…
For integers $n \geq k \geq 1$, the {\em Kneser graph} $K(n, k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\ldots,n\}$, where two $k$-element sets are adjacent in $K(n,k)$ if they are disjoint. We show…
An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set. In…
A finite Euclidean set is diameter-Ramsey if, for every number of colors, some finite same-diameter witness has the property that every coloring of the witness contains a monochromatic congruent copy of the set. Frankl, Pach, Reiher and…