相关论文: Wreath Products of Permutation Classes
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.
We construct reflection functors on categories of modules over deformed wreath products of the preprojective algebra of a quiver. These functors give equivalences of categories associated to generic parameters which are in the same orbit…
We study the unit group of the modular group algebra KG, where G is a 2-group of maximal class. We prove that the unit group of KG possesses a section isomorphic to the wreath product of a group of order two with the commutator subgroup of…
Let X be a countably infinite set, Inj(X) the monoid of all injective endomaps of X, and Sym(X) the group of all permutations of X. We classify all submonoids of Inj(X) that are closed under conjugation by elements of Sym(X).
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
The variety of Brouwerian semilattices is amalgamable and locally finite, hence by well-known results due to W. H. Wheeler, it has a model completion (whose models are the existentially closed structures). In this paper, we supply for such…
We give a geometric proof based on recent work of Eskin, Fisher and Whyte that the lamplighter group $L_n$ has infinitely many twisted conjugacy classes for any automorphism $\vp$ only when $n$ is divisible by 2 or 3, originally proved by…
Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…
Braided tensor products have been introduced by the author as a systematic way of making two quantum-group-covariant systems interact in a covariant way, and used in the theory of braided groups. Here we study infinite braided tensor…
We consider the preservation of properties of being finitely generated, being finitely presented and being residually finite under direct products in the context of different types of algebraic structures. The structures considered include…
A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…
We consider closure properties in the class of positively decreasing distributions. Our results stem from different types of dependence, but each type belongs in the family of asymptotically independent dependence structure. Namely we…
Given a quasi-monomial, respectively an almost monomial, group $A$ and a cyclic group $C$ of prime order $p>0$, we show that the wreath product $W=A\wr C$ is quasi-monomial (respectively almost monomial), if certain technical conditions…
We prove that the wreath product orbifolds studied earlier by the first author provide a large class of higher dimensional examples of orbifolds whose orbifold Hodge numbers coincide with the ordinary ones of suitable resolutions of…
Let I be a finite partially ordered set and let (Sym({\Delta}i),{\Delta}i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, {\Delta}) on this sequence of permutation groups. We determine the…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
We collect open problems in permutation patterns on four themes: rank-unimodality in the permutation pattern poset, Wilf-equivalence and shape-Wilf-equivalence, the enumeration of derangements in permutation classes, and sorting by stacks…
An example of an extension of a completely simple semigroup U by a group H is given which cannot be embedded into the wreath product of U by H. On the other hand, every central extension of U by H is shown to be embeddable in the wreath…