AbstractIn this paper, we explore the combinatorial automorphism group of the linear ordering polytope PLOn for each n>1. We establish that this group is isomorphic to Z2×Sym(n+1) if n>2 (and to Z2 if n=2). In doing so, we provide a simple and unified interpretation of all the automorphisms
AbstractEach group G of permutation matrices gives rise to a permutation polytope P(G) = conv(G) ⊂ R...
AbstractCertain abstract polytopes are constructed from generalized combinatorial cubes by taking qu...
In polyhedral combinatorics, some well-known polytopes are related to lattice congruences of the wea...
AbstractIn this paper, we explore the combinatorial automorphism group of the linear ordering polyto...
AbstractWe present new facets for the linear ordering polytope. These new facets generalize facets i...
AbstractTo each finite set with at least two elements, there corresponds a partial order polytope. I...
AbstractLet Λ be a tiled R-order. We give a description of AutR(Λ) as the semidirect product of Inn(...
In this paper we dicuss a facial structure of the linear ordering polytope. The facet-defining digra...
AbstractIn this paper it is shown that the lattice Ln of partitions of n under the dominance orderin...
Facets of the linear ordering polytope / Martin Grötschel ; Michael Jünger ; Gerhard Reinelt. - In: ...
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering p...
AbstractIf a linear graph is imbedded in a surface to form a map, then the map has a group of automo...
AbstractIn recent years the term ‘chiral’ has been used for geometric and combinatorial figures whic...
Let P be a finite poset. By definition, the linear extension polytope of P has as vertices the chara...
AbstractWe give upper bounds on the order of the automorphism group of a simple graph
AbstractEach group G of permutation matrices gives rise to a permutation polytope P(G) = conv(G) ⊂ R...
AbstractCertain abstract polytopes are constructed from generalized combinatorial cubes by taking qu...
In polyhedral combinatorics, some well-known polytopes are related to lattice congruences of the wea...
AbstractIn this paper, we explore the combinatorial automorphism group of the linear ordering polyto...
AbstractWe present new facets for the linear ordering polytope. These new facets generalize facets i...
AbstractTo each finite set with at least two elements, there corresponds a partial order polytope. I...
AbstractLet Λ be a tiled R-order. We give a description of AutR(Λ) as the semidirect product of Inn(...
In this paper we dicuss a facial structure of the linear ordering polytope. The facet-defining digra...
AbstractIn this paper it is shown that the lattice Ln of partitions of n under the dominance orderin...
Facets of the linear ordering polytope / Martin Grötschel ; Michael Jünger ; Gerhard Reinelt. - In: ...
In this paper we describe and implement an algorithm for the exact solution of the Linear Ordering p...
AbstractIf a linear graph is imbedded in a surface to form a map, then the map has a group of automo...
AbstractIn recent years the term ‘chiral’ has been used for geometric and combinatorial figures whic...
Let P be a finite poset. By definition, the linear extension polytope of P has as vertices the chara...
AbstractWe give upper bounds on the order of the automorphism group of a simple graph
AbstractEach group G of permutation matrices gives rise to a permutation polytope P(G) = conv(G) ⊂ R...
AbstractCertain abstract polytopes are constructed from generalized combinatorial cubes by taking qu...
In polyhedral combinatorics, some well-known polytopes are related to lattice congruences of the wea...
DOI
Add to ORKG