Related papers: Unsplittable classes of separable permutations
Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…
This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…
Finite groups with given systems of permuteral and strongly permuteral subgroups are studied. New characterizations of w-supersoluble and supersoluble groups are received.
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 permutation is $k$-coverable if it can be partitioned into $k$ monotone subsequences. Barber conjectured that, for any given permutation, if every subsequence of length $k+2 \choose 2$ is $k$-coverable then the permutation itself is…
Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…
Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable…
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
We investigate certain classes of integrable classical or quantum spin systems. The first class is characterized by the recursively defined property $P$ saying that the spin system consists of a single spin or can be decomposed into two…
Let $k$ be a field of characteristic $p > 0$. For $G$ an elementary abelian $p$-group, there exist collections of permutation module such that if $C^*$ is any exact bounded complex whose terms are sums of copies of modules from the…
The convergence of simultaneous and marginal predictive classifiers under partition exchangeability in supervised classification is obtained. The result shows the asymptotic convergence of these classifiers under infinite amount of training…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
A relational structure is indivisible if for every partition of its set of elements into two parts there exists an embedding of the structure into one of the parts of the partition. A relational structure is homogeneous if every embedding…
We explore a new type of replacement of patterns in permutations, suggested by James Propp, that does not preserve the length of permutations. In particular, we focus on replacements between 123 and a pattern of two integer elements. We…
We completely determine all varieties of monoids on whose free objects all fully invariant congruences or all fully invariant congruences contained in the least semilattice congruence permute. Along the way, we find several new monoid…
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…