4 search results - page 1 / 1 » Sharp thresholds for hypergraph regressive Ramsey numbers |
JCT
2011
14 years 5 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
81
Voted
JCT
2000
14 years 10 months ago
2000
Following ideas of Richer (2000) we introduce the notion of unordered regressive Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of Ackermannian growt...
JCT
2008
14 years 10 months ago
2008
82
Voted
CORR
2007
Springer
14 years 10 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...