Related papers: A Geometric Lower Bound Theorem

In 3-dimensional hyperbolic geometry, the classical Schlafli formula expresses the variation of the volume of a hyperbolic polyhedron in terms of the length of its edges and of the variation of its dihedral angles. We prove a similar…

We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

Understanding the asymptotic behavior of the number of Galois orbits of newforms in $S_k(\Gamma_0(N), \Psi)$ as the weight increases is a central problem motivated by Maeda's conjecture. For trivial nebentypus, prior work of Dieulefait,…

In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

We provide a reformulation of the hyperplane conjecture (the slicing problem) in terms of the floating body and give upper and lower bounds on the logarithmic Hausdorff distance between an arbitrary convex body $K\subset \mathbb{R}^{d}$\…

In 1978, Makai Jr. established a remarkable connection between the volume-product of a convex body, its maximal lattice packing density and the minimal density of a lattice arrangement of its polar body intersecting every affine hyperplane.…

We apply theta body relaxations to the $K_i$-cover problem and show polynomial time solvability for certain classes of graphs. In particular, we give an effective relaxation where all $K_i$-$p$-hole facets are valid, and study its relation…

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

In 1992, Kalai and Kleitman proved the first subexponential upper bound for the diameters of convex polyhedra. Eisenbrand et al. proved this bound holds for connected layer families, a novel approach to analyzing polytope diameters. Very…

It is proved that if $u_1,\ldots, u_n$ are vectors in ${\Bbb R}^k, k\le n, 1 \le p < \infty$ and $$r = ({1\over k} \sum ^n_1 |u_i|^p)^{1\over p}$$ then the volume of the symmetric convex body whose boundary functionals are $\pm u_1,\ldots,…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…