Probabilistic existence of rigid combinatorial structures

Details Probabilistic existence of rigid combinatorial structures Probabilistic existence of rigid combinatorial structures

2011-11-02

arxiv.org/abs/1111.0492v1

Mathematics

Combinatorics

Extended abstract

Scientific paper

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise permutations. In all cases, the sizes of the objects are optimal up to polynomial overhead. The proof of existence is probabilistic. We show that a randomly chosen such object has the required properties with positive yet tiny probability. The main technical ingredient is a special local central limit theorem for suitable lattice random walks with finitely many steps.

Affiliated with

Also associated with

No associations

Rating

Probabilistic existence of rigid combinatorial structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic existence of rigid combinatorial structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic existence of rigid combinatorial structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-328240