Zobrazeno 1 - 10
of 55
pro vyhledávání: '"BRIGHT, CURTIS"'
In this paper, we provide algorithmic methods for conducting exhaustive searches for periodic Golay pairs. Our methods enumerate several lengths beyond the currently known state-of-the-art available searches: we conducted exhaustive searches for peri
Externí odkaz:
http://arxiv.org/abs/2408.15611
Cryptographic hash functions play a crucial role in ensuring data security, generating fixed-length hashes from variable-length inputs. The hash function SHA-256 is trusted for data security due to its resilience after over twenty years of intense sc
Externí odkaz:
http://arxiv.org/abs/2406.20072
Autor:
Ajani, Yameen, Bright, Curtis
The difficulty of factoring large integers into primes is the basis for cryptosystems such as RSA. Due to the widespread popularity of RSA, there have been many proposed attacks on the factorization problem such as side-channel attacks where some bit
Externí odkaz:
http://arxiv.org/abs/2406.20071
We show that the $n$'th digit of the base-$b$ representation of the golden ratio is a finite-state function of the Zeckendorf representation of $b^n$, and hence can be computed by a finite automaton. Similar results can be proven for any quadratic ir
Externí odkaz:
http://arxiv.org/abs/2405.02727
This paper introduces AlphaMapleSAT, a novel Monte Carlo Tree Search (MCTS) based Cube-and-Conquer (CnC) SAT solving method aimed at efficiently solving challenging combinatorial problems. Despite the tremendous success of CnC solvers in solving a va
Externí odkaz:
http://arxiv.org/abs/2401.13770
One of the fundamental results in quantum foundations is the Kochen-Specker (KS) theorem, which states that any theory whose predictions agree with quantum mechanics must be contextual, i.e., a quantum observation cannot be understood as revealing a
Externí odkaz:
http://arxiv.org/abs/2306.13319
Autor:
Bright, Curtis
Publikováno v:
Can. Math. Bull. 67 (2024) 369-378
We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby providing a
Externí odkaz:
http://arxiv.org/abs/2301.11056
In this paper we provide results on using integer programming (IP) and constraint programming (CP) to search for sets of mutually orthogonal latin squares (MOLS). Both programming paradigms have previously successfully been used to search for MOLS, b
Externí odkaz:
http://arxiv.org/abs/2103.11018
In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry$\unicode{x2014}$the long-standing problem of determining if a projective plane of order ten exists. Both the original search and an i
Externí odkaz:
http://arxiv.org/abs/2012.04715
Publikováno v:
Lecture Notes in Computer Science 12126 (2020) 97-111
In 1983, a computer search was performed for ovals in a projective plane of order ten. The search was exhaustive and negative, implying that such ovals do not exist. However, no nonexistence certificates were produced by this search, and to the best
Externí odkaz:
http://arxiv.org/abs/2001.11974