Related papers: Every quantum minor generates an Ore set
This paper defines the concept of an oriented quantum algebra and develops its application to the construction of quantum link invariants. We show that all known quantum link invariants can be put into this framework.
For any algebra two families of coloured Yang-Baxter operators are constructed, thus producing solutions to the two-parameter quantum Yang-Baxter equation. An open problem about a system of functional equations is stated. The matrix forms…
In a scenario where two parties share, act on and exchange some physical resource, the assumption that the parties' actions are ordered according to a definite causal structure yields constraints on the possible correlations that can be…
Using a suitably noncommutative flat matrix model, it is shown that the quantum permutation group has free orbitals: that is, a monomial in the generators of the algebra of functions can be zero for trivial reasons only. It is shown that…
Consider an algebraically closed field k and the Cremona group of all birational transformations of the projective plane over k. We characterize infinite order elements of this group having a non-zero power generating a proper normal…
A subsemigroup $S$ of an inverse semigroup $Q$ is a left I-order in $Q$ if every element in $Q$ can be written as $a^{-1}b$ where $a,b \in S$ and $a^{-1}$ is the inverse of $a$ in the sense of inverse semigroup theory. If we insist on $a$…
Quantum coherence quantifies the amount of superposition in a quantum system, and is the reason and resource behind several phenomena and technologies. It depends on the natural basis in which the quantum state of the system is expressed,…
In resisting attempts to explain the unity of a whole in terms of a multiplicity of interacting parts, quantum mechanics calls for an explanatory concept that proceeds in the opposite direction: from unity to multiplicity. It concerns the…
We describe a quantum Lie algebra based on the Cremmer-Gervais R-matrix. The algebra arises upon a restriction of an infinite-dimensional quantum Lie algebra.
The set equality problem is to decide whether two sets $A$ and $B$ are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set quality…
Let $\mathcal{A}_{q}$ be an arbitrary quantum cluster algebra with principal coefficients. We give the fundamental relations between the quantum cluster variables arising from one-step mutations from the initial cluster in…
We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term…
The "quantum duality principle" states that the quantization of a Lie bialgebra - via a quantum universal enveloping algebra (QUEA) - provides also a quantization of the dual Lie bialgebra (through its associated formal Poisson group) - via…
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…
Assigning U(1) charges to the quarks of the standard model, and allowing one extra scalar doublet with m^2 > 0, the correct pattern of the up and down quark mass matrices is obtained, together with their charged-current mixing matrix.
A minimal system of homogeneous generating elements of the algebra of covariants for the binary form of degree 8 is calculated.
By introducing a result that guarantees a given bialgebra to be a Hopf algebra under a natural condition, we show that the quantum automorphism group of the algebra k[x] of polynomials over a field k (of any characteristic) is the universal…
The present paper deals with the possibility of creation of the quantum computer in which the role of q-bits is played by quasi-particles. In such a computer, the elementary computation block should represent a cluster created on the basis…
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…
A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…