Related papers: Strong accessibility of Coxeter groups over minima…

Let $k$ be a field. We investigate the relationship between subgroups of a pseudo-reductive $k$-group $G$ and its maximal reductive quotient $G'$, with applications to the subgroup structure of $G$. Let $k'/k$ be the minimal field of…

Let G be a closed subgroup of the isometry group of a proper CAT(0)-space X. We show that if G is non-elementary and contains a rank-one element then its second bounded cohomology group with coefficients in the regular representation is…

An easily computable dimension (or ECD) group code in the group algebra $\mathbb{F}_{q}G$ is an ideal of dimension less than or equal to $p=char(\mathbb{F}_{q})$ that is generated by an idempotent. This paper introduces an easily computable…

A minimal separator of a graph $G$ is a set $S \subseteq V(G)$ such that there exist vertices $a,b \in V(G) \setminus S$ with the property that $S$ separates $a$ from $b$ in $G$, but no proper subset of $S$ does. For an integer $k\ge 0$, we…

By Tits' deformation argument, a generic Iwahori--Hecke algebra $H$ associated to a finite Coxeter group $W$ is abstractly isomorphic to the group algebra of $W$. Lusztig has shown how one can construct an explicit isomorphism, provided…

A decomposition of $K_{n(g)}\setminus L$, the complete n-partite equipartite graph with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum group divisible packing of $K_{n(g)}$ with G if L…

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…

Let $W$ be an extended affine Weyl group. We prove that minimal length elements $w_{\co}$ of any conjugacy class $\co$ of $W$ satisfy some special properties, generalizing results of Geck and Pfeiffer \cite{GP} on finite Weyl groups. We…

This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional…

For each g > 2 and h > 1, we explicitly construct (1) fiber sum indecomposable relatively minimal genus g Lefschetz fibrations over genus h surfaces whose monodromies lie in the Torelli group, (2) fiber sum indecomposable genus g surface…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$ and two distinct vertices are adjacent if one of them is a power of the other. Let $n=p_1^{n_1}p_2^{n_2}\cdots p_r^{n_r},$ where…

Let $$1 \to H \to G \to Q \to 1$$ be an exact sequence where $H= \pi_1(S)$ is the fundamental group of a closed surface $S$ of genus greater than one, $G$ is hyperbolic and $Q$ is finitely generated free. The aim of this paper is to provide…

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides…

We prove that a generic linear cocycle over a minimal base dynamics of finite dimension has the property that the Oseledets splitting with respect to any invariant probability coincides almost everywhere with the finest dominated splitting.…

A vertex set $X$ of a graph $G$ is an association set if each component of $G - X$ is a clique, or a dissociation set if each component of $G - X$ is a single vertex or a single edge. Interestingly, $G - X$ is then precisely a graph…

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

We study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the structure of the closure of the analyzed group $G$ plays a pivotal role in this…