68 research outputs found
Satisfiability of Circuits and Equations over Finite Malcev Algebras
We show that the satisfiability of circuits over finite Malcev algebra A is NP-complete or A is nilpotent. This strengthens the result from our earlier paper [Idziak and Krzaczkowski, 2018] where nilpotency has been enforced, however with the use of a stronger assumption that no homomorphic image of A has NP-complete circuits satisfiability. Our methods are moreover strong enough to extend our result of [Idziak et al., 2021] from groups to Malcev algebras. Namely we show that tractability of checking if an equation over such an algebra A has a solution enforces its nice structure: A must have a nilpotent congruence ? such that also the quotient algebra A/? is nilpotent. Otherwise, if A has no such congruence ? then the Exponential Time Hypothesis yields a quasipolynomial lower bound. Both our results contain important steps towards a full characterization of finite algebras with tractable circuit satisfiability as well as equation satisfiability
Intermediate problems in modular circuits satisfiability
In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite
algebras had been introduced and applied to sketch P versus NP-complete
borderline for circuits satisfiability over algebras from congruence modular
varieties. However the problem for nilpotent (which had not been shown to be
NP-hard) but not supernilpotent algebras (which had been shown to be polynomial
time) remained open.
In this paper we provide a broad class of examples, lying in this grey area,
and show that, under the Exponential Time Hypothesis and Strong Exponential
Size Hypothesis (saying that Boolean circuits need exponentially many modular
counting gates to produce boolean conjunctions of any arity), satisfiability
over these algebras have intermediate complexity between and , where measures how much a nilpotent algebra
fails to be supernilpotent. We also sketch how these examples could be used as
paradigms to fill the nilpotent versus supernilpotent gap in general.
Our examples are striking in view of the natural strong connections between
circuits satisfiability and Constraint Satisfaction Problem for which the
dichotomy had been shown by Bulatov and Zhuk
Definability of linear equation systems over groups and rings
Motivated by the quest for a logic for PTIME and recent insights that the
descriptive complexity of problems from linear algebra is a crucial aspect of
this problem, we study the solvability of linear equation systems over finite
groups and rings from the viewpoint of logical (inter-)definability. All
problems that we consider are decidable in polynomial time, but not expressible
in fixed-point logic with counting. They also provide natural candidates for a
separation of polynomial time from rank logics, which extend fixed-point logics
by operators for determining the rank of definable matrices and which are
sufficient for solvability problems over fields. Based on the structure theory
of finite rings, we establish logical reductions among various solvability
problems. Our results indicate that all solvability problems for linear
equation systems that separate fixed-point logic with counting from PTIME can
be reduced to solvability over commutative rings. Moreover, we prove closure
properties for classes of queries that reduce to solvability over rings, which
provides normal forms for logics extended with solvability operators. We
conclude by studying the extent to which fixed-point logic with counting can
express problems in linear algebra over finite commutative rings, generalising
known results on the logical definability of linear-algebraic problems over
finite fields
Finite Axiomatisability of Subdirectly Irreducible Members of Certain Nilpotent Varieties
Let be a congruence permutable variety generated by a finite
nilpotent algebra . If is a product of algebras of
prime power order, then the class of subdirectly
irreducible members of can be axiomatised by a finite set of
elementary sentences
Nonstandard analysis, deformation quantization and some logical aspects of (non)commutative algebraic geometry
This paper surveys results related to well-known works of B. Plotkin and V.
Remeslennikov on the edge of algebra, logic and geometry. We start from a brief
review of the paper and motivations. The first sections deal with model theory.
In Section 2.1 we describe the geometric equivalence, the elementary
equivalence, and the isotypicity of algebras. We look at these notions from the
positions of universal algebraic geometry and make emphasis on the cases of the
first order rigidity. In this setting Plotkin's problem on the structure of
automorphisms of (auto)endomorphisms of free objects, and auto-equivalence of
categories is pretty natural and important. Section 2.2 is dedicated to
particular cases of Plotkin's problem. Section 2.3 is devoted to Plotkin's
problem for automorphisms of the group of polynomial symplectomorphisms. This
setting has applications to mathematical physics through the use of model
theory (non-standard analysis) in the studying of homomorphisms between groups
of symplectomorphisms and automorphisms of the Weyl algebra. The last two
sections deal with algorithmic problems for noncommutative and commutative
algebraic geometry. Section 3.1 is devoted to the Gr\"obner basis in
non-commutative situation. Despite the existence of an algorithm for checking
equalities, the zero divisors and nilpotency problems are algorithmically
unsolvable. Section 3.2 is connected with the problem of embedding of algebraic
varieties; a sketch of the proof of its algorithmic undecidability over a field
of characteristic zero is given.Comment: In this review we partially used results of arXiv:1512.06533,
arXiv:math/0512273, arXiv:1812.01883 and arXiv:1606.01566 and put them in a
new contex
- …