Related papers: Primitive Groups Synchronize Non-uniform Maps of E…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

A transformation monoid on a set Omega is called synchronizing if it contains an element of rank 1 (that is, mapping the whole of Omega to a single point). In this paper, I tackle the question: given n and k, what is the probability that…

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…

Consider the following generalization of the bicyclic monoid. Let $\kappa$ be any infinite cardinal and let $\mathcal{IP\!F}\left(\sigma{\mathbb{N}^\kappa}\right)$ be the semigroup of all order isomorphisms between principal filters of the…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

The purpose of this paper is the study of the roots in the mapping class groups. Let $\Sigma$ be a compact oriented surface, possibly with boundary, let $\PP$ be a finite set of punctures in the interior of $\Sigma$, and let $\MM (\Sigma,…

In this paper we study Sigma invariants of even Artin groups of FC-type, extending some known results for right-angled Artin groups. In particular, we define a condition that we call the strong homological $n$-link condition for a graph…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$. Define the rank of a permutation group, denoted $r(G),$ as the number of…

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

For fixed positive integers $n$ and $k$, the Kneser graph $KG_{n,k}$ has vertices labeled by $k$-element subsets of $\{1,2,\dots,n\}$ and edges between disjoint sets. Keeping $k$ fixed and allowing $n$ to grow, one obtains a family of…

Let G be a reductive group over a commutative ring R. We say that G has isotropic rank >=n, if every normal semisimple reductive R-subgroup of G contains (G_m)^n. We prove that if G has isotropic rank >=1 and R is a regular domain…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

We prove that one can perfectly pack degenerate graphs into complete or dense $n$-vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}{\log n})$, and in addition $\Omega(n)$ of them have at most…

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…

Let $G$ be a finite group and $p$ be a prime. We study the kernel of the map, between the Burnside ring of $G$ and the Grothendieck ring of $\mathbb{F}_p[G]$-modules, taking a $G$-set to its associated permutation module. We are able, for…

Every synchronising permutation group is primitive and of one of three types: affine, almost simple, or diagonal. We exhibit the first known example of a synchronising diagonal type group. More precisely, we show that…

Let $G$ be a finite solvable permutation group acting faithfully and primitively on a finite set $\Omega$. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$ The rank of $G$ is defined as the number of orbits of $G_0$ in $\Omega$,…