58 search results - page 4 / 12 » Almost Every Domain is Universal |
STACS
1998
Springer
13 years 10 months ago
1998
Springer
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
TLCA
2005
Springer
13 years 12 months ago
2005
Springer
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
RSA
2010
13 years 4 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
EJC
2006
13 years 6 months ago
2006
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
ORDER
2010
13 years 4 months ago
2010
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We ...