相关论文: Hochschild polytopes

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

Herein we prove that if $M$ is a compact oriented Riemann surface of genus $g$, and $M^{[n]}$ is the classifying space of $n$ distinct, unordered points on $M$, then the kernel of the map $\pi_1(M^{[n]})\to H_1(M)$ is generated by…

Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Vertices of the 4-dimensional semi-regular polytope, the \textit{grand antiprism} and its symmetry group of order 400 are represented in terms of quaternions with unit norm. It follows from the icosian representation of the \textbf{$E_{8}…

The Baumslag-Solitar groups: BS(m,n)=<x,y| x y^{m} x^{-1} = y^{n}> are some of the simplest interesting infinite groups which are not lattices in Lie groups. They have been studied in depth from the point of view of combinatorial group…

We study the relationship between the vertices of an up-monotone polyhedron $R$ and those of the polytope $P$ obtained by truncating $R$ with the unit hypercube. When $R$ has binary vertices, we characterize the vertices of $P$ in terms of…

This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…

Toric topology assigns to each simple convex $n$-polytope $P$ with $m$ facets an $n$-dimensional real moment angle manifold $\mathbb RZ_P$ with a canonical action of $\mathbb Z_2^m=(\mathbb Z/2\mathbb Z)^m$. We consider (non-necessarily…

We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…

In the article, a series of neigbourly polyhedra is constructed. They have $N=2d+4$ vertices and are embedded in $\mathbb R^{2d}$. Their (affine) Gale diagrams in $\mathbb R^2$ have $d+3$ black points that form a convex polygon. These Gale…

In an earlier paper, the first two authors defined orientations on hypergraphs. Using this definition we provide an explicit bijection between acyclic orientations in hypergraphs and faces of hypergraphic polytopes. This allows us to obtain…

An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg and C. Lange constructed various realizations of the…

4-dimensional H4 polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group W(H4) where the group elements and the vertices of the polytopes are represented by quaternions. Projection of an arbitrary…

A lattice path matroid is a transversal matroid corresponding to a pair of lattice paths on the plane. A matroid base polytope is the polytope whose vertices are the incidence vectors of the bases of the given matroid. In this paper, we…

Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I investigate the poset of noncrossing hypertrees…

A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…

We investigate the permutation modules associated to the set of $k$-dimensional faces of the hyperoctahedron in dimension $n$, denoted $H^{n}.$ For any $k\leq n$ such a module can be defined over an arbitrary field $F$, it is called a face…

Let ${\rm N}_m(R) = \{ (a_{ij}) \in {\rm M}_m(R) \mid a_{11} = a_{22} = \cdots = a_{mm} \mbox{ and } a_{ij} = 0 \mbox{ for any } i > j \}$ for a commutative ring $R$. Then ${\rm N}_m(R)$ is a quadratic monomial algebra over $R$. We…

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…