Related papers: Polyhedral geometry for lecture hall partitions
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
This paper addresses the study and applications of polyhedral duality of locally convex topological vector (LCTV) spaces. We first revisit the classical Rockafellar's proper separation theorem for two convex sets one which is polyhedral and…
This report on the topics in the title was written for a lecture series at the Southwestern Center for Arithmetic Algebraic Geometry at the University of Arizona.It may serve as an introduction to certain conjectural relations between…
Extremal black holes are studied in a two dimensional model motivated by a dimensional reduction from four dimensions. Their quantum corrected geometry is calculated semiclassically and a mild singularity is shown to appear at the horizon.…
We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…
These notes contain a survey of some aspects of the theory of graded differential algebras and of noncommutative differential calculi as well as of some applications connected with physics. They also give a description of several new…
We study a class of mechanisms known as Kokotsakis polyhedra with a quadrangular base. These are $3\times3$ quadrilateral meshes whose faces are rigid bodies and joined by hinges at the common edges. In contrast to existing work, the…
This is a survey of our research on geometric structures of projective embeddings and includes some topics of our talks in several symposia during 1990-99. We clarify our main problem, which is to construct a kind of geometric composition…
In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some…
We prove equidistribution of two pairs of statistics on boxed plane partitions: (volume, trace) and (corner-hook volume, number of corners). The proof relies on different 3d visualizations of the corresponding non-intersecting path systems.…
Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…
Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles,…
These lecture notes consist of an introduction to moduli spaces in algebraic geometry, with a strong emphasis placed on examples related to the theory of quiver representations. The goal is to provide the background necessary to understand…
The geometric calculus based on Clifford algebra is a very useful tool for geometry and physics. It describes a geometric structure which is much richer than the ordinary geometry of spacetime. A Clifford manifold ($C$-space) consists not…
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').
These lecture notes for the 2013 CIME/CIRM summer school Combinatorial Algebraic Geometry deal with manifestly infinite-dimensional algebraic varieties with large symmetry groups. So large, in fact, that subvarieties stable under those…
We demonstrate how integer quantization of Hall conductance arises from the large-scale geometry of the sample. Specifically, the Hall conductance is a higher-trace pairing of the Fermi projection with a coarse cohomology class coming from…
The holy grail of deep learning is to come up with an automatic method to design optimal architectures for different applications. In other words, how can we effectively dimension and organize neurons along the network layers based on the…