Related papers: Graphs of Commutatively Closed Sets
Here we announce the construction and properties of a big commutative subalgebra of the Kirillov algebra, called big algebra, attached to a finite dimensional irreducible representation of a complex semisimple Lie group. They are…
We study topological group theoretic properties of algebraic groups over local fields. In particular, we find conditions under which such groups have closed images under arbitrary continuous homomorphisms into arbitrary topological groups.
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…
Let $R$ and $S$ be commutative rings with identity, $f:R\to S$ a ring homomorphism and $J$ an ideal of $S$. Then the subring $R\bowtie^fJ:=\{(r,f(r)+j)\mid r\in R$ and $j\in J\}$ of $R\times S$ is called the amalgamation of $R$ with $S$…
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.
Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…
The maximal dimension of a commutative subalgebra of the Grassmann algebra is determined. It is shown that for any commutative subalgebra there exists a commutative subalgebra which is spanned by monomials and has the same dimension. It…
In this paper, we study commutative weakly distance-regular digraphs whose attached association schemes are regular, and give a characterization of mixed arcs. As an application, we classify such digraphs of diameter 2.
We have previously proposed a study of arrangements of small circles which also surround regions in the plane realized as the images of natural real algebraic maps yielding Morse-Bott functions by projections. Among studies of arrangements,…
For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…
The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
In this paper we study associative algebras with a Poisson algebra structure on the center acting by derivations on the rest of the algebra. These structures, which we call Poisson fibred algebras, appear in the study of quantum groups at…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…
We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…
This article investigates the concept of dominant metric dimensions in zero divisor graphs (ZD-graphs) associated with rings. Consider a finite commutative ring with unity, denoted as R, where nonzero elements x and y are identified as zero…
In this paper we study a construction of algebraic curves from combinatorial data. In the study of algebraic curves through degeneration, graphs usually appear as the dual intersection graph of the central fiber. Properties of such graphs…