Related papers: A categorification of Kauffman states for planar g…

Given a positive function on the set of edges of an arbitrary directed graph $E=(E^0,E^1)$, we define a one-parameter group of automorphisms on the C*-algebra of the graph $C^*(E)$, and study the problem of finding KMS states for this…

We consider operator-algebraic dynamical systems given by actions of the real line on unital $C^*$-algebras, and especially the equilibrium states (or KMS states) of such systems. We are particularly interested in systems built from the…

We consider a finite directed graph E, and the gauge action on its Toeplitz-Cuntz-Krieger algebra, viewed as an action of R. For inverse temperatures larger than a critical value \beta_c, we give an explicit construction of all the…

A qualgebra $G$ is a set having two binary operations that satisfy compatibility conditions which are modeled upon a group under conjugation and multiplication. We develop a homology theory for qualgebras and describe a classifying space…

This paper studies planar algebras of Jones' style associated with the Young graph. We first see that, given a positive real valued function on the Young graph, we may obtain a planar algebra whose structure is defined in terms of a state…

Call two pairs $(M,N)$ and $(M',N')$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=SMT$ and $N'=SNT$. Kronecker \cite{Kronecker} has given a…

Let $G$ be a countable discrete amenable group, and $\Lambda$ be a strongly connected finite $k$-graph. If $(G,\Lambda)$ is a pseudo free and locally faithful self-similar action which satisfies the finite-state condition, then the…

Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…

Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…

In this paper we study spectra of Laplacians of infinite weighted graphs. Instead of the assumption of local finiteness we impose the condition of summability of the weight function. Such graphs correspond to reversible Markov chains with…

We define and investigate algebraic torus actions on quiver Grassmannians for nilpotent representations of the equioriented cycle. Examples of such varieties are type $\tt A$ flag varieties, their linear degenerations, finite dimensional…

We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph…

We define "BPS graphs" on punctured Riemann surfaces associated with $A_{N-1}$ theories of class $\mathcal{S}$. BPS graphs provide a bridge between two powerful frameworks for studying the spectrum of BPS states: spectral networks and BPS…

Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's…

We consider 4d supersymmetric (special) unitary $\Gamma$ quiver gauge theories on compact manifolds which are $T^2$ fibrations over $S^2$. We show that their partition functions are correlators of vertex operators and screening charges of…

For a finite, strongly connected $k$-graph $\Lambda$, an Huef, Laca, Raeburn and Sims studied the KMS states associated to the preferred dynamics of the $k$-graph $C^*$-algebra $C^*(\Lambda)$. They found that these KMS states are determined…

For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…

In a recent paper Jones introduced a correspondence between elements of the Thompson group $F$ and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…

To each quadratic number field $K$ and each quadratic polynomial $f$ with $K$-coefficients, one can associate a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, and whose edges reflect the…