Three Kneser Lemmata
نویسنده
چکیده
This note contains three versions of a result which is sometimes referred to as Kneser’s lemma and states that (with respect to a fixed triangulation) there is a bound on the number of disjointly embedded normal surfaces in a 3–manifold which satisfy an extra non–triviality condition. One often stipulates that no two of the surfaces be parallel in M . We relax this condition and merely assume that no two of the surfaces are normal isotopic, under which we understand that they do not have the same normal surface coordinates. The three versions address in turn compact, closed and cusped 3–manifolds (where we restrict ourselves to torus cusps). Techniques are borrowed from [4, 1] and lectures by Hyam Rubinstein. We also extend the main result of [1] to show that if T is the number of tetrahedra in a triangulation of a closed, irreducible 3–manifold M , then if a 2–sided, geometrically incompressible surface in a closed, irreducible 3–manifold M has more than or equal to 3 2 T components, then two of them must be parallel.
منابع مشابه
Codimension two and three Kneser Transversals
Let k, d, λ > 1 be integers with d > λ and let X ⊂ R be a finite set. A (d−λ)-plane L transversal to the convex hull of all k-sets of X is called Kneser transversal. If in addition L contains (d− λ) + 1 points of X, then L is called complete Kneser transversal. In this paper, we present various results on the existence of (complete) Kneser transversals for λ = 2, 3. In order to do this, we intr...
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کاملStrategies for Training Large Vocabulary Neural Language Models
Training neural network language models over large vocabularies is computationally costly compared to count-based models such as Kneser-Ney. We present a systematic comparison of neural strategies to represent and train large vocabularies, including softmax, hierarchical softmax, target sampling, noise contrastive estimation and self normalization. We extend self normalization to be a proper es...
متن کاملA Bayesian Interpretation of Interpolated Kneser-Ney NUS School of Computing Technical Report TRA2/06
Interpolated Kneser-Ney is one of the best smoothing methods for n-gram language models. Previous explanations for its superiority have been based on intuitive and empirical justifications of specific properties of the method. We propose a novel interpretation of interpolated Kneser-Ney as approximate inference in a hierarchical Bayesian model consisting of Pitman-Yor processes. As opposed to p...
متن کاملSymmetries of the Stable Kneser Graphs
It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...
متن کامل