Related papers: Conway groupoids, regular two-graphs and supersimp…
In this article, we study $2$-designs with $\lambda=2$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type, and we prove that such a $2$-design does not exist. In conclusion,…
We consider a coset construction of minimal models. We define it rigorously and prove that it gives superconformal minimal models. This construction allows to build all primary fields of superconformal models and to calculate their…
The famous concyclicity theorem stated by John H. Conway is here reconsidered by means of a parametrisation of the associated triangular configuration with arbitrary triplets of real numbers ($\alpha$;$\beta$;$\gamma$). This theorem, thus…
In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…
By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
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$…
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…
Conway's second largest simple group, $\Co_2$, is characterized by the centralizer of an element of order 3 and certain fusion data.
Many previously studied path algebras or self-similar group algebras may be viewed as Steinberg algebras of self-similar groupoids. By way of inverse semigroup algebras, we characterize when the Steinberg algebra of a self-similar groupoid…
We characterise the set of fundamental groups for which there exist $n$-manifolds that are $h$-cobordant (hence homotopy equivalent) but not simple homotopy equivalent, when $n$ is sufficiently large. In particular, for $n \ge 12$ even, we…
We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli…
A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of…
Q-groupoids and Q-algebroids are, respectively, supergroupoids and superalgebroids that are equipped with compatible homological vector fields. These new objects are closely related to the double structures of Mackenzie; in particular, we…
We first develop some basic facts about hypergeometric sheaves on the multiplicative group ${\mathbb G}_m$ in characteristic $p >0$. Certain of their Kummer pullbacks extend to irreducible local systems on the affine line in characteristic…
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…
The Cremona group is topologically simple when endowed with the Zariski or Euclidean topology, in any dimension $\ge 2$ and over any infinite field. Two elements are moreover always connected by an affine line, so the group is…