Related papers: Virtually fibering random right-angled Coxeter gro…

The type C_n full root polytope is the convex hull in R^n of the origin and the points e_i-e_j, e_i+e_j, 2e_k for 1 <= i < j <= n, k \in [n]. Given a graph G, with edges labeled positive or negative, associate to each edge e of G a vector…

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

To a large class of graphs of groups we associate a C*-algebra universal for generators and relations. We show that this C*-algebra is stably isomorphic to the crossed product induced from the action of the fundamental group of the graph of…

Given $k\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in…

Boxicity of a graph $G(V,E)$ is the minimum integer $k$ such that $G$ can be represented as the intersection graph of $k$-dimensional axis parallel rectangles in $\mathbf{R}^k$. Equivalently, it is the minimum number of interval graphs on…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(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…

In this article the extremal structures for the mean order of connected induced subgraphs of cographs are determined. It is shown that among all connected cographs of order $n \ge 7$, the star $K_{1,n-1}$ has maximum mean connected induced…

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

We investigate restricted Lie algebras arising as analogues of (twisted) right-angled Artin groups and right-angled Coxeter groups over fields of characteristic two. These algebras are defined via quadratic relations determined by decorated…

Let $\Gamma$ be a Coxeter graph, let $(W,S)$ be its associated Coxeter system, and let $(A,\Sigma$) be its associated Artin-Tits system. We regard $W$ as a reflection group acting on a real vector space $V$. Let $I$ be the Tits cone, and…

Alternating-sign Hopf plumbing along a tree yields fibered alternating links whose homological monodromy is, up to a sign, conjugate to some alternating-sign Coxeter transformation. Exploiting this tie, we obtain results about the location…

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)\in\{2\}\cup 4\N$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd,…

In this paper, we study the acquaintance time $\AC(G)$ defined for a connected graph $G$. We focus on $\G(n,r,p)$, a random subgraph of a random geometric graph in which $n$ vertices are chosen uniformly at random and independently from…

The paper contains a characterization of compact groups $G\subseteq\GL(V)$, where $V$ is a finite dimensional real vector space, which have the following property \SP{}: the family of convex hulls of $G$-orbits is a semigroup with respect…

We study the diameter of the graph $G(w)$ of reduced words of an element $w$ in a Coxeter group $W$ whose edges correspond to applications of the Coxeter relations. We resolve conjectures of Reiner--Roichman and Dahlberg--Kim by proving a…

A set $Z$ of vertices of a graph $G$ is a zero forcing set of $G$ if initially labeling all vertices in $Z$ with $1$ and all remaining vertices of $G$ with $0$, and then, iteratively and as long as possible, changing the label of some…

If $(W,S)$ is a right-angled Coxeter system and $W$ has no $\mathbb Z^3$ subgroups, then it is shown that the absence of an elementary separation property in the presentation diagram for $(W,S)$ implies all CAT(0) spaces acted on…

We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…

Measurement based quantum computing is preformed by adding non-Clifford measurements to a prepared stabilizer states. Entangling gates like CZ are likely to have lower fidelities due to the nature of interacting qubits, so when preparing a…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…