Darcy Best
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Darcy Best has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Hadi Kharaghani
Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada
4 shared publications - Hadi Kharaghani
University of Lethbridge
3 shared publications - Hugh Ramp
Department of Mathematics & Computer Science University of Lethbridge Lethbridge T1K 3M4 Alberta Canada
3 shared publications - Hugh Ramp
Department of Physics University of Alberta T6G 2E9 Edmonton Alberta Canada
2 shared publications D. Z. Djokovic
1 shared publication- Dragomir Z. Djokovic
University of Waterloo
1 shared publication
Latest Publications
- Open Access
Linear relations of zeroes of the zeta-function
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 that $\limsup M(x)x^{-1/2} \geq 1.6383$ and that $\liminf M(x)x^{-1/2}\leq -1.6383$.Open AccessLinear relations of zeroes of the zeta-function
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 that $\limsup M(x)x^{-1/2} \geq 1.6383$ and that $\liminf M(x)x^{-1/2}\leq -1.6383$. - 4 March 2014
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 76 (2) , 237-256
Mutually unbiased weighing matrices
- 4 March 2014
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 76 (2) , 237-256
Mutually unbiased weighing matrices
- Open Access
Mutually Unbiased Weighing Matrices
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 both the real and complex setting. Our results make use of and examine the sharpness of a very important existing upper bound for the number of mutually unbiased weighing matrices.
Open AccessMutually Unbiased Weighing Matrices
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 both the real and complex setting. Our results make use of and examine the sharpness of a very important existing upper bound for the number of mutually unbiased weighing matrices.
- Open Access
On unit weighing matrices with small weight
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 decompositions of n into sums of non-negative multiples of some specific positive integers. We also show two interesting sporadic cases in order to show the complexities involved for weights larger than 4.
Open AccessOn unit weighing matrices with small weight
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 decompositions of n into sums of non-negative multiples of some specific positive integers. We also show two interesting sporadic cases in order to show the complexities involved for weights larger than 4.
- Open Access
Unbiased complex Hadamard matrices and bases
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. Furthermore, we prove that certain pairs of mutually unbiased complex Hadamard matrices of order m can be used to construct pairs of unbiased real Hadamard matrices of order 2m. As a consequence we generate a new pair of unbiased real Hadamard matrices of order 36.
Open AccessUnbiased complex Hadamard matrices and bases
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. Furthermore, we prove that certain pairs of mutually unbiased complex Hadamard matrices of order m can be used to construct pairs of unbiased real Hadamard matrices of order 2m. As a consequence we generate a new pair of unbiased real Hadamard matrices of order 36.
- Open Access
Turyn-type sequences: Classification, Enumeration and Construction
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 and twice that of C,D is a delta-function (i.e., vanishes everywhere except at 0). Turyn-type sequences TT(n) are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for TT(n) in general. By using this canonical form, we enumerate the equivalence classes of TT(n) for n up to and including 32. We also construct the first example of Turyn-type sequences TT(38).
Open AccessTuryn-type sequences: Classification, Enumeration and Construction
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 and twice that of C,D is a delta-function (i.e., vanishes everywhere except at 0). Turyn-type sequences TT(n) are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for TT(n) in general. By using this canonical form, we enumerate the equivalence classes of TT(n) for n up to and including 32. We also construct the first example of Turyn-type sequences TT(38).
- 16 May 2012
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 21 (1) , 24-35
Turyn‐Type Sequences: Classification, Enumeration, and Construction
Turyn‐type sequences, , are quadruples of ‐sequences , with lengths , respectively, where the sum of the nonperiodic autocorrelation functions of and twice that of is a δ‐function (i.e., vanishes everywhere except at 0). Turyn‐type sequences are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for in general. By using this canonical form, we enumerate the equivalence classes of for . We also construct the first example of Turyn‐type sequences .
- 16 May 2012
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 21 (1) , 24-35
Turyn‐Type Sequences: Classification, Enumeration, and Construction
Turyn‐type sequences, , are quadruples of ‐sequences , with lengths , respectively, where the sum of the nonperiodic autocorrelation functions of and twice that of is a δ‐function (i.e., vanishes everywhere except at 0). Turyn‐type sequences are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for in general. By using this canonical form, we enumerate the equivalence classes of for . We also construct the first example of Turyn‐type sequences .
- 14 May 2010
- Published by Springer Nature in Cryptography and Communications
- Vol. 2 (2) , 199-209
Unbiased complex Hadamard matrices and bases
- 14 May 2010
- Published by Springer Nature in Cryptography and Communications
- Vol. 2 (2) , 199-209
Unbiased complex Hadamard matrices and bases