Related papers: Balanced incomplete block designs and exact satisf…
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP-complete problem, with the help of machine learning techniques. Despite the great success of modern SAT solvers to solve large…
We construct rational models for classifying spaces of self-equivalences of bundles over simply connected finite CW-complexes relative to a given simply connected subcomplex. Via work of Berglund-Madsen and Krannich this specializes to…
We present solutions to the matrix completion problems proposed by the Alignment Research Center that have a polynomial dependence on the precision $\varepsilon$. The motivation for these problems is to enable efficient computation of…
We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…
For SCFTs with an $SU(2)$ R-symmetry, we determine the superconformal blocks that contribute to the four-point correlation function of a priori distinct half-BPS superconformal primaries as an expansion in terms of the relevant bosonic…
We study half-BPS line defects in $\mathcal{N}=2$ superconformal theories using the bootstrap approach. We concentrate on local excitations constrained to the defect, which means the system is a $1d$ defect CFT with $\mathfrak{osp}(4^*|2)$…
An active topic in the study of random constraint satisfaction problems (CSPs) is the geometry of the space of satisfying or almost satisfying assignments as the function of the density, for which a precise landscape of predictions has been…
This paper focuses on the analysis of $4d$ $\mathcal{N}=4$ superconformal theories in the presence of a defect from the point of view of the conformal bootstrap. We will concentrate first on the case of codimension one, where the defect is…
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
A balanced incomplete block design is a set system in which all pairs of distinct elements occur with a constant frequency. By contrast, a Sarvate-Beam design induces an interval of distinct frequencies on pairs. In this paper, we settle…
The 3-Satisfiability Problem (3-SAT) is a demanding combinatorial problem, of central importance among the non-deterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence and logistics. Even…
We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and…
A Pseudo-Boolean (PB) constraint is a linear arithmetic constraint over Boolean variables. PB constraints are convenient and widely used in expressing NP-complete problems. We introduce a new, two step, method for transforming PB…
Although the AdS/CFT correspondence is rigorous only for an infinite $N \to \infty$ stack of D3-branes, it can be fruitfully studied for finite $N$ as a source of gauge structures and choices for chiral fermions and complex scalars which…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
Biadjoint scalar theories are novel field theories that arise in the study of non-abelian gauge and gravity amplitudes. In this short paper, we present exact nonperturbative solutions of the field equations, and compare their properties…
The purpose of this note is to attach a name to a natural class of combinatorial problems and to point out that this class includes many important special cases. We also show that a simple problem of placing nonoverlapping labels on a…
We study $\ell$-colourings of $(v,k,\lambda)$-BIBDs (balanced incomplete block designs) where, within each block, one colour is absent and each of the $\ell-1$ other colours appears exactly $\frac{k}{\ell-1}$ times. We establish several…
Augmented block designs for unreplicated test treatments are investigated under the A- and MV-criteria with respect to control versus control, test versus test and control versus test comparisons. We derive design-independent lower bounds…
We refine the formulation of the Boolean satisfiability problem with $n$ Boolean variables in Clifford algebra ${\cal C}\ell(\mathbb{R}^{n,n})$ [3] and exploit this continuous setting to outline a new unsatisfiability test. This algorithm…