9,018 research outputs found
Tournaments, 4-uniform hypergraphs, and an exact extremal result
We consider -uniform hypergraphs with the maximum number of hyperedges
subject to the condition that every set of vertices spans either or
exactly hyperedges and give a construction, using quadratic residues, for
an infinite family of such hypergraphs with the maximum number of hyperedges.
Baber has previously given an asymptotically best-possible result using random
tournaments. We give a connection between Baber's result and our construction
via Paley tournaments and investigate a `switching' operation on tournaments
that preserves hypergraphs arising from this construction.Comment: 23 pages, 6 figure
A new and flexible method for constructing designs for computer experiments
We develop a new method for constructing "good" designs for computer
experiments. The method derives its power from its basic structure that builds
large designs using small designs. We specialize the method for the
construction of orthogonal Latin hypercubes and obtain many results along the
way. In terms of run sizes, the existence problem of orthogonal Latin
hypercubes is completely solved. We also present an explicit result showing how
large orthogonal Latin hypercubes can be constructed using small orthogonal
Latin hypercubes. Another appealing feature of our method is that it can easily
be adapted to construct other designs; we examine how to make use of the method
to construct nearly orthogonal and cascading Latin hypercubes.Comment: Published in at http://dx.doi.org/10.1214/09-AOS757 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
A new Euclidean tight 6-design
We give a new example of Euclidean tight 6-design in .Comment: 9 page
- …