Related papers: Solution of the propeller conjecture in $\mathbb{R…
Let $d, r \in \N$, $\|\cdot\|$ any norm on $\R^d$ and $B$ denote the unit ball with respect to this norm. We show that any sequence $v_1,v_2,...$ of vectors in $B$ can be partitioned into $r$ subsequences $V_1, ..., V_r$ in a balanced…
It is proven that the partition function of 3-dimensional simplicial gravity has an exponential upper bound with the following assumption: any three dimensional sphere $S^3$ is constructed by repeated identification of neighboring links and…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
The input to the Multiway Cut problem is a weighted undirected graph, with nonnegative edge weights, and $k$ designated terminals. The goal is to partition the vertices of the graph into $k$ parts, each containing exactly one of the…
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
Answering a question of Cameron, Pretzel and Siemons proved that every integer partition of $n\ge 2(k+3)(k+1)$ can be reconstructed from its set of $k$-deletions. We describe a new reconstruction algorithm that lowers this bound to $n\ge…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
$ \newcommand{\epsA}{\Mh{\delta}} \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \renewcommand{\P}{P} \newcommand{\diam}{\Delta} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q}…
We study extremal problems for tuples of integers chosen from sets $A_i \subset [X_i,2X_i]$ for $1\le i\le k$, under large GCD and small LCM conditions. For the GCD problem, we extend the work of Green and Walker to higher dimensions.…
This paper studies projections of uniform random elements of (co)adjoint orbits of compact Lie groups. Such projections generalize several widely studied ensembles in random matrix theory, including the randomized Horn's problem, the…
We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…
In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear…
\begin{abstract} This paper deals with an extremal problem for bounded harmonic functions in the unit ball $\mathbb{B}^n.$ We solve the Khavinson conjecture in $\mathbb{R}^3,$ an intriguing open question since 1992 posed by D. Khavinson,…
We prove that every compact K\"ahler threefold has arbitrarily small deformations to some projective manifolds, thereby solving the Kodaira problem in dimension 3.
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
Consider an input consisting of a set of $n$ disjoint triangular obstacles in $\mathbb{R}^3$ and a target point $t$ in the free space, all enclosed by a large sphere $S$ of radius $R$ centered at $t$. An articulated probe is modeled as two…
The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…
We point out some criteria that imply regularity of axisymmetric solutions to Navier-Stokes equations. We show that boundedness of $\|{v_{r}}/{\sqrt{r^3}}\|_{L_2({\rm R}^3\times (0,T))}$ as well as boundedness of…
In this paper, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into $\ell_1$ with constant distortion. We show that for an arbitrarily small constant $\delta> 0$, for all large enough $n$,…
Let X be a smooth projective curve of genus >1 over a field K which is finitely generated over the rationals. The section conjecture in Grothendieck's anabelian geometry says that the sections of the canonical projection from the arithmetic…