Related papers: Splittability and 1-amalgamability of permutation …

Suppose that $\mathcal M$ is a countably decomposable type II$_1$ von Neumann algebra and $\mathcal A$ is a separable, non-nuclear, unital C$^*$-algebra. We show that, if $\mathcal M$ has Property $\Gamma$, then the similarity degree of…

Given a set $V$, a subset $S$, and a permutation $\pi$ of $V$, we say that $\pi$ permutes $S$ if $\pi (S) \cap S = \emptyset$. Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S_i \subseteq V ~~(i=1,\ldots ,m)$, we say that $\cS$…

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

Two permutations in a class are Wilf-equivalent if, for every size, $n$, the number of permutations in the class of size $n$ containing each of them is the same. Those infinite classes that have only one equivalence class in each size for…

We classify integrable irreducible $\hat{g}[\sigma]$-modules in categories E and C, where E is proved to contain the well known evaluation modules and C to unify highest weight modules, evaluation modules and their tensor product modules.

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

We completely determine all semigroup varieties satisfiyng a permutational identity of length 3 that are cancellable elements of the lattice of all semigroup varieties. Using this result, we provide a series of new examples of semigroup…

We show that if $A$ is a separable, simple and non-type I C$^{\ast}$ algebra, then for every properly infinite hyperfinite von Neumann algebra $M$ with separable predual, its Ocneanu ultrapower $M'\cap M^{\omega}$ arises as a sub-quotient…

We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We obtain some structural properties of a factorised group $G = AB$, given that the conjugacy class sizes of certain elements in $A\cup B$ are not divisible by $p^2$, for some prime $p$. The case when $G = AB$ is a mutually permutable…

We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing…

Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

The descent polynomials of separable permutations and derangements are both demonstrated to be unimodal. Moreover, we prove that the $\gamma$-coefficients of the first are positive with an interpretation parallel to the classical Eulerian…

In this paper, we prove that the variety $C_m(L)$ of commuting $m$-tuples of elements of simple Lie algebra $L$ is often reducible. Explicitely, we prove it is reducible for all simple Lie algebra $L$ not isomorphic to $\mathfrak{sl}_2$ and…

Let $\mathscr{C}$ be an additive subcategory of left $\Lambda$-modules, we establish relations of the orthogonal classes of $\mathscr{C}$ and (co)res $\widetilde{\mathscr{C}}$ under separable equivalences. As applications, we obtain that…

We study relations between Rauzy classes coming from an interval exchange map and the corresponding connected components of strata of the moduli space of Abelian differentials. This gives a criterion to decide whether two permutations are…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

A concrete computation -- twelve slidings with sixteen tiles -- reveals that certain commutativity phenomena occur in every double semigroup. This can be seen as a sort of Eckmann-Hilton argument, but it does not use units. The result…