Related papers: Admissibility in Finitely Generated Quasivarieties
We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…
Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…
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…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
Relational quantum queries are sometimes capable to effectively decide between collections of mutually exclusive elementary cases without completely resolving and determining those individual instances. Thereby the set of mutually exclusive…
For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…
It is argued that a fuzzy version of 4-truth-valued paraconsistent logic (with truth values corresponding to True, False, Both and Neither) can be approximately isomorphically mapped into the complex-number algebra of quantum probabilities.…
We present CertiQ, a verification framework for writing and verifying compiler passes of Qiskit, the most widely-used quantum compiler. To our knowledge, CertiQ is the first effort enabling the verification of real-world quantum compiler…
We show how any finite-dimensional algebra can be realized as an idempotent subquotient of some symmetric quasi-hereditary algebra. In the special case of rigid symmetric algebras we show that they can be realized as centralizer subalgebras…
Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…
We present a new algorithm for constructing a Chevalley basis for any Chevalley Lie algebra over a finite field. This is a necessary component for some constructive recognition algorithms of exceptional quasisimple groups of Lie type. When…
We investigate the conditions under which systems of two differential eigenvalue equations are quasi exactly solvable. These systems reveal a rich set of algebraic structures. Some of them are explicitely described. An exemple of quasi…
We aim to explore if inside a quantum vertex algebras, we can find the right notion of a quantum conformal algebra.
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We prove that a variety of algebras whose finitely generated members are free must be definitionally equivalent to the variety of sets, the variety of pointed sets, a variety of vector spaces over a division ring, or a variety of affine…
It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…
We give a method of constructing maps between tubular groups inductively according to a set of strategies. This map will be a quasi-isometry exactly when the set of strategies is consistent. Conversely, if there exists a quasi-isometry…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…