Halving point sets.
Page 1
Displaying 1 – 5 of 5
Hamiltonian Simple Polytopes.
N. Prabhu (1995)
Discrete & computational geometry
Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem
Gerard Sierksma (1994)
Applicationes Mathematicae
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 are derived...
Higher SPIN alternating sign matrices.
Behrend, Roger E., Knight, Vincent A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Higher-dimensional cluster combinatorics and representation theory
Steffen Oppermann, Hugh Thomas (2012)
Journal of the European Mathematical Society
Higher Auslander algebras were introduced by Iyama generalizing classical concepts from representation theory of finite-dimensional algebras. Recently these higher analogues of classical representation theory have been increasingly studied. Cyclic polytopes are classical objects of study in convex geometry. In particular, their triangulations have been studied with a view towards generalizing the rich combinatorial structure of triangulations of polygons. In this paper, we demonstrate a connection...
Currently displaying 1 – 5 of 5
Page 1