Related papers: On graph algebras from interval maps
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
Every representation of the Cuntz algebra $\mathcal{O}_n$ leads to a unitary representation of the Higman-Thompson group $V_n$. We consider the family $\{\pi_x\}_{x\in [0,1[}$ of permutative representations of $\mathcal{O}_n$ that arise…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…
The survey is devoted to algebraic structures related to integrable ODEs and evolution PDEs. A description of Lax representations is given in terms of vector space decomposition of loop algebras into a direct sum of Taylor series and a…
New identities on traces of representations of the Hecke algebra on the spaces of paths on graphs are presented. These identities are relevant in the computation of partition functions with fixed boundary conditions and of two-point…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
Isomorphisms of separable Hilbert spaces are analogous to isomorphisms of n-dimensional vector spaces. However, while n-dimensional spaces in applications are always realized as the Euclidean space R^n, Hilbert spaces admit various useful…
Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…
We show that every point $x_0\in [0,1]$ carries a representation of a $C^*$-algebra that encodes the orbit structure of the linear mod 1 interval map $f_{\beta,\alpha}(x)=\beta x +\alpha$. Such $C^*$-algebra is generated by partial…
The recollement approach to the representation theory of sequences of algebras is extended to pass basis information directly through the globalisation functor. The method is hence adapted to treat sequences that are not necessarily towers…
An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations…
The study of escape rates for a ball in a dynamical systems has been much studied. Understanding the asymptotic behavior of the escape rate as the radius of the ball tends to zero is an especially subtle problem. In the case of hyperbolic…
Circular-arc graphs are graphs that can be represented as intersection graphs of subpaths of a cycle. Interval graphs are graphs that can be represented as intersection graphs of subpaths of a path. Since cycles are locally paths, every…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…
We construct finite-dimensional projective representations of the mapping class groups of compact connected oriented surfaces having one boundary component using stated skein algebras.