Related papers: Spherical Separation Theorem

We find the (unique) largest subset of $\{0, 1, 2\}^n$ such that it contains no two elements, one of which is coordinatewise greater than the other, but strictly greater on at most $k$ coordinates. To do so, we decompose the cube into…

Let S be an nXn real symmetric matrix with spectral decomposition S=Q^T Lambda Q, where Q is an orthogonal matrix and Lambda is diagonal with simple spectrum {lambda_1,..., lambda_n}. Also let O_S e R_S be the orbits by conjugation of S by,…

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Let $G=*_\lambda G_\lambda$ be a free product of torsion-free groups, and let $g\in[G,G]$ be any element not conjugate into a $G_\lambda$. Then scl$_G(g)\ge1/2$. This generalizes, and gives a new proof of a theorem of Duncan-Howie.

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

Consider a polygon P and all neighboring circles (circles going through three consecutive vertices of P). We say that a neighboring circle is extremal if it is empty (no vertices of P inside) or full (no vertices of P outside). It is well…

Two sets $\mathscr{A}$ and $\mathscr{B}$ are said to be cross-intersecting if $X\cap Y\neq\emptyset$ for all $X\in\mathscr{A}$ and $Y\in\mathscr{B}$. Given two cross-intersecting Sperner families (or antichains) $\mathscr{A}$ and…

We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension $d$. One of our results is that if an intersection graph of $n$ spheres in $\mathbb{R}^d$ has $m$ edges, then it contains a balanced…

Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…

A variety is rationally connected if two general points can be joined by a rational curve. A higher version of this notion is rational simple connectedness, which requires suitable spaces of rational curves through two points to be…

Let f(x) belong to L^p(R^n) and R>0. The transform is considered that integrates the function f over (almost) all spheres of radius R in R^n. This operator is known to be non-injective (as one can see by taking Fourier transform). However,…

A group $G$ is said to be intersection-saturated if for every strictly positive integer $n$ and every map $c\colon \mathcal{P}(\{1,\dots, n\})\setminus \emptyset \rightarrow \{0,1\}$, one can find subgroups $H_1,\dots, H_n\leq G$ such that…

A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…

A non-algorithmic, generalized version of a recent result, asserting that a natural relaxation of the Koml\'os conjecture from boolean discrepancy to spherical discrepancy is true, is proved by a very short argument using convex geometry.

Let $S$ be a Riemann surface with a puncture $x$. Let $a\subset S$ be a simple closed geodesic. In this paper, we show that for any pseudo-Anosov map $f$ of $S$ that is isotopic to the identity on $S\cup \{x\}$, $(a, f^m(a))$ fills $S$ for…

We show that the space $\text{Lip}_0(\mathbb R^n)$ is the dual space of $L^{1}({\mathbb R}^{n}; {\mathbb R}^{n})/N$ where $N$ is the subspace of $L^{1}({\mathbb R}^{n}; {\mathbb R}^{n})$ consisting of vector fields whose divergence…

An infinite $(p,q)$-theorem, or an $(\aleph_0,q)$-theorem, involving two families $\mathcal{F}$ and $\mathcal{G}$ of sets, states that if in every infinite subset of $\mathcal{F}$, there are $q$ sets that are intersected by some set in…

We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…

The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…

Let $P \subset \mathbb{R}^{d}$ be a closed convex cone. Assume that $P$ is pointed, i.e. the intersection $P \cap -P=\{0\}$ and $P$ is spanning, i.e. $P-P=\mathbb{R}^{d}$. Denote the interior of $P$ by $\Omega$. Let $E$ be a product system…