相关论文: Convex Polytopes: Extremal Constructions and f-Vec…
We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…
In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many…
These are a few historical remarks, addenda and references with comments on some topics discussed by Thurston in his notes ''The geometry and topology of three-manifolds''. The topics are mainly hyperbolic geometry, geometric structures,…
We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We…
Lecture 1. Algebraic properties of correlators in 2D topological field theory. Moduli of a 2D TFT and WDVV equations of associativity. Lecture 2. Equations of associativity and Frobenius manifolds. Deformed flat connection and its monodromy…
A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…
These lecture notes are devoted to the theory of equations of associativity describing geometry of moduli spaces of 2D topological field theories. Introduction. Lecture 1. WDVV equations and Frobenius manifolds. {Appendix A.} Polynomial…
We consider unimodality and related properties of f-vectors of polytopes in various dimensions. By a result of Kalai (1988), f-vectors of 5-polytopes are unimodal. In higher dimensions much less can be said; we give an overview on current…
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…
There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Recently, Connelly and Gortler gave a novel proof of the circle packing theorem for tangency packings by introducing a hybrid combinatorial-geometric operation, flip-and-flow, that allows two tangency packings whose contact graphs differ by…
In his ``Four Lectures", Gromov conjectured a scalar curvature extremality property of convex polytopes. Moreover, Gromov outlined a proof of the conjecture in the special case when the dihedral angles are acute. Gromov's argument relies on…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
The lectures are devoted to a remarkable class of $3$-dimensional polytopes, which are mathematical models of the important object of quantum physics, quantum chemistry and nanotechnology -- fullerenes. The main goal is to show how results…
The Alexandrov-Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, lies at the heart of convex geometry. The characterization of its extremal bodies is a long-standing open…
The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…
We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…
Discrete analogs of extrema of curvature and generalizations of the four-vertex theorem to the case of polygons and polyhedra are suggested and developed. For smooth curves and polygonal lines in the plane, a formula relating the number of…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…