4 citations · 12 across the 9 of their papers we have counts for
11 papers
A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs
Darcy Best, Max Ward
We provide an algorithm requiring only time to compute the maximum weight independent set of interval filament graphs. This also implies an algorithm to compute t…
Parity of transversals of Latin squares
Darcy Best, Ian M. Wanless
We introduce a notion of parity for transversals, and use it to show that in Latin squares of order , the number of transversals is a multiple of 4. We also demonstrate…
Small Latin arrays have a near transversal
Darcy Best, Kyle Pula, Ian M. Wanless
A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an array is a selection of cells taken…
What did Ryser Conjecture?
Darcy Best, Ian M. Wanless
Two prominent conjectures by Herbert J. Ryser have been falsely attributed to a somewhat obscure conference proceedings that he wrote in German. Here we provide a translation of th…
Covers and partial transversals of Latin squares
Darcy Best, Trent Marbach, Rebecca J. Stones +1
We define a cover of a Latin square to be a set of entries that includes at least one representative of each row, column and symbol. A cover is minimal if it does not contain any s…
Transversals in Latin arrays with many distinct symbols
Darcy Best, Kevin Hendrey, Ian M. Wanless +2
An array is row-Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row-Latin. A transversal in an array is a selection of…
Mutually Unbiased Weighing Matrices
Darcy Best, Hadi Kharaghani, Hugh Ramp
Inspired by the many applications of mutually unbiased Hadamard matrices, we study mutually unbiased weighing matrices. These matrices are studied for small orders and weights in b…
Unbiased complex Hadamard matrices and bases
Darcy Best, Hadi Kharaghani
We introduce mutually unbiased complex Hadamard (MUCH) matrices and show that the number of MUCH matrices of order 2n, n odd, is at most 2 and the bound is attained for n = 1,5,9.…
On unit weighing matrices with small weight
Darcy Best, Hadi Kharaghani, Hugh Ramp
We study the structure of unit weighing matrices of order n and weights 2, 3 and 4. We show that the number of inequivalent unit weighing matrices UW(n,4) depends on the number of…
Linear relations of zeroes of the zeta-function
Darcy Best, Tim Trudgian
This article considers linear relations between the non-trivial zeroes of the Riemann zeta-function. The main application is an alternative disproof to Mertens' conjecture. We show…
Turyn-type sequences: Classification, Enumeration and Construction
D. Best, D. Z. Djokovic, H. Kharaghani +1
Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B an…