相关论文: Incremental SAT-Based Enumeration of Solutions to …

In this paper we introduce a procedure that, given a solution to the Yang-Baxter equation as input, produces a stochastic (or Markovian) solution to (a possibly dynamical version of) the Yang-Baxter equation. We then apply this…

This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing…

We study all five-, six-, and one eight-vertex type two-state solutions of the Yang-Baxter equations in the form $A_{12} B_{13} C_{23} = C_{23} B_{13} A_{12}$, and analyze the interplay of the `gauge' and `inversion' symmetries of these…

Using a rational R-matrix associated with the 4 x 4 defining matrix representation of c_2=sp(4), the Lie algebra of Sp(4), a one-site operator solution of the associated Yang-Baxter algebra acting in the Fock space of two harmonic…

A variety of Yang-Baxter maps are obtained from integrable multi-field equations on quad-graphs. A systematic framework for investigating this connection relies on the symmetry groups of the equations. The method is applied to lattice…

In this paper, we address the problem of enumerating all models of a Boolean formula in conjunctive normal form (CNF). We propose an extension of CDCL-based SAT solvers to deal with this fundamental problem. Then, we provide an experimental…

The representation theory of the Drinfeld doubles of dihedral groups is used to solve the Yang-Baxter equation. Use of the 2-dimensional representations recovers the six-vertex model solution. Solutions in arbitrary dimensions, which are…

Symmetry breaking is a popular technique to reduce the search space for SAT solving by exploiting the underlying symmetry over variables and clauses in a formula. The key idea is to first identify sets of assignments which fall in the same…

The new method of solving quantum mechanical problems is proposed. The finite, i.e. cut off, Hilbert space is algebraically implemented in the computer code with states represented by lists of variable length. Complete numerical solution of…

We consider finite-dimensional reductions of an integral operator with the elliptic hypergeometric kernel describing the most general known solution of the Yang-Baxter equation with a rank 1 symmetry algebra. The reduced R-operators…

The Gauge/YBE correspondence states a surprising connection between solutions to the Yang-Baxter equation with spectral parameters and partition functions of supersymmetric quiver gauge theories. This correspondence has lead to systematic…

In the first part, we focus on indecomposable involutive solutions of the Yang-Baxter equation whose permutation group forces them to be uniconnected. Indecomposable involutive solutions with a permutation group isomorphic to a dihedral…

On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to declaratively…

We find new solutions to the Yang-Baxter equations with the $R$-matrices possessing $sl_q(2)$ symmetry at roots of unity, using indecomposable representations. The corresponding quantum one-dimensional chain models, which can be treated as…

Depth-3 circuit lower bounds and $k$-SAT algorithms are intimately related; the state-of-the-art $\Sigma^k_3$-circuit lower bound and the $k$-SAT algorithm are based on the same combinatorial theorem. In this paper we define a problem which…

An augmented rack is a set with a self-distributive binary operation induced by a group action, and has been extensively used in knot theory. Solutions to the Yang-Baxter equation (YBE) have been also used for knots, since the discovery of…

We develop a method to construct all the indecomposable involutive set-theoretic solutions of the Yang-Baxter equation with a prime-power number of elements and cyclic permutation group. Moreover, we give a complete classification of the…

The subset sum problem, also referred as SSP, is a NP-Hard computational problem. SSP has its applications in broad domains like cryptography, number theory, operation research and complexity theory. The most famous algorithm for solving…

Satisfiability (SAT) is a central problem in computer science, and advances in SAT-solving algorithms have a far-reaching impact across many fields. Recent works have proposed quantum SAT solvers based on Grover's algorithm, a quantum…

In this paper, we provide techniques to obtain left non-degenerate set-theoretic solutions of the Yang-Baxter equation, drawing on the class of right groups. To this end, we introduce the new algebraic structures of left $RG$-semibraces,…