Related papers: Word operads and admissible orderings
The purpose of this paper is to develop a theory of bimonads and Hopf monads on arbitrary categories thus providing the possibility to transfer the essentials of the theory of Hopf algebras in vector spaces to more general settings. There…
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
We construct integrals of motion for multidimensional classical systems from ladder operators of one-dimensional systems. This method can be used to obtain new systems with higher order integrals. We show how these integrals generate a…
In this paper, we firstly give a matrix approach to the bases of a separable Hilbert space and then correct a mistake appearing in both review and the English translation of the Olevskii's paper. After this, we show that even a diagonal…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets…
For a directed polytope, we construct a colored operad whose Poincare-Hilbert series encodes certain operations on the cellular complex of the polytope. We conjecture that for a class of short polytopes the constructed operads are Koszul…
We establish and explore a relationship between two approaches to moment-cumulant relations in free probability theory: on one side the main approach, due to Speicher, given in terms of M\"obius inversion on the lattice of noncrossing…
Probabilistic puzzles can be confusing, partly because they are formulated in natural languages - full of unclarities and ambiguities - and partly because there is no widely accepted and intuitive formal language to express them. We propose…
Using a recently introduced algebraic framework for the classification of fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the…
We introduce a construction that associates, to each finite dimensional k-vector space V, a family of projective k-varieties that comes equipped with the structure of a operad in the category of k-schemes. When dim V = 1, this operad…
We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a…
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an…
We give sufficient conditions for the existence of a model structure on operads in an arbitrary symmetric monoidal model category. General invariance properties for homotopy algebras over operads are deduced.
We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…
The present article exploits the fact that permutads (aka shuffle algebras) are algebras over a terminal operad in a certain operadic category Per. In the first, classical part we formulate and prove a claim envisaged by Loday and Ronco…
We study different algebraic structures associated to an operad and their relations: to any operad $\mathbf{P}$ is attached a bialgebra,the monoid of characters of this bialgebra, the underlying pre-Lie algebra and its enveloping algebra;…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
We introduce two coloured operads in sets -- the lattice path operad and a cyclic extension of it -- closely related to iterated loop spaces and to universal operations on cochains. As main application we present a formal construction of an…
Starting from an operad, one can build a family of posets. From this family of posets, one can define an incidence Hopf algebra. By another construction, one can also build a group directly from the operad. We then consider its Hopf algebra…