Related papers: A classification of one dimensional affine rank th…
The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…
Affine subgroups having the same Coxeter number with the affine Coxeter groups W(An), W(Dn), and W(En) are constructed by graph folding technique. The affine groups W(Cn) and W(Bn) are obtained from the Coxeter groups W(A2n-1) and W(D2n-1)…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
We describe a new class of maximal cliques, with a vector space structure, of Cayley graphs defined on the additive group of a field. In particular, we show that in the cubic Paley graph with order $q^3$, the subfield with $q$ elements…
We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…
We classify the dessins $\mathcal D$ for which the automorphism group $G$ acts primitively and faithfully on the points over one of the three critical values (without loss of generality the black vertices in the usual bipartite map…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
We construct a new subfactor planar algebra, and as a corollary a new subfactor, with the `extended Haagerup' principal graph pair. This completes the classification of irreducible amenable subfactors with index in the range…
Graphs are complex objects that do not lend themselves easily to typical learning tasks. Recently, a range of approaches based on graph kernels or graph neural networks have been developed for graph classification and for representation…
The goal of this paper is to establish a general rigidity statement for abstract representations of elementary subgroups of Chevalley groups of rank at least 2 over a class of commutative rings that includes the localizations of 1-generated…
The Colour Refinement algorithm is a classical procedure to detect symmetries in graphs, whose most prominent application is in graph-isomorphism tests. The algorithm and its generalisation, the Weisfeiler-Leman algorithm, evaluate local…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
Bernshteyn and Lee defined a new notion, weak degeneracy, which is slightly weaker than the ordinary degeneracy. It is proved that strictly $f$-degenerate transversal is a common generalization of list coloring, $L$-forested-coloring and…
We classify meromorphic affine connections on compact complex surfaces with algebraic dimension one, extending the work of Inoue,Kobayashi and Ochiai (1981) in the holomorphic case. The motivation is to investigate possible extension of the…
We discuss the classification of reflection subgroups of finite and affine Weyl groups from the point of view of their root systems. A short case free proof is given of the well known classification of the isomorphism classes of reflection…
We classify up to isomorphism the gradings by arbitrary groups on the exceptional classical simple Lie superalgebras $G(3)$, $F(4)$ and $D(2,1;\alpha)$ over an algebraically closed field of characteristic $0$. To achieve this, we apply the…