相关论文: Wreath/cascade products and related decomposition …
We characterize the normal extensions of inverse semigroups isomorphic to full restricted semidirect products, and present a Kalouznin-Krasner theorem which holds for a wider class of normal extensions of inverse semigroups than that in the…
We show that, when the actions of a Mazurkiewicz trace are considered not merely as atomic (i.e., mere names) but transformations from a specified type of inputs to a specified type of outputs, we obtain a novel notion of presentation for…
Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of…
We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…
Based on a study of the 2-category of weak distributive laws, we describe a method of iterating Street's weak wreath product construction. That is, for any 2-category K and for any non-negative integer n, we introduce 2-categories…
We introduce contextads and the Ctx construction, unifying various structures and constructions in category theory dealing with context and contextful arrows -- comonads and their Kleisli construction, actegories and their Para…
The product of local operators in a topological quantum field theory in dimension greater than one is commutative, as is more generally the product of extended operators of codimension greater than one. In theories of cohomological type…
We introduce a new class of (dynamical) systems that inherently capture cascading effects (viewed as consequential effects) and are naturally amenable to combinations. We develop an axiomatic general theory around those systems, and guide…
The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are…
We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.
We define a trace map for every cohomological correspondence in the motivic stable homotopy category over a general base scheme, which takes values in the twisted bivariant groups. Local contributions to the trace map give rise to quadratic…
A wavelet-like model for distributions of objects in natural and man-made terrestrial environments is developed. The model is constructed in a self-similar fashion, with the sizes, amplitudes, and numbers of objects occurring at a constant…
A result of Farahat and Higman shows that there is a ``universal'' algebra, $\mathrm{FH}$, interpolating the centres of symmetric group algebras, $Z(\mathbb{Z}S_n)$. We explain that this algebra is isomorphic to $\mathcal{R} \otimes…
In real world social networks, there are multiple cascades which are rarely independent. They usually compete or cooperate with each other. Motivated by the reinforcement theory in sociology we leverage the fact that adoption of a user to…
We introduce a new algebraic structure called \textit{local biquandles} and show how colorings of oriented classical link diagrams and of broken surface diagrams are related to tribracket colorings. We define a (co)homology theory for local…
Wreath products of non-discrete locally compact groups are usually not locally compact groups, nor even topological groups. We introduce a natural extension of the wreath product construction to the setting of locally compact groups. As an…
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…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
We establish a structure theorem on the arc space of a $k$-scheme of finite type. More precisely, we show that the arc space is locally for the pro-smooth toplogy a product of an infinite dimensional affine space and of a non-noetherian…
Let $\mathbb{C}\mathsf{A}_n = \mathbb{C}[S_2\wr S_2 \wr\cdots \wr S_2]$ be the group algebra of $n$-step iterated wreath product. We prove some structural properties of $\mathsf{A}_n$ such as their centers, centralizers, right and double…