1019 search results - page 29 / 204 » Uniform Functors on Sets |
ARSCOM
2007
13 years 7 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
DM
2007
13 years 7 months ago
2007
We investigate the existence of 3-designs and uniform large sets of 3-designs with block size 6 admitting PSL(2, q) as an automorphism group. We show the existence of simple 3-(28...
COMBINATORICS
2000
13 years 7 months ago
2000
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
COMBINATORICS
2002
13 years 7 months ago
2002
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...