Related papers: Partly Free Algebras from Directed Graphs
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…
To an arbitrary directed graph we associate a row-finite directed graph whose C*-algebra contains the C*-algebra of the original graph as a full corner. This allows us to generalize results for C*-algebras of row-finite graphs to…
We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…
In this paper, we introduce the notion of bigraft algebra, generalizing the notions of left and right graft algebras. We give a combinatorial description of the free bigraft algebra generated by one generator and we endow this algebra with…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
We introduce two classes of algebras coming from partial triangulations of marked surfaces. The first one, called frozen algebra of a partial triangulation, is generally of infinite rank and contains frozen Jacobian algebras of…
To every $C^*$ correspondence over a $C^*$-algebra one can associate a Cuntz-Pimsner algebra generalizing crossed product constructions, graph $C^*$-algebras, and a host of other classes of operator algebras. Cuntz-Pimsner algebras come…
We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
In this paper, we construct, for a certain class of semigroup dynamical systems, two operator algebras that are universal with respect to their corresponding covariance conditions: one being self-adjoint, and another being non-self-adjoint.…
In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to…
In this paper we associate to a qurve A (formerly known as a quasi-free or formally smooth algebra) the one-quiver Q(A) and dimension vector a(A). This pair contains enough information to reconstruct for all natural numbers n the…
A structure of a left-symmetric algebra on the set of all derivations of a free algebra is introduced such that its commutator algebra becomes the usual Lie algebra of derivations. Left and right nilpotent elements of left-symmetric…
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
Last years a number of papers were devoted to describing automorphisms of semigroups of endomorphisms of free finitely generated universal algebras of some varieties: groups, semigroups, associative commutative algebras, inverse semigroups,…
In this paper, we observe the amalgamated free product structure of a Graph W*-probability space. In [16] and [17], we already observed the operator-valued freeness conditions on a graph W*-algebra. By using the conditions, we will consider…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
We prove the following result: If $G$ be a connected graph on $n \ge 6$ vertices, then there exists a set of vertices $D$ with $|D| \le \frac{n}{3}$ and such that $V(G) \setminus N[D]$ is an independent set, where $N[D]$ is the closed…
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
In this paper we discuss graph inverse semigroups which are constucted from a directed graphs and study several interesting properties of graph inverse semigroups such as the nature of its idempotents, the structure of semilattice of…