Related papers: Some Combinatorial Operators in Language Theory
The theory of one-sided $M$-ideals and multipliers of operator spaces is simultaneously a generalization of classical $M$-ideals, ideals in operator algebras, and aspects of the theory of Hilbert $C^*$-modules and their maps. Here we give a…
We study the $(m,n)$-word lattices recently introduced by V. Pilaud and D. Poliakova in their study of generalized Hochschild polytopes. We prove that these lattices are extremal and constructable by interval doublings. Moreover, we…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…
We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…
In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to…
This survey provides an elementary introduction to operads and to their applications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher…
A unified approach to the concept of a Hausdorff operator is proposed in such a way that a number of classical and new operators feet into the given definition. Conditions are given for the boundedness of the operators under consideration…
This article analyses some paragraphs of the Dissertatio de Arte Combinatoria (1666) where G.W. Leibniz considers the syntax of a language with a given number of primitive terms. We propose a new formulation which generalizes the…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…
We unravel the algebraic structure which controls the various ways of computing the word ((xy)(zt)) and its siblings. We show that it gives rise to a new type of operads, that we call permutads. It turns out that this notion is equivalent…
A new hierarchy of operads over the linear spans of $\delta$-cliffs, which are some words of integers, is introduced. These operads are intended to be analogues of the operad of permutations, also known as the associative symmetric operad.…
We introduce braided Dunkl operators that are acting on a q-polynomial algebra and q-commute. Generalizing the approach of Etingof and Ginzburg, we explain the q-commutation phenomenon by constructing braided Cherednik algebras for which…
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying…
Category and multicategory theory provide abstract frameworks for describing structures and their compositions, with multicategories extending traditional categories to handle multi-input operations. These theories enable modular reasoning…
Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…
We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regularity for such functions has been defined using two-way…