相关论文: Wreath product decompositions for triangular matri…

This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…

We use malleable deformations combined with spectral gap rigidity theory, in the framework of Popa's deformation/rigidity theory to prove unique tensor product decomposition results for II$_1$ factors arising as tensor product of wreath…

We describe an algorithm for computing the complete set of primitive orthogonal idempotents in the centralizer ring of the permutation representation of a wreath product. This set of idempotents determines the decomposition of the…

We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…

We describe explicitly the algebraic structure of the Terwilliger algebra of wreath products of cyclic schemes.

We introduce a generalization of degenerate affine Hecke algebra, called wreath Hecke algebra, associated to an arbitrary finite group G. The simple modules of the wreath Hecke algebra and of its associated cyclotomic algebras are…

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection…

We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix…

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

We develop a new approach on free wreath products, generalizing the constructions of Bichon and of Fima-Pittau. We show stability properties for certain approximation properties such as exactness, Haagerup property, hyperlinearity and…

In this paper we obtain the Wedderburn-Artin decomposition of a semisimple group algebra associated to a direct product of finite groups. We also provide formulae for the number of all possible group codes, and their dimensions, that can be…

Recently G. Bhattacharyya, S.Y. Song and R. Tanaka began to study Terwilliger algebras of wreath products of one-class association schemes. K. Kim determined the structure of Terwilliger algebras of wreath products by one-class association…

For a finitely generated regular wreath product, the metric is known, but its computation can be an NP-complete problem. Also, it is not known for the nonregular case. In this article, a metric estimate is defined for regular wreath…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

We present several multi-variable generating functions for a new pattern matching condition on the wreath product of the cyclic group and the symmetric group. Our new pattern matching condition requires that the underlying permutations…

We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

We consider the wreath product of two symmetric groups as a group of blocks permutations and we study its conjugacy classes. We give a polynomiality property for the structure coefficients of the center of the wreath product of symmetric…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…