The Polytope of m-Subspaces  of a Finite Affine Space

Julie Christophe; Jean-Paul Doignon

The search session has expired. Please query the service again.

Displaying similar documents to “The Polytope of m-Subspaces of a Finite Affine Space”

Sections of simplices.

Prabhu, Nagabhushana (1999)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Flag vectors of multiplicial polytopes.

Bayer, Margaret M. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Sweeping the cd-index and the toric $h$ -vector.

Lee, Carl W. (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

$h^{*}$ -vectors, Eulerian polynomials and stable polytopes of graphs.

Athanasiadis, Christos A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the monotone upper bound problem.

Pfeifle, Julian, Ziegler, Günter M. (2004)

Experimental Mathematics

Similarity:

Vertex-vectors of quadrangular 3-polytopes with two types of edges

S. Jendrol, E. Jucovič, M. Trenkler (1989)

Banach Center Publications

Similarity:

On non-inscribable polytopes

Branko Grünbaum, Ernest Jucovič (1974)

Czechoslovak Mathematical Journal

Similarity:

On the refinements of a polyhedral subdivision.

Francisco Santos (2001)

Collectanea Mathematica

Similarity:

Let pi: P --> Q be an affine projection map between two polytopes P and Q. Billera and Sturmfels introduced in 1992 the concept of polyhedral subdivisions of Q induced by pi (or pi-induced) and the fiber polytope of the projection: a polytope Sygma(P,pi) of dimension dim(P)-dim(Q) whose faces are in correspondence with the coherent pi-induced subdivisions (or pi-coherent subdivisions). In this paper we investigate the structure of the poset of pi-induced refinements of a pi-induced...

Hierarchical models, marginal polytopes, and linear codes

Thomas Kahle, Walter Wenzel, Nihat Ay (2009)

Kybernetika

Similarity:

In this paper, we explore a connection between binary hierarchical models, their marginal polytopes, and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.