Related papers: Some combinatorial results on smooth permutations
The paper concerns Hochschild cohomology of a commutative algebra S, which is essentially of finite type over a commutative noetherian ring K and projective as a K-module, with coefficients in an S-module M. It is proved that vanishing of…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…
Let $\Sigma$ be a closed surface, $G$ a compact Lie group, with Lie algebra $g$, $\xi \colon P \to \Sigma$ a principal $G$-bundle, let $N(\xi)$ denote the moduli space of central Yang-Mills connections on $\xi$, for suitably chosen…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…
Suppose $R$ is a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$ such that $q+q^{-1}$ is invertible. For an oriented surface $\Sigma$, let $\mathcal{S}(\Sigma;R)$ denote the Kauffman bracket skein algebra of…
For the $C^*$-crossed product $C^*(\Sigma)$ associated with an arbitrary topological dynamical system $\Sigma = (X, \sigma)$, we provide a detailed analysis of the commutant, in $C^* (\Sigma)$, of $C(X)$ and the commutant of the image of…
Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…
A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…
Let $\sigma=(\sigma_1,..., \sigma_N)$, where $\sigma_i =\pm 1$, and let $C(\sigma)$ denote the number of permutations $\pi$ of $1,2,..., N+1,$ whose up-down signature $\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i$, for $i=1,...,N$. We prove that…
With each antiholomorphic involution $\sigma $ of a connected complex semisimple Lie group $G$ we associate an automorphism $\epsilon_\sigma$ of the Dynkin diagram. The definition of $\epsilon_\sigma$ is given in terms of the Satake diagram…
For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…
We develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…
The permutation representation afforded by a Coxeter group W acting on the cosets of a standard parabolic subgroup inherits many nice properties from W such as a shellable Bruhat order and a flat deformation over Z[q] to a representation of…
For any $n$-dimensional smooth manifold $\Sigma$, we show that all the singularities of the mean curvature flow with any initial mean convex hypersurface in $\Sigma$ are cylindrical (of convex type) if the flow converges to a smooth…
Denote the symmetric group of degree $n$ by $S_n$. Let $\rho$ be an irreducible representation of $S_n$ over the field of complex numbers and $\sigma\in S_n$. In this paper, we describe the set of eigenvalues of $\rho(\sigma)$. Based on…
We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…
We focus upon the relationship between Hamiltonian cycle products and efficient vectors for a reciprocal matrix $A$, to more deeply understand the latter. This facilitates a new description of the set of efficient vectors (as a union of…
Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…