Related papers: On graph algebras from interval maps

In this paper we propose a graph superalgebra which is the supersymmetric analogue of Leavitt path algebras. We find a basis for these superalgebras and characterize when they have polynomial growth.

This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…

We introduce the notion of orbit equivalence of directed graphs, following Matsumoto's notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if…

This paper focuses on certain finite dimensional point derivations for the non-selfadjoint operator algebras corresponding to directed graphs. We begin by analyzing the derivations corresponding to full matrix representations of the tensor…

This paper explores the effect of various graphical constructions upon the associated graph $C^*$-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove…

The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a…

Hilbert evolution algebras generalize evolution algebras through a framework of Hilbert spaces. In this work we focus on infinite-dimensional Hilbert evolution algebras and their representation through a suitably defined weighted digraph.…

We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.

We present a novel method that can learn a graph representation from multivariate data. In our representation, each node represents a cluster of data points and each edge represents the subset-superset relationship between clusters, which…

The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry…

Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…

We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.

We study reflexivity and structure properties of operator algebras generated by representations of the discrete Heisenberg semi-group. We show that the left regular representation of this semi-group gives rise to a semi-simple reflexive…

The aim of this work is the description of the isomorphism classes of all Leavitt path algebras coming from graphs satisfying Condition (Sing) with up to three vertices. In particular, this classification recovers the one achieved by Abrams…

In this text I present some problems which led to the introduction of special kinds of graphs as tools for studying singular points of algebraic surfaces. I explain how such graphs were first described using words, and how several…

Temporal graphs represent the dynamic relationships among entities and occur in many real life application like social networks, e commerce, communication, road networks, biological systems, and many more. They necessitate research beyond…

This paper surveys the representation theory of rational Cherednik algebras. We also discuss the representations of the spherical subalgebras. We describe in particular the results on category O. For type A, we explain relations with the…

We give several characterizations of relative homological epimorphisms in the setting of locally convex topological algebras, thereby correcting a gap in our earlier paper [Trans. Moscow Math. Soc. 2008, 27-104].

Given a dynamical system, we study the so-called space of shift functions thus introducing another vision on bifurcations and chaos. As an application of the obtained results, we give a partial solution to an open problem formulated in…

Scaled relative graphs have been originally introduced in the context of convex optimization and have recently gained attention in the control systems community for the graphical analysis of nonlinear systems. Of particular interest in…