Related papers: Some Combinatorial Operators in Language Theory
Operads were originally defined by May to have right actions of the symmetric groups, but later formulations have also used no groups actions at all or group actions by such families as the braid groups. We call such families action…
We introduce multilinear operators, that generalize Hirota's bilinear $D$ operator, based on the principle of gauge invariance of the $\tau$ functions. We show that these operators can be constructed systematically using the bilinear $D$'s…
Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…
Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on…
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…
This paper is an introduction to a series of papers in which we give combinatorial models for certain important operads (including A-infinity and E-infinity operads, the little n-cubes operads, and the framed little disks operad) and…
In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…
The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…
We provide a general notion of induced structures of operated algebras in the context of unary-binary operads. This notion fully captures the binary quadratic relations encoded by a unary-binary operad, thereby unifying and formalizing the…
In this paper, we investigate the algebras of consequence operators and finite consequence operators on a fixed language. Significant new collections of consequence operators are defined and shown to be complete and distributive…
We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…
The purpose of this dissertation is to set up a theory of generalized operads and multicategories, and to use it as a language in which to propose a definition of weak n-category. Included is a full explanation of why the proposed…
In the last decades many authors have become interested in the study of multilinear and polynomial generalizations of families of operator ideals (such as, for instance, the ideal of absolutely summing operators). However, these…
We set up an algebraic theory of multivariable integration, based on a hierarchy of Rota-Baxter operators and an action of the matrix monoid as linear substitutions. Given a suitable coefficient domain with a bialgebra structure, this…
A formalism for the study of highly interacting electronic systems is presented. The proposed scheme is based on two key concepts: composite operators and algebra constraints. Composite field operators, that naturally appear as a…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…
We define an operation which associates to a pair (B,M) where B is a cluster-tilted algebra and M is a B-module which lies in a local slice of B, a new cluster-tilted algebra B'. In terms of the quivers, this operation corresponds to adding…