Higher SPIN alternating sign matrices.
Behrend, Roger E., Knight, Vincent A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The alternating sign matrix polytope.”
Higher SPIN alternating sign matrices.
Two signed associahedra.
Burgiel, H., Reiner, V. (1998)
The New York Journal of Mathematics [electronic only]
Similarity:
On the monotone upper bound problem.
Pfeifle, Julian, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
An extension of Kotzig’s theorem on the minimum weight of edges in -polytopes
Oleg V. Borodin (1992)
Mathematica Slovaca
Similarity:
Sweeping the cd-index and the toric -vector.
Lee, Carl W. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vertex-facet incidences of unbounded polyhedra.
Joswig, Michael, Kaibel, Volker, Pfetsch, Marc E., Ziegler, Günter M. (2001)
Advances in Geometry
Similarity:
Product and puzzle formulae for Belkale-Kumar coefficients.
Knutson, Allen, Purbhoo, Kevin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic statistics for triangulations and Fuß-Catalan complexes.
Bacher, R., Krattenthaler, C. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem
Gerard Sierksma (1994)
Applicationes Mathematicae
Similarity:
The 3-Opt procedure deals with interchanging three edges of a tour with three edges not on that tour. For n≥6, the 3-Interchange Graph is a graph on 1/2(n-1)! vertices, corresponding to the hamiltonian tours in K_n; two vertices are adjacent iff the corresponding hamiltonian tours differ in an interchange of 3 edges; i.e. the tours differ in a single 3-Opt step. It is shown that the 3-Interchange Graph is a hamiltonian subgraph of the Symmetric Traveling Salesman Polytope. Upper bounds...
On the number of planar orientations with prescribed degrees.
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The centers of gravity of the associahedron and of the permutahedron are the same.
Hohlweg, Christophe, Lortie, Jonathan, Raymond, Annie (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: