Related papers: On permutation polytopes
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…
Generalized permutahedra are a family of polytopes with a rich combinatorial structure and strong connections to optimization. We prove that they are the universal family of polyhedra with a certain Hopf algebraic structure. Their antipode…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…
We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…
Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…
A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…
The theory of permutation orbifolds is reviewed and applied to the study of symmetric product orbifolds and the congruence subgroup problem. The issue of discrete torsion, the combinatorics of symmetric products, the Galois action and…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.
We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric. We determine dimensions of these polytopes and classify their…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…
Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…
The maximal chain polytope $\mathscr{M}(P)$ is associated with a finite poset $P$. For a set of maximal chains $\mathcal{C}$, it is shown that the convex hull of all the points corresponding to elements of $\mathcal{C}$ is not a face of…
We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows.…