Improved bounds on the size of the smallest representation of relation algebra 32_65 with the aid of a SAT solver

11/02/2019

∙

In this paper, we shed new light on the spectrum of relation algebra 32_65. We show that 1024 is in the spectrum, and no number smaller than 20 is in the spectrum. In addition, we derive upper and lower bounds on the smallest member of the spectra of an infinite class of algebras derived from 32_65 via splitting.

READ FULL TEXT

Improved bounds on the size of the smallest representation of relation algebra 32_65 with the aid of a SAT solver

The smallest grammar problem revisited

Bounds for the smallest k-chromatic graphs of given girth

Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations

On k-abelian Equivalence and Generalized Lagrange Spectra

Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

Analogical proportions in monounary algebras and difference proportions

Improved bounds on the size of the smallest representation of relation algebra 32_65 with the aid of a SAT solver

Related Research

The smallest grammar problem revisited

Bounds for the smallest k-chromatic graphs of given girth

Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations

On k-abelian Equivalence and Generalized Lagrange Spectra

Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

Analogical proportions in monounary algebras and difference proportions