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

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…

It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…

In this paper we study the Lefschetz properties of monomial complete intersections in positive characteristic. We give a complete classification of the strong Lefschetz property when the number of variables is at least three, which proves a…

We describe general connections between intersective properties of sets in Abelian groups and positive exponential sums. In particular, given a set $A$ the maximal size of a set whose difference set avoids $A$ will be related to positive…

An element of a group is called bireflectional when it is the product of two involutions of the group (i.e. elements of order 1 or 2). If an element is bireflectional then it is conjugated to its inverse. It is known that all elements of…

The replacement property (or Steinitz Exchange Lemma) for vector spaces has a natural analog for finite groups and their generating sets. For the special case of the groups PSL(2, p), where p is a prime larger than 5, first partial results…

A sharply 2-transitive permutation group of characteristic 0 whose point stabiliser has an abelian subgroup of finite index splits. More generally, a near-domain of characteristic 0 with a multiplicative subgroup of finite index avoiding…

A family of perfect matchings of $K_{2n}$ is $intersecting$ if any two of its members have an edge in common. It is known that if $\mathcal{F}$ is family of intersecting perfect matchings of $K_{2n}$, then $|\mathcal{F}| \leq (2n-3)!!$ and…

In this paper we prove that RAAGs are distinguished from each other by their pro-$p$ completions for any choice of prime $p$, and that RACGs are distinguished from each other by their pro-2 completions. We also give a new proof that…

We provide a unified proof of all known examples of locally compact groups that enjoy the Howe-Moore property, namely, the vanishing at infinity of all matrix coefficients of the group unitary representations that are without non-zero…

In this note, we study the equivalence of Morse and stable subgroups in the framework of the coset intersection complex. Under certain conditions on a coset intersection complex of a group, we prove that infinite-index Morse subgroups are…

The special representations of a Weyl group can be regarded as the vertices of a graph with an involution i such that any edge e has the following property: either e or i(e) joins two vertices whose a-functions differ by 1.

The celebrated {Erd\H{o}s-Ko-Rado} Theorem states that for $n \geq 2k$ a family $\mathscr{F}$ of $k$ subsets of $[n]$ for which each pair of members of $\mathscr{F}$ have a non-empty intersection has size at most $\binom{n-1}{k-1}$ and for…

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

Let $M_k$ be a $2n$-vertex graph with $n$ pairwise disjoint edges and let $\mathcal{H}^{(p,s)}(n)$ be the family of subsets of $V(M_n)$ that span exactly $p$ edges and $s$ isolated vertices. We prove that for $n\ge 2p+s$ this family has the…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge set, respectively. For two disjoint subsets $A$ and $B$, we say $A$ dominates $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex partition $\pi…

We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $\Gamma$ is 2-arc transitive or the valency $p$…

We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…