Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Earl S. Kramer"'
Autor:
Linda S. Fosnaugh, Earl S. Kramer
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 19, Iss 1, Pp 33-37 (1996)
The neighborhood N(T) of a tile T is the set of all tiles which meet T in at least one point. If for each tile T there is a different tile T1 such that N(T)=N(T1) then we say the tiling has the neighborhood property (NEBP). Grünbaum and Shepard conj
Externí odkaz:
https://doaj.org/article/9fee9bd717b243ebb7878f06b073dadc
Autor:
Michael Ira, Earl S. Kramer
Publikováno v:
Journal of Combinatorial Designs. 8:141-145
If B is a block in a proper Steiner 6–wise balanced design then |B| ≤ v/2. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 141–145, 2000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::339a2ed1e86f6ffe2c4a67bb35ea539d
https://doi.org/10.1002/(sici)1520-6610(2000)8:2<141::aid-jcd6>3.0.co
https://doi.org/10.1002/(sici)1520-6610(2000)8:2<141::aid-jcd6>3.0.co
Publikováno v:
Journal of Combinatorial Designs. 5:125-145
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93c9cf7ac0b270e6fb5a08ebd82afc04
https://doi.org/10.1002/(sici)1520-6610(1997)5:2<125::aid-jcd4>3.0.co
https://doi.org/10.1002/(sici)1520-6610(1997)5:2<125::aid-jcd4>3.0.co
Autor:
Earl S. Kramer, Spyros S. Magliveras
More than eighty participants from all over the world attended an AMS Special Session on Finite Geometries and Combinatorial Designs held in Lincoln, Nebraska, in the fall of 1987. This volume contains the proceedings of that Special Session, in addi
Autor:
Dale M. Mesner, Earl S. Kramer, Stephen Mellendorf, Richard A. Brualdi, Peter Horak, Geňa Hahn
Publikováno v:
Journal of Combinatorial Theory, Series A. 69:333-346
In 1977, Ganter and Teirlinck proved that any 2 t × 2 t matrix with 2 t nonzero elements can be partitioned into four submatrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any mt × nt matr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a277b2220b78c968993686147b11ef8b
https://doi.org/10.1016/0097-3165(95)90056-x
https://doi.org/10.1016/0097-3165(95)90056-x
Autor:
Rudolf Mathon, Earl S. Kramer
Publikováno v:
Journal of Combinatorial Designs. 3:411-425
We characterize the proper t-wise balanced designs t-(v,K,1) for t ≥ 3, λ = 1 and v ≤ 16 with at least two block sizes. While we do not examine extensions of S(3,4,16)'s, we do determine all other possible extensions of S(3,K,v)'s for v ≤ 16.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a4bea079c79cc834cdbb99c2541f4c5
https://doi.org/10.1002/jcd.3180030606
https://doi.org/10.1002/jcd.3180030606
Publikováno v:
Discrete Mathematics. 96(2):101-110
We show that perpendicular arrays exist for arbitrarily large t and with λ = 1. In particular, if d devides ( t +1) then there is a PA 1 (t, t+1, t+( f(t+1) d )) . If υ ≡ 1 or 2 (mod 3) then there is a PA λ (3, 4, υ ) for any λ. If 3 divides
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::880c04528cc7dc95ea50b71cf78c5331
Autor:
Earl S. Kramer
Publikováno v:
Discrete Mathematics. 81(2):223-224
Using graphs we provide an elegant construction of a simple S3(3,5,21).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5f651902cd0e0e42be3e5c0baa439e0
Autor:
Dale M. Mesner, Earl S. Kramer
Publikováno v:
Discrete Mathematics. 15(3):263-296
A t-design T=(X, B), denoted by (λ; t, k, v), is a system B of subsets of size k from a v-set X, such that each t-subset of X is contained in exactly λ elements of B. A hypergraph H=(Y, E) is a finite set Y where E=(Ei: iϵI) is a family of subsets
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ccebf967e219dd27935398cf874b9ee
Publikováno v:
Discrete Mathematics. 46(3):227-240
A pair (X, B) will be a t-wise balanced design (tBD) of type t−(v, K, λ) if B = (Bi: i ϵ I) is a family of subsets of X, called blocks, such that: (i) |X| = v ϵ N, where N is the set of positive integers; (ii) 1⩽t⩽|Bi|ϵK⊆N, for every i ϵ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b415b2f088c21e9096f54a2ff5469de