Related papers: Two-row $W$-graphs in affine type $A$

Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

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 prove that if two graphs of girth at least 6 have isomorphic squares, then the graphs themselves are isomorphic. This is the best possible extension of the results of Ross and Harary on trees and the results of Farzad et al. on graphs of…

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

We introduce a new language to describe the geometry of affine Deligne-Lusztig varieties in affine flag varieties. This first part of a two paper series develops the definition and fundamental properties of the double Bruhat graph by…

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of…

We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…

Finite connected cubic symmetric graphs of girth 6 have been classified by K. Kutnar and D. Maru\v{s}i\v{c}, in particular, each of these graphs has an abelian automorphism group with two orbits on the vertex set. In this paper all cubic…

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…

A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…

Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…

We construct families of smooth affine surfaces with pairwise non isomorphic A 1-cylinders but whose A 2-cylinders are all isomorphic. These arise as complements of cuspidal hyperplane sections of smooth projective cubic surfaces.

We prove a conjecture by Lusztig, which describes the tensor categories of perverse sheaves on affine flag manifolds, with tensor structure provided by truncated convolution, in terms of the Langlands dual group. We also give a geometric…

Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…

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…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…

A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also…