نتایج جستجو برای: cantor intersection theorem

تعداد نتایج: 173649  

Journal: :European Journal of Combinatorics 1994

Journal: :Electr. J. Comb. 2014
Radoslav Fulek Jan Kyncl Igor Malinovic Dömötör Pálvölgyi

The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three o...

1997
YUVAL PERES

It is natural to expect that the arithmetic sum of two Cantor sets should have positive Lebesgue measure if the sum of their dimensions exceeds 1, but there are many known counterexamples, e.g. when both sets are the middle-α Cantor set and α ∈ ( 1 3 , 1 2 ). We show that for any compact set K and for a.e. α ∈ (0, 1), the arithmetic sum of K and the middle-α Cantor set does indeed have positive...

2001
KALLE KARU

The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well defined even for nonrational polytopes when there is no variety associated to it. We prove the Hard Lefschetz theorem for the intersection cohomology of a gener...

2009
RYAN BRODERICK YANN BUGEAUD LIOR FISHMAN DMITRY KLEINBOCK BARAK WEISS

Given b > 1 and y ∈ R/Z, we consider the set of x ∈ R such that y is not a limit point of the sequence {bx mod 1 : n ∈ N}. Such sets are known to have full Hausdorff dimension, and in many cases have been shown to have a stronger property of being winning in the sense of Schmidt. In this paper, by utilizing Schmidt games, we prove that these sets and their bi-Lipschitz images must intersect wit...

Journal: :Foundations of Computational Mathematics 2005
Serkan Hosten Amit Khetan Bernd Sturmfels

Given a model in algebraic statistics and data, the likelihood function is a rational function on a projective variety. Algebraic algorithms are presented for computing all critical points of this function, with the aim of identifying the local maxima in the probability simplex. Applications include models specified by rank conditions on matrices and the Jukes-Cantor models of phylogenetics. Th...

Journal: :Arch. Math. Log. 2012
Philipp Lücke Saharon Shelah

Let L be a finite first-order language and 〈Mn | n < ω〉 be a sequence of finite L-models containing models of arbitrarily large finite cardinality. If the intersection of less than continuum-many dense open subsets of Cantor Space 2 is non-empty, then there is a non-principal ultrafilter U over ω such that the corresponding ultraproduct Q U Mn is infinite and has an automorphism that is not ind...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید