𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On splitting sets in block designs and finding roots of polynomials

✍ Scribed by P.C. Van Oorschot; S.A. Vanstone

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
1006 KB
Volume
84
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The general notion of t-splitting sets is introduced within the context of combinatorial block designs. A greatest lower bound on cardinality of such sets, and an upper bound on cardinality of the smallest such set in a given design are established. The abstraction of t-splitting sets is shown to provide a natural framework for the analysis of the problem of finding roots of polynomials over finite fields, and elementary concepts from design theory are applied to re-examine and extend some existing results in this area.

πŸ“œ SIMILAR VOLUMES

Further results on large sets of disjoin
Further results on large sets of disjoint group-divisible designs with block size three and type 2n41
✍ H. Cao; J. Lei; L. Zhu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 2 views

## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^n^4^1^ were first studied by Schellenberg and Stinson because of their connection with perfect threshold schemes. It is known that such large sets can exist only for __n__ ≑0 (mod 3) and do exist for all odd

Counterexample and correction to a resul
Counterexample and correction to a result on robust Schur stability of a complex-coefficient polynomials set with coefficients in a diamond
✍ K.K. Yen; S.F. Zhou πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 511 KB

In Ref. (1) , Schur stability of a family of polynomials with transformed coefficients varying in a diamond has been studied. A necessary and sufficient condition was given for the stability of the entire family if a selected set of eight edge polynomials was stable. In this paper, we show via a co