Related papers: The algebra of adjacency patterns: Rees matrix sem…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
We reinterpret the Rhodes semilattices $R_n(\mathfrak{G})$ of a group $\mathfrak{G}$ in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-potential pairs and as sets of subgraphs, and for the latter,…
Consider an equidimensional faithful conical action of an algebraic torus $T$ on an affine normal conical variety $X$ over an algebraically closed field of characteristic zero. Then there exists a finite normal subgroup $N$ of $T$ such that…
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…
Associated varieties of vertex algebras are analogue of the associated varieties of primitive ideals of the universal enveloping algebras of semisimple Lie algebras. They not only capture some of the important properties of vertex algebras…
We describe a special class of representations of an inverse semigroup S on Hilbert's space which we term "tight". These representations are supported on a subset of the spectrum of the idempotent semilattice of S, called the "tight…
We introduce locally involutive semigroups and embed them into the category of ordered groupoids. This embedding restricts to a correspondence between quasi-involutive semigroups and ordered groupoids with mediator, extending the classical…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
We characterize the absolute retracts in the category of reflexive oriented graphs, that is, antisymmetric reflexive graphs, where morphisms between objects preserve arcs (which may be sent to loops). Here we show, by correcting a much…
The classical Rees construction (of common use in commutative algebra and Hodge theory) interpolates between filtrations, viewed as ${\mathbb G}_m$-equivariant vector bundles on the affine line, and their associated gradings. Various…
We study Arens regularity of weighted semigroup convolution algebras for the specific case of totally ordered semilattices. This paper is a natural continuation of that of Dales and Strauss (2022) [DS22], where they studied the unweighted…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability…
In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower…
We describe the commuting graph of a Rees matrix semigroup over a group and investigate its properties: diameter, clique number, girth, chromatic number and knit degree. The maximum size of a commutative subsemigroup of a Rees matrix…
In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…
We explore the connections between the linear algebra of symmetric matrices over GF(2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can…