Skip to search formSkip to main contentSkip to account menu

Kurepa tree

Known as: Kurepa hypothesis, Kurepa conjecture, Kurepa family 
In set theory, a Kurepa tree is a tree (T, <) of height ω1, each of whose levels is at most countable, and has at least ℵ2 many branches. This… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Kurepa conjecture states that the gcd (!n,n!) is equal to 2 for all n=2,3,….Although this conjecture has not been proven, in… 
2014
2014
Given a prime number $p$, we deduce from a formula of Barsky and Benzaghou and from a result of Coulter and Henderson on… 
2014
2014
We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in… 
2004
2004
Some generalisations of Precupanu’s inequality for orthornormal families of vectors in real or complex inner product spaces and… 
2004
2004
The sum of factorials function, also known as the left factorial function, is defined as !n = 0! + 1! + · · ·+ (n− 1)!. These… 
2001
2001
Throughout this note H will denote a complex Hilbert space, L(H) the set of all bounded linear operators on H, endowed with the… 
1996
1996
1993
1993
By an !1{tree we mean a tree of power !1 and height !1. An !1{tree is called a Kurepa tree if all its levels are countable and it…