Search Results - "Dinitz, J. H."

Room square patterns by Dinitz, J.H., Lamken, E.R.

“…Suppose a Howell design H(s,2n), H, contains as a subarray an m×m array M which contains a room square of order m and possibly other pairs in the “empty” cells…”
Get full text

Square integer Heffter arrays with empty cells by Archdeacon, D. S., Dinitz, J. H., Donovan, D. M., Yazıcı, Emine Şule

“…A Heffter array H ( m , n ; s , t ) is an m × n matrix with nonzero entries from Z 2 m s + 1 such that (i) each row contains s filled cells and each column…”
Get full text

Sets of three pairwise orthogonal Steiner triple systems by Dinitz, J.H., Dukes, P., Ling, Alan C.H.

“…Two Steiner triple systems (STS) are orthogonal if their sets of triples are disjoint, and two disjoint pairs of points defining intersecting triples in one…”
Get full text

Complementary partial resolution squares for Steiner triple systems by Dinitz, J.H., Lamken, E.R., Ling, A.C.H.

“…In this paper, we introduce a generalization of frames called partial resolution squares. We are interested in constructing sets of complementary partial…”
Get full text

A survey of Heffter arrays by Pasotti, A, Dinitz, J. H

“…Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper…”
Get full text

Estimating landscape carrying capacity through maximum clique analysis by Donovan, Therese M, Warrington, Gregory S, Schwenk, W. Scott, Dinitz, Jeffrey H

“…Habitat suitability (HS) maps are widely used tools in wildlife science and establish a link between wildlife populations and landscape pattern. Although HS…”
Get full text

On the existence of three dimensional Room frames and Howell cubes by Dinitz, J.H., Lamken, E.R., Warrington, Gregory S.

“…A Howell design of side s and order 2n+2, or more briefly an H(s,2n+2), is an s×s array in which each cell is either empty or contains an unordered pair of…”
Get full text

Maximum uniformly resolvable designs with block sizes 2 and 4 by Dinitz, J.H., Ling, Alan C.H., Danziger, Peter

“…A central question in design theory dating from Kirkman in 1850 has been the existence of resolvable block designs. In this paper we will concentrate on the…”
Get full text

The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle by Dinitz, J.H., Ling, Alan C.H.

“…The Hamilton—Waterloo problem is to determine the existence of a 2‐factorization of K2n+1 in which r of the 2‐factors are isomorphic to a given 2‐factor R and…”
Get full text

Maximum uniformly resolvable designs with block sizes 2 and 4: Graphs and Designs in honour of Anthony Hilton by DINITZ, J. H, LING, Alan C. H, DANZIGER, Peter

Get full text

Two new infinite families of extremal class-uniformly resolvable designs by Dinitz, J.H., Ling, Alan C.H.

“…In 1991, Lamken et al. [7] introduced the notion of class‐uniformly resolvable designs, CURDs. These are resolvable pairwise balanced designs PBD(v, K, λ) in…”
Get full text

Translational hulls and block designs by MARGOLIS, S. W, DINITZ, J. H, LALLEMENT, G

Get full text

Mutually orthogonal latin squares: a brief survey of constructions by J. Colbourn, Charles, H. Dinitz, Jeffrey

“…In the two centuries since Euler first asked about mutually orthogonal latin squares, substantial progress has been made. The biggest breakthroughs came in…”
Get full text

On Partial Sums in Cyclic Groups by Archdeacon, D. S, Dinitz, J. H, Mattern, A, Stinson, D. R

“…We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture…”
Get full text

Square Integer Heffter Arrays with Empty Cells by Archdeacon, D. S, Dinitz, J. H, Donovan, D. M, Yaızı, Ermine Şule

“…A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and…”
Get full text

On the structure of uniform one-factorizations from starters in finite fields by Dinitz, Jeffrey H., Dukes, Peter

“…It is known that the Horton starters can be used to construct uniform one-factorizations of the complete graph. Of primary interest is the cycle structure of…”
Get full text

Packing Costas Arrays by Dinitz, J. H, Ostergard, P. R. J, Stinson, D. R

“…A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a…”
Get full text

On the maximum number of different ordered pairs of symbols in sets of latin squares by Dinitz, Jeffrey H., Stinson, Douglas R.

“…In this paper, we study the problem of constructing sets of s latin squares of order m such that the average number of different ordered pairs obtained by…”
Get full text

Quorum Systems Constructed from Combinatorial Designs by Colbourn, Charles J, Dinitz, Jeffrey H, Stinson, Douglas R

“…A quorum system is a set system in which any two subsets have nonempty intersection. Quorum systems have been extensively studied as a method of maintaining…”
Get full text

On Nonisomorphic Room Squares by Dinitz, J. H., Stinson, D. R.

“…Let$\operatorname{NR}(s)$denote the number of nonisomorphic Room squares of side s. We prove that for s sufficiently large,$\operatorname{NR}(s) \geqslant…”
Get full text