Related papers: On the arithmetic product of combinatorial species
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
We get new Hopf algebras (HA): 1. A wealth of quotient HA's of the Malvenuto-Reutenauer HA (the Loday-Ronco HA being a special case). They consist of the permutations avoiding an {\it arbitrary} set of permutations without global descents,…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
Coxeter groups possess an associative operation, called variously the Demazure, greedy, or $0$-Hecke product. For symmetric groups, this product has an amusing formulation as matrix multiplication in the min-plus (tropical) semiring of two…
We describe a simple machinery which translates results on algebraic sums of sets of reals into the corresponding results on their cartesian product. Some consequences are: 1. The product of a meager/null-additive set and a strong measure…
A product system E over a semigroup P is a family of Hilbert spaces {E_s:s\in P} together with multiplications E_s \times E_t\to E_{st}. We view E as a unitary- valued cocycle on P, and consider twisted crossed products A \times_{\beta,E} P…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…
In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set…
The notion of a generalized product, refining that of a (symmetric and smooth) simplicial space is introduced and shown to imply the existence of an algebra of pseudodifferential operators. This encompasses many constructions of such…
Imprimitivity theorems provide a fundamental tool for studying the representation theory and structure of crossed-product C*-algebras. In this work, we show that the Imprimitivity Theorem for induced algebras, Green's Imprimitivity Theorem…
We introduce the notion of additive units and roots of a unit in a spatial product system. The set of all roots of any unit forms a Hilbert space and its dimension is the same as the index of the product system. We show that a unit and all…
This is the central article of a series of three papers on cross product bialgebras. We present a universal theory of bialgebra factorizations (or cross product bialgebras) with cocycles and dual cocycles. We also provide an equivalent…
In the paper the notion of truncating twisting function from a cubical set to a permutahedral set and the corresponding notion of twisted Cartesian product of these sets are introduced. The latter becomes a permutocubical set that models in…
We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side-by-side product of partial orders which we call…
We compare two statistical models of three binary random variables. One is a mixture model and the other is a product of mixtures model called a restricted Boltzmann machine. Although the two models we study look different from their…
e use Prolog as a flexible meta-language to provide executable specifications of some fundamental mathematical objects and their transformations. In the process, isomorphisms are unraveled between natural numbers and combinatorial objects…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
We introduce the combinatorial notion of posetted trees and we use it in order to write an explicit expression of the Baker-Campbell-Hausdorff formula.