Related papers: All $2$-transitive groups have the EKR-module prop…

We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…

A family of sets is intersecting if no two of its members are disjoint, and has the Erd\H{o}s-Ko-Rado property (or is EKR) if each of its largest intersecting subfamilies has nonempty intersection. Denote by $\mathcal{H}_k(n,p)$ the random…

A sharply 2-transitive permutation group of finite Morley rank and characteristic 2 splits; a split sharply 2-transitive permutation group of finite Morley rank and characteristic different from 2 is the group of affine transformations of…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

A set of permutations of $\{1,2,\dots,n\}$ is $t$-intersecting if any two permutations agree on at least $t$ inputs. A recent work by Kupavskii, in the spirit of the Erd\H{o}s-Ko-Rado Theorem, shows that for all $t\leq…

In this paper we completely characterise irreducible tensor products of representations of alternating groups in characteristic 2 of a basic spin module with an irreducible module. This completes the classification of irreducible tensor…

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…

The congruence subgroup property is established for the modular representations associated to any modular tensor category. This result is used to prove that the kernel of the representation of the modular group on the conformal blocks of…

Let $G=(V,E)$ be an undirected graph without loops and multiple edges. A subset $C\subseteq V$ is called \emph{identifying} if for every vertex $x\in V$ the intersection of $C$ and the closed neighbourhood of $x$ is nonempty, and these…

We study the permutation action of a finite symplectic group of characteristic 2 on the set of subspaces of its standard module which are either totally isotropic or else complementary to totally isotropic subspaces with respect to the…

A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…

We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating and synchronising groups can be described via properties of…

The classical Erd\H{o}s--Ko--Rado (EKR) theorem characterizes the maximum size of intersecting families of $r$-element subsets of an $n$-element set. We study EKR-type questions for independent $r$-sets in \emph{pendant} graph…

Let $G=SL(2,5)$ be the special linear group of $2 \times 2$-matrices with coefficients in the field with $5$ elements. We show that the principal block over a splitting field $K$ of characteristic two of the group algebra $KG$ has a…

We say that a family of $k$-subsets of an $n$-element set is intersecting, if any two of its sets intersect. In this paper we study different extremal properties of intersecting families, as well as the structure of large intersecting…

All finite sets of equiangular lines spanning finite-dimensional unitary spaces are determined for which the action on the lines of the set-stabilizer in the unitary group is 2-transitive with a regular normal subgroup.

In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion…

Let $W$ be a Coxeter group and $r\in W$ a reflection. If the group of order 2 generated by $r$ is the intersection of all the maximal finite subgroups of $W$ that contain it, then any isomorphism from $W$ to a Coxeter group $W'$ must take…

A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its…