Results 1  10
of
402
ON PROPERTY (FA) FOR WREATH PRODUCTS
"... Abstract. We characterize permutational wreath products with Property (FA). For instance, the standard wreath product A ≀ B of two nontrivial countable groups A, B has Property (FA) if and only if B has Property (FA) and A is a finitely generated group with finite abelianisation. We also prove an an ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We characterize permutational wreath products with Property (FA). For instance, the standard wreath product A ≀ B of two nontrivial countable groups A, B has Property (FA) if and only if B has Property (FA) and A is a finitely generated group with finite abelianisation. We also prove
On Random Walks on Wreath Products
 Ann. Probab
, 2001
"... Wreath products are a type of semidirect products. They play an important role in group theory. This paper studies the basic behavior of simple random walks on such groups and shows that these walks have interesting, somewhat exotic behaviors. The crucial fact is that the probability of return to th ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
Wreath products are a type of semidirect products. They play an important role in group theory. This paper studies the basic behavior of simple random walks on such groups and shows that these walks have interesting, somewhat exotic behaviors. The crucial fact is that the probability of return
Wreath Products For Edge Detection
 Proceedings ICASSP 1998
, 1998
"... Wreath product group based spectral analysis has led to the development of the wreath product transform, a new multiresolution transform closely related to the wavelet transform. In this work, we derive the filter bank implementation of a simple wreath product transform and show that it is in fact, ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Wreath product group based spectral analysis has led to the development of the wreath product transform, a new multiresolution transform closely related to the wavelet transform. In this work, we derive the filter bank implementation of a simple wreath product transform and show that it is in fact
WREATH PRODUCT SYMMETRIC FUNCTIONS
, 809
"... Abstract. We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the LittlewoodRichardson rule are studied. We also discuss the connection with representations of generalized symmetric groups. 1. ..."
Abstract
 Add to MetaCart
Abstract. We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the LittlewoodRichardson rule are studied. We also discuss the connection with representations of generalized symmetric groups. 1.
Metabelian Wreath Products are LERF
, 2006
"... The subgroup S of Γ is separable means that S is closed in the profinite topology of Γ. A finitely generated (f.g.) group is LERF if all its f.g. subgroups are separable. Gruenberg’s theorem [G] asserts that the wreath product A≀Q is residually ..."
Abstract
 Add to MetaCart
The subgroup S of Γ is separable means that S is closed in the profinite topology of Γ. A finitely generated (f.g.) group is LERF if all its f.g. subgroups are separable. Gruenberg’s theorem [G] asserts that the wreath product A≀Q is residually
ON THE ITERATION OF WEAK WREATH PRODUCTS
, 2012
"... Based on a study of the 2category of weak distributive laws, we describe a method of iterating Street’s weak wreath product construction. That is, for any 2category K and for any nonnegative integer n, we introduce 2categories Wdl (n) (K), of (n + 1)tuples of monads in K pairwise related by wea ..."
Abstract
 Add to MetaCart
Based on a study of the 2category of weak distributive laws, we describe a method of iterating Street’s weak wreath product construction. That is, for any 2category K and for any nonnegative integer n, we introduce 2categories Wdl (n) (K), of (n + 1)tuples of monads in K pairwise related
Compression bounds for wreath products
, 907
"... We show that if G and H are finitely generated groups whose Hilbert compression exponent is positive, then so is the Hilbert compression exponent of the wreath G ≀ H. We also prove an analogous result for coarse embeddings of wreath products. In the special case G = Z, H = Z ≀ Z our result implies t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We show that if G and H are finitely generated groups whose Hilbert compression exponent is positive, then so is the Hilbert compression exponent of the wreath G ≀ H. We also prove an analogous result for coarse embeddings of wreath products. In the special case G = Z, H = Z ≀ Z our result implies
Invariant states on the wreath product
, 903
"... Let S ∞ be the infinity permutation group and Γ be a separable topological group. The wreath product Γ ≀ S ∞ is the semidirect product Γ ∞ e ⋊ S ∞ for the usual permutation action of S ∞ on Γ ∞ e = {[γi] ∞ i=1: γi ∈ Γ, only finitely many γi ̸ = e}. In this paper we obtain the full description of in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let S ∞ be the infinity permutation group and Γ be a separable topological group. The wreath product Γ ≀ S ∞ is the semidirect product Γ ∞ e ⋊ S ∞ for the usual permutation action of S ∞ on Γ ∞ e = {[γi] ∞ i=1: γi ∈ Γ, only finitely many γi ̸ = e}. In this paper we obtain the full description
Extended Wreath Products
, 2008
"... Let G and Γ be groups acting on sets X and Ψ, respectively. We give explicit formulas for a series of group multiplications on the cartesian product Γ X ×G together with actions on the set of functions Ψ X. These structures form an infinite family of semidirect products Γ X ⋊G parametrized by two in ..."
Abstract
 Add to MetaCart
integers m ∈ {−1, 0} and k ∈ Z. In this family, the standard direct and wreath products correspond to the pairs (m, k) = (0, 0) and (m, k) = (−1, −1), respectively. 1
GENERATORS AND RELATIONS FOR WREATH PRODUCTS
, 810
"... Abstract. Generators and defining relations for wreath products of groups are given. Under some condition (conormality of the generators) they are minimal. In particular, it is just the case for the Sylow subgroups of the symmetric groups. Let G, H be two groups. Denote by HG the group of all maps f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Generators and defining relations for wreath products of groups are given. Under some condition (conormality of the generators) they are minimal. In particular, it is just the case for the Sylow subgroups of the symmetric groups. Let G, H be two groups. Denote by HG the group of all maps
Results 1  10
of
402