Related papers: Quantum dilogarithm identities for n-cycle quivers
We show that the path algebra of a quiver satisfies the same polynomial identities of an algebra of matrices, if any. In particular, the algebra of nxn matrices is PI-equivalent to the path algebra of the oriented cycle with n vertices.
Maximal green sequences are particular sequences of mutations of quivers which were introduced by Keller in the context of quantum dilogarithm identities and independently by Cecotti-C\'ordova-Vafa in the context of supersymmetric gauge…
Let $Q$ be a finite acyclic valued quiver. We give the cluster multiplication formulas in the quantum cluster algebra of $Q$ with arbitrary coefficients, by applying certain quotients of derived Hall subalgebras of $Q$. These formulas can…
Maximal green sequences appear in the study of Fomin-Zelevinsky's cluster algebras. They are useful for computing refined Donaldson-Thomas invariants, constructing twist automorphisms and proving the existence of theta bases and generic…
We equip the categorified quantum group attached to a KLR algebra and an arbitrary choice of scalars with duality functor which is cyclic, that is, such that f=f^** for all 2-morphisms f. This is accomplished via a modified diagrammatic…
A quiver mutation loop is a sequence of mutations and vertex relabelings, along which a quiver transforms back to the original form. For a given mutation loop, we introduce a quantity called a partition q-series. The partition q-series are…
Motivated by the counting of BPS states in string theory with orientifolds, we study moduli spaces of self-dual representations of a quiver with contravariant involution. We develop Hall module techniques to compute the number of points…
We show how certain suitably modified N-modular diagrams of integer partitions provide a nice combinatorial interpretation for the general term of Zeilberger's KOH identity. This identity is the reformulation of O'Hara's famous proof of the…
We prove a multiplication theorem of a quantum Caldero-Chapoton map associated to valued quivers which extends the results in \cite{DX}\cite{D}. As an application, when $Q$ is a valued quiver of finite type or rank 2, we obtain that the…
We study unital quantum channels which are obtained via partial trace of a $*$-automorphism of a finite unital matrix $*$-algebra. We prove that any such channel, $q$, on a unital matrix $*$-algebra, $\mathcal{A}$, admits a finite matrix…
We prove several infinite families of $q$-series identities for false theta functions and related series. These identities are motivated by considerations of characters of modules of vertex operator superalgebras and of quantum…
We develop an intrinsic enumerator framework for quantum error correction in unitary representations of symmetry groups. An intrinsic quantum code is a subspace of a representation $V$ of a group $G$, and errors are organized by the…
The quantum modular invariant of a real number is defined as a discontinuous, PGL(2,Z)-invariant multi-valued map using the distance-to-the-nearest-integer function. On the rationals, the quantum modular invariant is shown to be infinity…
It is known that the existence of a maximal green sequence for a quiver associated to surfaces is equivalent to the equality of the cluster algebra and upper cluster algebra generated by the quiver. This paper makes the first steps in…
Determining the properties of molecules and materials is one of the premier applications of quantum computing. A major question in the field is: how might we use imperfect near-term quantum computers to solve problems of practical value? We…
We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…
We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x.…
We prove a universal limit theorem for the halting time, or iteration count, of the power/inverse power methods and the QR eigenvalue algorithm. Specifically, we analyze the required number of iterations to compute extreme eigenvalues of…
As a particular one parameter deformation of the quantum determinant, we introduce a quantum $\alpha$-determinant and study the $\mathcal{U}_q(\mathfrak{gl}_n)$-cyclic module generated by it: We show that the multiplicity of each…
In general, the existence of a maximal green sequence is not mutation invariant. In this paper we show that it is in fact mutation invariant for cluster quivers of finite mutation type. In particular, we show that a mutation finite cluster…