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

In 2011, Penttila and Williford constructed an infinite new family of primitive $Q$-polynomial 3-class association schemes, not arising from distance regular graphs, by exploring the geometry of the lines of the unitary polar space…

We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…

To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…

We propose an abelian categorification of $\hat{Z}$-invariants for Seifert $3$-manifolds. First, we give a recursive combinatorial derivation of these $\hat{Z}$-invariants using graphs with certain hypercubic structures. Next, we consider…

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W.~Kantor's non-classical $\mathrm{GQ}(5^2,5)$, are stumbling stones for existing…

We prove that the set of orders of finite quotients of a finitely generated group has natural density 0, 1/2 or 1, and characterise when each of these cases occurs. We apply this to show that the sets of orders of various families of…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

If $E$ is a not-necessarily row-finite graph, such that each vertex of $E$ emits at most countably many edges, then a {\it desingularization} $F$ of $E$ can be constructed (see e.g. (1) G. Abrams, G. Aranda Pino, Leavitt path algebras of…

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Affine Deligne-Lusztig varieties can be thought of as affine analogs of classical Deligne-Lusztig varieties, or Frobenius-twisted analogs of Schubert varieties. We provide a method for proving a non-emptiness statement for affine…

Motivated by some known problems concerning combinatorial structures associated with finite one-dimensional affine permutation groups, we study subgroups which are closed in $\operatorname{\Gamma{L}}_1(q)$. This brings us to a description…

We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(\kappa,{\lambda} )$ bipartite graph is a bipartite graph with left side of size…

First, we derive an explicit formula for the Poisson bracket of the classical finite W-algebra W^{fin}(g,f), the algebra of polynomial functions on the Slodowy slice associated to a simple Lie algebra g and its nilpotent element f. On the…

In 2021, Dzhunusov and Zaitseva classified two-dimensional normal affine commutative algebraic monoids. In this work, we extend this classification to noncommutative monoid structures on normal affine surfaces. We prove that two-dimensional…

We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…

We give a combinatorial characterisation of connected graphs whose binomial edge ideals are of K\"{o}nig type, developed independently to the similar characterisation given by LaClair in arXiv:2304.13299, and exhibit some classes of graphs…

We give a geometric characterisation of those groups that arise as fixed subgroups of finite-order untwisted automorphisms of right-angled Artin groups (RAAGs). They are precisely the fundamental groups of a class of compact special cube…

For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail. There is also a natural…

We prove that the group of homotopy classes of relative homotopy automorphisms of a simply connected finite CW-complex is finitely presented and that the rationalization map from this group to its rational analogue has a finite kernel.

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…