Related papers: A census of small Schurian association schemes
We study intersection theory on the relative Hilbert scheme of a family of nodal-or-smooth curves, over a base of arbitrary dimension. We introduce an additive group called 'discriminant module', generated by diagonal loci, node scrolls,…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
It is proved in [21] that there is a constant $c$ such that each transitive permutation group of degree $d\ge 2$ can be generated by $\lfloor cd/\sqrt{\log{d}}\rfloor$ elements. In this paper, we explicitly estimate $c$.
We say that the signs of association measures among three variables {X, Y, Z} are transitive if a positive association measure between the variable X and the intermediate variable Y and further a positive association measure between Y and…
A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…
A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero $2$-dimensional vectors modulo some subgroup of the multiplicative group of a finite field. In the…
Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…
One of the classic results of group theory is the so-called Schur theorem. It states that if the central factor-group $G/\zeta(G)$ of a group $G$ is finite, then its derived subgroup $[G,G]$ is also finite. This result has numerous…
Error-correcting codes are known to define chiral 2d lattice CFTs where all the $U(1)$ symmetries are enhanced to $SU(2)$. In this paper, we extend this construction to a broader class of length-$n$ codes which define full (non-chiral) CFTs…
We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
Let $G$ be the finite simple Chevalley group of type $^2E_6(2)$. It has a Schur multiplier of type $C_2^2 \times C_3$. We determine the ordinary character tables of the central extensions $3.G$, $6.G$, $(2^2\times 3).G$ of $G$ and their…
We construct connected $2$-arc-transitive covers of complete graphs with non-abelian characteristically simple transformation groups. This solves the existence problem for non-solvable $2$-arc-transitive covers of complete graphs.
The formation of triangles in complex networks is an important network property that has received tremendous attention. The formation of triangles is often studied through the clustering coefficient. The closure coefficient or transitivity…
A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…
We prove a higher-dimensional Chevalley restriction theorem for orthogonal groups, which was conjectured by Chen and Ng\^{o} for reductive groups. In characteristic $p>2$, we also prove a weaker statement. In characteristic $0$, the theorem…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
The set of subspaces of a given dimension in an attenuated space has a structure of a symmetric association scheme and this association scheme is called an association scheme based on an attenuated space. Association schemes based on…
In this paper, we compute the number of z-classes (conjugacy classes of centralizers of elements) in the symmetric group S_n, when n is greater or equal to 3 and alternating group A_n, when n is greater or equal to 4. It turns out that the…
In correlation clustering, we are given $n$ objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we…