Related papers: Circuit equivalence in 2-nilpotent algebras

Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

In this work, we propose a class of equational theories for bounded binary circuits that have the finite variant property. These theories could serve as a building block to specify cryptographic primitive implementations and automatically…

Nilpotent Leibniz algebras with isomorphic maximal subalgebras are considered. The algebras are classified for coclass zero, one, and two. The results are field dependent.

We prove that an abelian category equipped with an ample sequence of objects is equivalent to the quotient of the category of coherent modules over the corresponding algebra by the subcategory of finite-dimensional modules. In the…

To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…

We give a geometric classification of $n$-dimensional nilpotent, commutative nilpotent and anticommutative nilpotent algebras. We prove that the corresponding geometric varieties are irreducible, find their dimensions and describe explicit…

We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…

We survey recent progress in the proof complexity of strong proof systems and its connection to algebraic circuit complexity, showing how the synergy between the two gives rise to new approaches to fundamental open questions, solutions to…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

In this work we explore a correspondence between quantum circuits and low-degree polynomials over the finite field F_2. Any quantum circuit made up of Hadamard, Z, controlled-Z and controlled-controlled-Z gates gives rise to a degree-3…

We investigate a connection between solvability of the Dirichlet problem for an infinitely degenerate elliptic operator and the validity of an Orlicz-Sobolev inequality in the associated subunit metric space. For subelliptic operators it is…

We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. Actually, the observations show there are two resources to get classification of filiform Leibniz algebras. The first of them…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…