Related papers: Q-system Cluster Algebras, Paths and Total Positiv…
In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…
Investment returns naturally reside on irregular domains, however, standard multivariate portfolio optimization methods are agnostic to data structure. To this end, we investigate ways for domain knowledge to be conveniently incorporated…
The Qth-power algorithm for computing structured global presentations of integral closures of affine domains over finite fields is modified to compute structured presentations of integral closures of ideals in affine domains over finite…
Probability maps are additive and normalised maps taking values in the unit interval of a lattice ordered Abelian group. They appear in theory of affine representations and they are also a semantic counterpart of Hajek's probability logic.…
We develop a technique to formulate quantum field theory on arbitrary network, based on different, randomly disposed sets of scattering's. We define R-matrix of the whole network as a product of R-matrices attached to each of scattering…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
$Q$-systems and $T$-systems are systems of integrable difference equations that have recently attracted much attention, and have wide applications in representation theory and statistical mechanics. We show that certain $\tau$-functions,…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
The generalized cluster complex was introduced by Fomin and Reading, as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex we associate a…
We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…
We show how to construct path integrals for quantum mechanical systems where the space of configurations is a general non-compact symmetric space. Associated with this path integral is a perturbation theory which respects the global…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
We generalize Fomin and Zelevinsky's cluster algebras by allowing exchange polynomials to be arbitrary irreducible polynomials, rather than binomials.
LP algebras, introduced by Lam and Pylyavskyy, are a generalization of cluster algebras. These algebras are known to have the Laurent phenomenon, but positivity remains conjectural. Graph LP algebras are finite LP algebras encoded by a…
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain---that is, a path on $n$ vertices. Unweighted paths are of limited use, and so a natural generalization is to consider weighted paths;…
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite graph represents an operational quantum system for performing useful quantum information tasks. In contrast, the infinite paths represent…
Pendry and MacKinnon meaningful discretization of Maxwell's equations was put forward specifically as part of a finite-element numerical algorithm. By contrast with a numerical approach, in the same spirit evoked by the relationships…
We extend the theory of decomposable maps by giving a detailed description of k-positive maps. A relation between transposition and modular theory is established. The structure of positive maps in terms of modular theory (the generalized…
Q-systems first appeared in the analysis of the Bethe equations for the XXX-model and generalized Heisenberg spin chains. Such systems are known to exist for any simple Lie algebra and many other Kac-Moody algebras. We formulate the…