Cover Image

Improving SAT Solvers on Orthogonal Latin Square Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barnoff, Aaron, Bright, Curtis
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

Queen Domination by SAT Solving
by: Rostami, Taha, et al.
Published: (2025)

Transitive Sets of Mutually Orthogonal Latin Squares
by: Keita, Amadou, et al.
Published: (2026)

Using finite automata to compute the base-$b$ representation of the golden ratio and other quadratic irrationals
by: Barnoff, Aaron, et al.
Published: (2024)

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey $R(3, 8)$ and $R(3, 9)$ Problems
by: Li, Zhengyu, et al.
Published: (2025)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
by: Kirchweger, Markus, et al.
Published: (2025)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

Symbolic Sets for Proving Bounds on Rado Numbers
by: Ahmed, Tanbir, et al.
Published: (2025)

Computing random $r$-orthogonal Latin squares
by: Bereg, Sergey
Published: (2023)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
by: Büngener, Aaron
Published: (2025)

Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)

The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)

The Spectrum of the Singular Values of Z-Shaped Graph Matrices
by: Cai, Wenjun, et al.
Published: (2020)

On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)

The Rainbow Arborescence Problem on Cycles
by: Bérczi, Kristóf, et al.
Published: (2025)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
by: Caragiannis, Ioannis, et al.
Published: (2024)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

On the Identity and Group Problems for Complex Heisenberg Matrices
by: Bell, Paul C., et al.
Published: (2023)

Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2021)

SAT and Lattice Reduction for Integer Factorization
by: Ajani, Yameen, et al.
Published: (2024)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
by: Paul, Kaustav, et al.
Published: (2024)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
by: Palagiri, V. S. R., et al.
Published: (2024)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

The Packing Chromatic Number of the Infinite Square Grid is 15
by: Subercaseaux, Bernardo, et al.
Published: (2023)

Larger Nearly Orthogonal Sets over Finite Fields
by: Haviv, Ishay, et al.
Published: (2024)

Exhaustive Generation of Pattern-Avoiding s-Words
by: Buick, Samuel, et al.
Published: (2025)

On $k$-planar Graphs without Short Cycles
by: Bekos, Michael A., et al.
Published: (2024)

Zero-One Laws for Random Feasibility Problems
by: Altschuler, Dylan J.
Published: (2023)

The Converse of the Real Orthogonal Holant Theorem
by: Young, Ben
Published: (2024)