Related papers: On graph algebras from interval maps
We study the existence of transitive exchange maps with flips defined on the unit circle. We provide a complete answer to the question of whether there exists a transitive exchange map of the unit circle defined on n subintervals and having…
We establish a correspondence between automorphisms and derivations on certain algebras of generalised power series. In particular, we describe a Lie algebra of derivations on a field $k(\!(G)\!)$ of generalised power series, exploiting our…
Representing networks in a low dimensional latent space is a crucial task with many interesting applications in graph learning problems, such as link prediction and node classification. A widely applied network representation learning…
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
Evolution algebras are non-associative algebras. In this work we provide an extension of this class of algebras, in the context of Hilbert spaces, capable to deal with infinite-dimensional spaces. We illustrate the applicability of our…
We construct families of $k$-step nilpotent symplectic Lie algebras associated with graphs, extending the construction given in [Pouseele-Tirao, JPAA 213 (2009)] for the 2-step case. We also show that, under mild conditions on the…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…
In this article we show that there are branching systems (which induce representations of the graph algebra $C^*(E)$) associated to each row-countable graph $E$. For row-countable graphs, we characterize the condition $(L)$ via branching…
A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…
We show that the Hilbert functor of points on an arbitrary separated algebraic stack is an algebraic space. We also show the algebraicity of the Hilbert stack of points on an algebraic stack and the algebraicity of the Weil restriction of…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Visibility algorithms are a family of geometric and ordering criteria by which a real-valued time series of N data is mapped into a graph of N nodes. This graph has been shown to often inherit in its topology non-trivial properties of the…
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…
In this work we consider some problems about a reflected graph map germ $f$ from $(\mathbb{C}^n,0)$ to $(\mathbb{C}^{n+1},0)$. A reflected graph map is a particular case of a reflection map, which is defined using an embedding of…
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
We consider several algebras that arise in the study of the mapping class group (by means of topology and Hodge theory) and describe their symplectic-invariant parts in terms of algebras on trivalent graphs.
A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
We study certain filtered deformations of the external zonotopal algebra of a given graph parametrized by univariate polynomials. We establish some general properties of these algebras, compute their Hilbert series for a number of graphs…
Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph $G$ can be represented by closed intervals, i.e., whether $G$ is an interval…