Curtis Bright

activity

20242026

collaborators

Showing 2025Show all

4 papers · 1 filter

math.CO2025

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation

Curtis Bright, Amadou Keita, Brett Stevens

A $k$ -net( $n$ ) is a combinatorial design equivalent to $k - 2$ mutually orthogonal Latin squares of order $n$ . A relation in a net is a linear dependency over $F_{2}$ in the i…

cs.LO2025

Queen Domination by SAT Solving

Taha Rostami, Curtis Bright

The queen domination problem asks for the minimum number of queens required to attack all squares on an $n \times n$ chessboard. Once this optimal number is known, determining the…

math.CO2025

Symbolic Sets for Proving Bounds on Rado Numbers

Tanbir Ahmed, Lamina Zaman, Curtis Bright

Given a linear equation $E$ of the form $a x + b y = cz$ where $a$ , $b$ , $c$ are positive integers, the $k$ -colour Rado number $R_{k} (E)$ is the smallest positive integer $…

math.CO2025

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation

Curtis Bright, Amadou Keita, Brett Stevens

Ever since E. T. Parker constructed an orthogonal pair of $10 \times 10$ Latin squares in 1959, an orthogonal triple of $10 \times 10$ Latin squares has been one of the most sought-aft…

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation

Queen Domination by SAT Solving

Symbolic Sets for Proving Bounds on Rado Numbers

Myrvold's Results on Orthogonal Triples of 10×10 Latin Squares: A SAT Investigation

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation