Related papers: Combinatorial properties of block transpositions o…

Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

In this expository paper we describe a group theoretic characterization of arc-transitive graphs and their quotients. When passing from a symmetric graph to its quotient, much information is lost, but some of this information may be…

Symmetry plays a fundamental role in understanding natural phenomena and mathematical structures. This work develops a comprehensive theory for studying the persistent symmetries and degree of asymmetry of finite point configurations over…

In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $\omega$, for which $\omega(12\cdots n)$…

We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…

We consider left-invariant distances $d$ on a Lie group $G$ with the property that there exists a multiplicative one-parameter group of Lie automorphisms $(0, \infty)\rightarrow\mathtt{Aut}(G)$, $\lambda\mapsto\delta_\lambda$, so that $…

We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

In the setting of Carnot groups, we are concerned with the rectifiability problem for subsets that have finite sub-Riemannian perimeter. We introduce a new notion of rectifiability that is, possibly, weaker than the one introduced by…

Symmetry is usually defined via transformations described by a (higher) group. But a symmetry really corresponds to an algebra of local symmetric operators, which directly constrains the properties of the system. In this paper, we point out…

A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…

The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

For a finite group $G$ and an inverse-closed generating set $C$ of $G$, let $Aut(G;C)$ consist of those automorphisms of $G$ which leave $C$ invariant. We define an $Aut(G;C)$-invariant normal subgroup $\Phi(G;C)$ of $G$ which has the…

Let $X$ be a finite set. We determine the diameter of the commuting graph of the partial transformation semigroup $\mathcal{P}(X)$ on $X$ and show that it coincides with the diameter of the commuting graph of the transformation semigroup…

We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering…

A permutation $\pi$ over alphabet $\Sigma = {1,2,3,\ldots,n}$, is a sequence where every element $x$ in $\Sigma$ occurs exactly once. $S_n$ is the symmetric group consisting of all permutations of length $n$ defined over $\Sigma$. $I_n$ =…

Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…