相关论文: Wreath product decompositions for triangular matri…
We show that the wreath product of two finite symmetric or alternating groups is 2-generated.
Fiber bundles over infinite fields with non-trivial ultra-norms are considered. For them geometric wrap groups are defined and investigated. Besides fields also Cayley-Dickson algebras over fields of characteristic not equal to two are…
It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…
Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, and $T_n(\mathbb{K})$ be the set of $n\times n$ lower triangular matrices with entries in $\mathbb{K}$. We show that $T_n(\mathbb{K})$ has dense subsemigroups that are generated by $n+1$…
We characterize mutation-finite cluster algebras of rank at least 3 using positive semi-definite quadratic forms. In particular, we associate with every unpunctured bordered surface a positive semi-definite quadratic space $V$, and with…
In \cite{CDD22} we investigated the structure of $\ast$-isomorphisms between von Neumann algebras $L(\Gamma)$ associated with graph product groups $\Gamma$ of flower-shaped graphs and property (T) wreath-like product vertex groups as in…
We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…
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…
Starting with group graded Morita equivalences, we obtain Morita equivalences for tensor products and wreath products.
Kang et al. provided a path realization of the crystal graph of a highest weight module over a quantum affine algebra, as certain semi-infinite tensor products of a single perfect crystal. In this paper, this result is generalized to give a…
A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We classify $\mathcal{R}$- and $\mathcal{L}$-cross-sections of wreath products of finite inverse symmetric semigroups $\mathcal{IS}_m \wr_p \mathcal{IS}_n$ up to isomorphism. We show that every isomorphism of $\mathcal{R}$ ($\mathcal{L}$-)…
We develop a new algebraic framework to reason about languages of Mazurkiewicz traces. This framework supports true concurrency and provides a non-trivial generalization of the wreath product operation to the trace setting. A novel local…
We study representations of wreath product analogues of categories of finite sets. This includes the category of finite sets and injections (studied by Church, Ellenberg, and Farb) and the opposite of the category of finite sets and…
In this paper, we define a semi-tensor product for third-order tensors. Based on this definition, we present a new type of tensor decomposition strategy and give the specific algorithm. This decomposition strategy actually generalizes the…
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…
Given a permutational wreath product sequence of cyclic groups we investigate its minimal generating set, minimal generating set for its commutator and some properties of its commutator subgroup. We strengthen the result of author…