Related papers: The cap set problem: Up to dimension 7
Let S be a surface in CP^3, having only nodes as singularities. Let pi: S~ --> S be a minimal resolution of singularities. A set N of nodes on S is EVEN if there exists a divisor Q on S~ such that 2Q ~ pi^{-1}(N). Suppose that S has degree…
This paper investigates instances of Sobolev embeddings characterized by local compactness at every point within their domain, except for a single point. We obtain the sharp conditions that distinguish compactness from non-compactness and…
The focus of the paper is on the maximal dimension of affine subspaces of nilpotent $n \times n $ matrices with fixed rank. In particular we obtain two results in the "border" cases rank equal to $n-1$ and rank equal to $1$.
A set $A\subset \mathbb{F}_p^n$ is sum-free if $A+A$ does not intersect $A$. If $p\equiv 2 \mod 3$, the maximal size of a sum-free in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. We show that if a sum-free set $A\subset…
We consider N-point deformation of algebraic K3 surfaces. First, we construct two-point deformation of algebraic K3 surfaces by considering algebraic deformation of a pair of commutative algebraic K3 surfaces. In this case, the moduli space…
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ points of $S$ span a hyperplane and not all the points of $S$ are contained in a hyperplane. The aim of this article is to introduce the…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.
A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algorithms may…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We prove that for certain endomorphisms of a nilmanifold N the set S of those points such that the closure of its (forward) orbit contains no periodic points is large in the sense that for any non-empty open set U, the set U\cap S is of…
We construct a new $N=4$ non-semisimple gauged supergravity in three dimensions with $E_{6(2)}/SU(6)\times SU(2)$ scalar manifold and $SO(4)\ltimes \mathbf{T}^6$ gauge group. Depending on the values of the gauge coupling constants, the…
We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…
A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced…
We construct a consistent reduction ansatz of eleven-dimensional supergravity to $N=2$ $SO(4)$ seven-dimensional gauged supergravity with topological mass term for the three-form field. The ansatz is obtained from a truncation of the $S^4$…
Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…
In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…
Given a set of points \F in a high dimensional space, the problem of finding a union of subspaces \cup_i V_i\subset \R^N that best explains the data \F increases dramatically with the dimension of \R^N. In this article, we study a class of…
The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\Delta$ and the diameter $D$, was introduced in \cite{maxddbs}, as a generalization of the Degree-Diameter…