SIAMDM
2011
13 years 8 months ago
2011
SIAMDM
2011
13 years 12 months ago
2011
SIAMDM
2011
14 years 13 days ago
2011
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...
SIAMDM
2011
14 years 13 days ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
SIAMDM
2011
14 years 13 days ago
2011
55
Voted
SIAMDM
2011
14 years 13 days ago
2011
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, o...
SIAMDM
2011
14 years 13 days ago
2011
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associat...
SIAMDM
2011
14 years 13 days ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
111
click to vote
SIAMDM
2011
14 years 13 days ago
2011
Consider a closed curve in the plane that does not intersect itself; by the Jordan-Schoenflies Theorem, it bounds a distorted disk. Now consider a closed curve that intersects its...