Related papers: Q-systems, Heaps, Paths and Cluster Positivity
We constrain the internal dynamics of a stack of 10 clusters from the GCLASS survey at 0.87<z<1.34. We determine the stack cluster mass profile M(r) using the MAMPOSSt algorithm of Mamon et al., the velocity anisotropy profile beta(r) from…
We study mapping properties of operators with kernels defined via a combination of continuous and discrete orthogonal polynomials, which provide an abstract formulation of quantum (q-) Fourier type systems. We prove Ismail conjecture…
We demonstrate theoretically a scheme for cluster state generation, based on atomic ensembles and the dipole blockade mechanism. In the protocol, atomic ensembles serve as single qubit systems. Therefore, we review single-qubit operations…
Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the…
We first discuss a framework for discrete quantum processes (DQP). It is shown that the set of q-probability operators is convex and its set of extreme elements is found. The property of consistency for a DQP is studied and the quadratic…
We present a new computation of the critical value of the random-cluster model with cluster weight $q\ge 1$ on $\mathbb{Z}^2$. This provides an alternative approach to the result of Beffara and Duminil-Copin. We believe that this approach…
In AdS/CFT partition functions of decoupled copies of the CFT factorize. In bulk computations of such quantities contributions from spacetime wormholes which link separate asymptotic boundaries threaten to spoil this property, leading to a…
A new cluster analysis method, $K$-quantiles clustering, is introduced. $K$-quantiles clustering can be computed by a simple greedy algorithm in the style of the classical Lloyd's algorithm for $K$-means. It can be applied to large and…
We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with…
Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies…
Let $Q$ be a finite acyclic valued quiver. We define a bialgebra structure and an integration map on the Hall algebra associated to the morphism category of projective representations of $Q$. As an application, we recover the surjective…
Our goal in this paper is to construct optimal topological generators for compact unitary Lie groups, extending the work of a letter of Sarnak and arXiv:1704.02106 on golden and super-golden gates to higher dimensions. To do so we consider…
We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…
We present a new scheme for cluster states generation based on atomic ensembles and the dipole blockade mechanism. The protocol requires identical single photon sources, one ensemble per physical qubit, and regular photodetectors. The…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
This paper constructs relativistic quantum mechanical models of particles satisfying cluster properties and the spectral condition which do not conserve particle number. The treatment of particle production is limited to systems with a…
Cluster ensemble is a pair of positive spaces (X, A) related by a map p: A -> X. It generalizes cluster algebras of Fomin and Zelevinsky, which are related to the A-space. We develope general properties of cluster ensembles, including its…
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…
In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting…
For a fixed seed $(X, Q)$, a \emph{rooted mutation loop} is a sequence of mutations that preserves $(X, Q)$. The group generated by all rooted mutation loops is called \emph{rooted mutation group} and will be denoted by $\mathcal{M}(Q)$.…