Related papers: Splittability and 1-amalgamability of permutation …
The notions of $k$-separability and $k$-producibility are useful and expressive tools for the characterization of entanglement in multipartite quantum systems, when a more detailed analysis would be infeasible or simply needless. In this…
We introduce a notion of a uniform structure on the set of all representations of a given separable, not necessarilly commutative $C^*$-algebra $\mathfrak{A}$ by introducing a suitable family of metrics on the set of representations of…
We prove an analogue of Voiculescu's theorem: Relative bicommutant of a separable unital subalgebra $A$ of an ultraproduct of simple unital C*-algebras is equal to $A$.
It is known that every ${\rm C}^r$-orbifold, $1\leq r\leq\infty$, has a compatible ${\rm C}^s$-differential structure, for every $s$, where $r< s\leq\omega$. We prove that if two reduced ${\rm C}^r$-orbifolds, $2\leq r\leq\omega$, are ${\rm…
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…
We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group $S_n$ which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same…
Contrary to the expected behavior, we show the existence of non-invertible deformations of Lie algebras which can generate invariants for the coadjoint representation, as well as delete cohomology with values in the trivial or adjoint…
Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…
Permutation tests are a powerful and flexible approach to inference via resampling. As computational methods become more ubiquitous in the statistics curriculum, use of permutation tests has become more tractable. At the heart of the…
We completely determine all commutative epigroup varieties that are cancellable elements of the lattice EPI of all epigroup varieties. In particular, we verify that a commutative epigroup variety is a cancellable element of the lattice EPI…
We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a…
We describe a class of supersymmetric unified models with the following properties: i) the full breaking of the gauge group is achieved by Higgs fields in the fundamental representation; ii) the correct unification of the strong and…
A split system on a multiset $\mathcal M$ is a set of bipartitions of $\mathcal M$. Such a split system $\mathfrak S$ is compatible if it can be represented by a tree in such a way that the vertices of the tree are labelled by the elements…
We completely determine upper-modular, codistributive and costandard elements in the lattice of all commutative semigroup varieties. In particular, we prove that the properties of being upper-modular and codistributive elements in the…
A permutation is \it separable \rm if it can be obtained from the singleton permutation by iterating direct sums and skew sums. Equivalently, it is separable if and only it avoids the patterns 2413 and 3142. Under the uniform probability on…
Necessary and sufficient conditions are given for a $G$-graded simple module over a unital associative algebra, graded by an abelian group $G$, to be isomorphic to a loop module of a simple module, as well as for two such loop modules to be…
In this paper, we give an alternative proof of separation of variables for scalar-valued polynomials $P:(\mathbb R^m)^k\to\mathbb C$ in the semistable range $m\geq 2k-1$ for the symmetry given by the orthogonal group $O(m)$. It turns out…
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
An important problem in biological modeling is choosing the right model. Given experimental data, one is supposed to find the best mathematical representation to describe the real-world phenomena. However, there may not be a unique model…
Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…