Related papers: Bruhat operads
The Bruhat operads from \cite{KS} are equipped with a structure of operads with multiplication.
We propose versions of higher Bruhat orders for types $B$ and $C$. This is based on a theory of higher Bruhat orders of type~A and their geometric interpretations (due to Manin--Shekhtman, Voevodskii--Kapranov, and Ziegler), and on our…
The theory of operads (May, cyclic, modular, PROPs, etc) is extended to include higher dimensional phenomena, i.e. operations between operations, mimicking the algebraic structure on varieties of arbitrary dimensions, having marked…
We give a more coherent definition of upward planar order.
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
It is shown that higher Bruhat orders admit a decomposition into a higher Tamari order, the corresponding dual Tamari order, and a "mixed order." We describe simplex equations (including the Yang-Baxter equation) as realizations of higher…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
A general notion of operad is given, which includes as instances, the operads originally conceived to study loop spaces, as well as the higher operads that arise in the globular approach to higher dimensional algebra. In the framework of…
A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…
We construct bases for the spaces of higher order modular forms of all orders and weights. We also provide a cohomological interpretation of these forms.
We review definitions and basic properties of operads, PROPs and algebras over these structures.
The aim of this note is to give a detailed account of how symmetric operads can be constructed from planar (non-symmetric) operads, and to carefully spell out the algebraic interplay between these two notions. It is a companion note to the…
Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…
In this article, we describe how coalgebraic structures on operads induce algebraic structures on their categories of algebras and coalgebras.
In this paper we consider successive iterations of the first-order differential operations in space ${\bf R}^3.$
We introduce a generalization of the notion of operad that we call a contractad, whose set of operations is indexed by connected graphs and whose composition rules are numbered by contractions of connected subgraphs. We show that many…
In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…