English
Related papers

Related papers: CSP for binary conservative relational structures

200 papers

Various structural properties of the space of symmetry breaking boundary conditions that preserve an orbifold subalgebra are established. To each such boundary condition we associate its automorphism type. It is shown that correlation…

High Energy Physics - Theory · Physics 2009-10-31 J. Fuchs , C. Schweigert

We consider the four dimensional scale invariant N=2 SU quiver gauge theories with USp(2N) ends or SU(2N) ends with antisymmetric matter representations. We argue that these theories are realized as six dimensional A_{2N-1} (0,2) theories…

High Energy Physics - Theory · Physics 2009-09-28 Dimitri Nanopoulos , Dan Xie

Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…

Logic · Mathematics 2023-01-09 Andrew Lewis-Smith Jaš Šemrl

We propose a generalization of non-commutative geometry and gauge theories based on ternary Z_3-graded structures. In the new algebraic structures we define, we leave all products of two entities free, imposing relations on ternary products…

High Energy Physics - Theory · Physics 2009-10-30 Viktor Abramov , Richard Kerner , Bertrand Le Roy

We give a complexity dichotomy theorem for the counting Constraint Satisfaction Problem (#CSP in short) with complex weights. To this end, we give three conditions for its tractability. Let F be any finite set of complex-valued functions,…

Computational Complexity · Computer Science 2015-03-19 Jin-Yi Cai , Xi Chen

We study the group of polynomial automorphisms of $\mathbb{C}^3$ (resp. birational self-maps of $\mathbb{P}^3_\mathbb{C}$) that preserve the contact structure.

Algebraic Geometry · Mathematics 2018-05-23 Dominique Cerveau , Julie Déserti

Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…

Logic in Computer Science · Computer Science 2020-03-31 Michał R. Przybyłek

The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of…

Computational Complexity · Computer Science 2009-02-10 Andrei A. Bulatov , Victor Dalmau , Martin Grohe , Daniel Marx

An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\Lambda} is tractable…

Computational Complexity · Computer Science 2015-01-08 Jonah Brown-Cohen , Prasad Raghavendra

A semi-Peano algebra is an algebra for which each operation is injective, and the images of the operations are pairwise disjoint. The most straightforward non-trivial kind of finitely presented semi-Peano algebra are algebras with a single…

Rings and Algebras · Mathematics 2023-06-23 Carles Cardó

We obtain a combinatorial formula related to the shear transformation for semi-invariants of binary forms, which implies the classical characterization of semi-invariants in terms of a differential operator. Then, we present a combinatorial…

Combinatorics · Mathematics 2021-09-15 William Y. C. Chen , Ivy D. D. Jia

We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…

Quantum Algebra · Mathematics 2009-07-02 Michihisa Wakui

A unital $C^*$-algebra is called $N$-subhomogeneous if its irreducible representations are finite dimensional with dimension at most $N$. We extend this notion to operator systems, replacing irreducible representations by boundary…

Operator Algebras · Mathematics 2023-02-10 Ran Kiri

The class of linearly ordered sets with one order preserving unary operation has the Strong Amalgamation Property (SAP). The class of linearly ordered sets with one strict order preserving unary operation has AP but not SAP. The class of…

Logic · Mathematics 2021-08-10 Paolo Lipparini

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

Discrete Mathematics · Computer Science 2015-03-19 Zoltan Esik

We introduce a non-symmetric operad $\mathcal{N}$, whose dimension in degree $n$ is given by the Catalan number $c_{n-1}$. It arises naturally in the study of coalgebra structures defined on compatible associative algebras. We prove that…

Rings and Algebras · Mathematics 2017-11-15 Sebastián Márquez

We prove that in a compact manifold of dimension $n\geq 2$, a $C^{1+\alpha}$ volume-preserving diffeomorphisms that are robustly transitive in the $C^1$-topology have a dominated splitting. Also we prove that for 3-dimensional compact…

Dynamical Systems · Mathematics 2008-10-02 Alexander Arbieto , Carlos Matheus

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa

For $p\in [1,\infty)$, we show that every unital $L^p$-operator algebra contains a unique maximal $C^*$-subalgebra, which is always abelian if $p\neq 2$. Using this, we canonically associate to every unital $L^p$-operator algebra $A$ an…

Operator Algebras · Mathematics 2024-09-06 Yemon Choi , Eusebio Gardella , Hannes Thiel

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Logic · Mathematics 2024-06-07 Miloš S. Kurilić