Related papers: A note concerning frames and geometric inequalitie…
A new way of constructing fusion bases (i.e., the set of inequalities governing fusion rules) out of fusion elementary couplings is presented. It relies on a polytope reinterpretation of the problem: the elementary couplings are associated…
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…
The generic singularities and bifurcations are classified for one-parameter families of curves with frames in a space form, the Euclidean space, the elliptic space or the hyperbolic space via projective geometry. Two kinds of frames are…
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n…
Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…
A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…
In this paper, we enumerate parallelogram polycubes according to several parameters. After establishing a relation between Multiple Zeta Function and the Dirichlet generating function of parallelogram polyominoes, we generalize it to the…
In this paper we discuss various connections between geometric discrepancy measures, such as discrepancy with respect to convex sets (and convex sets with smooth boundary in particular), and applications to numerical analysis and…
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
Homotopy is an important feature of associative and Jordan algebraic structures: such structures always come in families whose members need not be isomorphic among other, but still share many important properties. One may regard homotopy as…
We offer a new proof of uniform convexity inequalities for the Finsler manifold of nonpositive curvature taken on the space of positive-semidefinite matrices with the weighted matrix geometric mean defining the geodesic between two points.…
A treatment in a neighborhood and at a point of the equivalence principle on the basis of derivations of the tensor algebra over a manifold is given. Necessary and sufficient conditions are given for the existence of local bases, called…
This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…
Some inequalities for positive linear maps on matrix algebras are given, especially asymmetric extensions of Kadison's inequality and several operator versions of Chebyshev's inequality. We also discuss well-known results around the matrix…
We will present a relation between real equiangular frames and certain special sets in groups which we call signature sets and show that many equiangular frames arise in this manner. Then we will define quasi-signature sets and will examine…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…