Related papers: Admissibility in Finitely Generated Quasivarieties

A quasivariety has the weak ES property when the epimorphisms between its finitely generated members are surjective. A characterization of quasivarieties with the weak ES property is obtained and a method for detecting failures of this…

Approximate Membership Query structures (AMQs) rely on randomisation for time- and space-efficiency, while introducing a possibility of false positive and false negative answers. Correctness proofs of such structures involve subtle…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

A theory of quasi modules at infinity for (weak) quantum vertex algebras including vertex algebras was previously developed in \cite{li-infinity}. In this current paper, quasi modules at infinity for vertex algebras are revisited. Among the…

We show that for a fixed positive integer k one can efficiently decide if a finite algebra A admits a k-ary weak near unanimity operation by looking at the local behavior of the terms of A. We also observe that the problem of deciding if a…

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…

Variational quantum algorithms have been introduced as a promising class of quantum-classical hybrid algorithms that can already be used with the noisy quantum computing hardware available today by employing parameterized quantum circuits.…

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard,…

This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…

Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…

A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A. A consequence of this demand, called…

In this paper we study various forms of (hereditary) structural completeness for quasivarieties of algebras, using mostly algebraic techniques. More specifically we study relative weakly projective algebras and the way they interact with…

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

A $G$-grading on a complex semisimple Lie algebra $L$, where $G$ is a finite abelian group, is called quasi-good if each homogeneous component is 1-dimensional and 0 is not in the support of the grading. Analogous to classical root systems,…

How to design fair and (computationally) efficient voting rules is a central challenge in Computational Social Choice. In this paper, we aim at designing efficient algorithms for computing most equitable rules for large classes of…

Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to…

We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…