Higher SPIN alternating sign matrices.
Behrend, Roger E., Knight, Vincent A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Behrend, Roger E., Knight, Vincent A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Burgiel, H., Reiner, V. (1998)
The New York Journal of Mathematics [electronic only]
Similarity:
Pfeifle, Julian, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
Oleg V. Borodin (1992)
Mathematica Slovaca
Similarity:
Lee, Carl W. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Joswig, Michael, Kaibel, Volker, Pfetsch, Marc E., Ziegler, Günter M. (2001)
Advances in Geometry
Similarity:
Knutson, Allen, Purbhoo, Kevin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bacher, R., Krattenthaler, C. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hohlweg, Christophe, Lortie, Jonathan, Raymond, Annie (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: