Related papers: Admissibility in Finitely Generated Quasivarieties
Quantifier elimination (QE) and Craig interpolation (CI) are central to various state-of-the-art automated approaches to hardware and software verification. They are rooted in the Boolean setting and are successful for, e.g., first-order…
Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since Q may…
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
As quantum algorithms and hardware continue to evolve, ensuring the correctness of the quantum software stack (QSS) has become increasingly important. However, testing QSSes remains challenging due to the oracle problem, i.e., the lack of a…
Quasi-probabilities appear across diverse areas of physics, but their conceptual foundations remain unclear: they are often treated merely as computational tools, and operations like conditioning and Bayes' theorem become ambiguous. We…
The problem of construction of irreducible representations of quantum $A^q_n$ algebras is solved at the level of explicit integration of the linear (inhomogeneous) system in finite differences in the n-dimensional space. The general…
We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…
In the previous article a new combinatorial and thus purely algebraical approach to quantum gravity, called Algebraic Quantum Gravity (AQG), was introduced. In the framework of AQG existing semiclassical tools can be applied to operators…
A mixed quasi-\'etale quotient is the quotient of the product of a curve of genus at least 2 with itself by the action of a group which exchanges the two factors and acts freely out of a finite subset. A mixed quasi-\'etale surface is the…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
The aim of this paper is to present a streamlined and fully three-dimensional version of the quasicontinuum (QC) theory of Tadmor et al. and to analyze its accuracy and convergence characteristics. Specifically, we assess the effect of the…
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for…
We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the…
We give a rational form of a generic two-dimensional "quad" map, containing the so-called $Q_4$ case, but whose coefficients are free. Its integrability is proved using the calculation of algebraic entropy.
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
We prove that in the varieties where every compact congruence is a factor congruence and every nontrivial algebra contains a minimal subalgebra, a finitely presented algebra is projective if and only if it has every minimal algebra as its…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
We prove the following. Let $R$ be a Noetherian ring, $B$ a finitely generated $R$-algebra, and $A$ a pure $R$-subalgebra of $B$. Then $A$ is finitely generated over $R$.
We consider associative algebras with involution graded by a finite abelian group G over a field of characteristic zero. Suppose that the involution is compatible with the grading. We represent conditions permitting PI-representability of…