6 research outputs found
Cocyclic Hadamard Matrices: An Efficient Search Based Algorithm
This dissertation serves as the culmination of three papers. “Counting the decimation classes of binary vectors with relatively prime fixed-density presents the first non-exhaustive decimation class counting algorithm. “A Novel Approach to Relatively Prime Fixed Density Bracelet Generation in Constant Amortized Time presents a novel lexicon for binary vectors based upon the Discrete Fourier Transform, and develops a bracelet generation method based upon the same. “A Novel Legendre Pair Generation Algorithm expands upon the bracelet generation algorithm and includes additional constraints imposed by Legendre Pairs. It further presents an efficient sorting and comparison algorithm based upon symmetric functions, as well as multiple unique Legendre Pairs
Cyclic Complexity of Some Infinite Words and Generalizations
Cassaigne et al. introduced the cyclic complexity function c_x(n), which gives the number of cyclic conjugacy classes of length-n factors of a word x. We study the behavior of this function for the Fibonacci word f and the Thue–Morse word t. If φ = (1 + √5)/2, we show that lim sup_{n → 1} c_f(n)/n ≥ 2/φ² and conjecture that equality holds. Similarly, we show that lim sup_{n → 1} c_t(n)/n ≥ 2 and conjecture that
equality holds. We also propose a generalization of the cyclic complexity function and suggest some directions for further investigation. Most results are obtained by computer proofs using Mousavi’s Walnut software.The first author was supported by an NSERC USRA. The second author was supported by an NSERC Discovery Grant