Related papers: Admissibility in Finitely Generated Quasivarieties

In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…

We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…

In this work we study the notions of structural and universal completeness both from the algebraic and logical point of view. In particular, we provide new algebraic characterizations of quasivarieties that are actively and passively…

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

Consider a diagram of quasi-categories that admit and functors that preserve limits or colimits of a fixed shape. We show that any weighted limit whose weight is a projective cofibrant simplicial functor is again a quasi-category admitting…

We show that under certain conditions, well-studied algebraic properties transfer from the class $\mathcal{Q}_{_\text{RFSI}}$ of the relatively finitely subdirectly irreducible members of a quasivariety $\mathcal{Q}$ to the whole…

We prove that quadratical quasigroups form a variety Q of right and left simple groupoids. New examples of quadratical quasigroups of orders 25 and 29 are given. The fine structure of quadratical quasigroups and inter-relationships between…

We investigate two constructive approaches to defining quasi-compact and quasi-separated schemes (qcqs-schemes), namely qcqs-schemes as locally ringed lattices and as functors from rings to sets. We work in Homotopy Type Theory and…

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…

The notion of quasicrossed product is introduced in the setting of G-graded quasialgebras, i.e., algebras endowed with a grading by a group G, satisfying a "quasiassociative" law. The equivalence between quasicrossed products and…

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…

This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier}…

A construction is given for simulating any deterministic finite state machine (FSM) on a quantum computer in a space-efficient manner. By constructing a superposition of input strings of lengths K or less, questions can be asked about the…

Quasiperiodicity is a generalization of periodicity that was introduced in the early 1990s. Since then, dozens of algorithms for computing various types of quasiperiodicity were proposed. Our work is a step towards answering the question:…