相关论文: Wreath/cascade products and related decomposition …

We describe how the SgpDec computer algebra package can be used for composing and decomposing permutation groups and transformation semigroups hierarchically by directly constructing substructures of wreath products, the so called cascade…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Let $k$ be an algebraically closed field of characteristic zero, and let $\mathcal{C} = \mathcal{R}-mod$ be the category of finite-dimensional modules over a fixed Hopf algebra over $k$. One may form the wreath product categories…

In this paper the authors introduce a new notion called the quantum wreath product, which is the algebra $B \wr_Q \mathcal{H}(d)$ produced from a given algebra $B$, a positive integer $d$, and a choice $Q=(R,S,\rho,\sigma)$ of parameters.…

We model problems as presheaves that assign sets of certificates to input instances, and we show how to use presheaf \v{C}ech cohomology to capture the precise ways in which local solutions fail to patch into global ones. Applied to…

Cascades on random networks are typically analyzed by assuming they map onto percolation processes and then are solved using generating function formulations. This approach assumes that the network is infinite and weakly connected, yet…

The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…

In [F. Caselli, Involutory reflection groups and their models, J. Algebra 24 (2010), 370--393] it is constructed a uniform Gelfand model for all non-exceptional irreducible complex reflection groups which are involutory. This model can be…

Strickland gave an interpretation of a quotient of the Morava $E$-theory of symmetric groups in terms of algebraic geometry. We identify an analogous quotient of the Morava $E$-theory of wreath products of symmetric groups with a tensor…

We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to graph products. We concentrate on logspace complexity because…

In the first part of this series, the authors introduced the quantum wreath product, providing a unified framework that encompasses numerous results previously addressed only through case-by-case analysis. This paper shifts focus to the…

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

In both quantum mechanics and corpus linguistics based on vector spaces, the notion of entanglement provides a means for the various subsystems to communicate with each other. In this paper we examine a number of implementations of the…

We use deformation-rigidity theory in von Neumann algebra framework to study probability measure preserving actions by wreath product groups. In particular, we single out large families of wreath products groups satisfying various type of…

Mark Haiman has reduced Macdonald positivity conjecture to a statement about geometry of the Hilbert scheme of points on the plane, and formulated a generalization of the conjectures where the symmetric group is replaced by the wreath…

We introduce a new construction of matrix wreath products of algebras that is similar to wreath products of groups. We then use it to prove embedding theorems for Jacobson radical, nil, and primitive algebras. In \S\ref{Section6}, we…

We propose Markov two-components processes (M2CP) as a probabilistic model of asynchronous systems based on the trace semantics for concurrency. Considering an asynchronous system distributed over two sites, we introduce concepts and tools…

Krohn-Rhodes theory encompasses the techniques for the study of finite automata and their decomposition into elementary automata. The famous result of Krohn and Rhodes roughly states that each finite automaton can be decomposed into…

This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…

This thesis contributes to ongoing research related to the categorical compositional model for natural language of Coecke, Sadrzadeh and Clark in three ways: Firstly, I propose a concrete instantiation of the abstract framework based on…