Related papers: The Excess Zero Graph of a Coxeter Group

Let W be a Weyl group. We define a class of irreducible representations of W that we call antispecial. They are in bijection with the constructible representations of W. We define an oriented graph structure on the set of antispecial…

We show that any split extension of a right-angled Coxeter group $W_{\Gamma}$ by a generating automorphism of finite order acts faithfully and geometrically on a $\mathrm{CAT}(0)$ metric space.

A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…

We study some aspects of noncommutative differential geometry on a finite Weyl group in the sense of S. Woronowicz, K. Bresser {\it et al.}, and S. Majid. For any finite Weyl group $W$ we consider the subalgebra generated by flat…

We define new deformations of group algebras of Coxeter groups W and of subgroups of even elements in them, by deforming the braid relations. We show that these deformations are algebraically flat iff they are formally flat, and that this…

By studying the action of the Weyl group of a simple Lie algebra on its root lattice, we construct torsion free subgroups of small and explicitly determined index in a large infinite class of Coxeter groups. One spin-off is the construction…

This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the…

Let W be an irreducible finitely generated Coxeter group. The geometric representation of W in GL(V) provides a discrete embedding in the orthogonal group of the Tits form (the associated bilinear form of the Coxeter group). If the Tits…

In a 2015 paper we have defined a map from the set of conjugacy classes in a Weyl group W to the set of irreducible representations of W (its image parametrizes the strata of a reductive group with Weyl group W). In this paper we provide…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

Let $G$ be a (finite or infinite) group such that $G/Z(G)$ is not simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with vertices $x$ and $y$ adjacent whenever $[x,y] \ne 1$ and $\langle x, y…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…

The enhanced power graph $\mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…

Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…

Assume that $R$ is a commutative ring with nonzero identity. In this paper, we introduce and investigate zero-annihilator graph of $R$ denoted by $\mathtt{ZA}(R)$. It is the graph whose vertex set is the set of all nonzero nonunit elements…