7 citations · 27 across the 25 of their papers we have counts for
27 papers
On the minisymposium problem
Peter Danziger, Eric Mendelsohn, Brett Stevens +1
The generalized Oberwolfach problem asks for a factorization of the complete graph into prescribed -factors and at most a -factor. When all -factors are pairwise iso…
Some complementary Gray codes
Adam Hoyt, Brett Stevens
A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of t…
Sets of mutually orthogoval projective and affine planes
Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab +3
A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at…
Linear and Circular Single Change Covering Designs Re-visited
Amanda Chafee, Brett Stevens
A \textbf{single change covering design} is a -set and an ordered list $\cL$ of blocks of size where every -set must occur in at least one block. Each pair of con…
Difference Methods for Double-Change Covering Designs
Amanda Lynn Chafee, Brett Stevens
A \textbf{double-change covering design} (DCCD) is a -set and an ordered list of blocks of size where every pair from must occur in at least one bl…
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays
André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura +2
In this work, constructions of ordered covering arrays are discussed and applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman spaces (RT spaces), improving o…