Related papers: Word operads and admissible orderings
We propose a simple new combinatorial model to study spaces of acyclic Jacobi diagrams, in which they are identified with algebras of words modulo operations. This provides a starting point for a word-problem type combinatorial…
We prove a coherence theorem for braided monoidal bicategories and relate it to the coherence theorem for monoidal bicategories. We show how coherence for these structures can be interpretted topologically using up-to-homotopy operad…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
The space of unordered configurations of distinct points in the plane is aspherical, with Artin's braid group as its fundamental group. Remarkably enough, the space of ordered configurations of distinct points on the real projective line,…
A new Hopf operad Ram is introduced, which contains both the well-known Poisson operad and the Bessel operad introduced previously by the author. Besides, a structure of cooperad R is introduced on a collection of algebras given by…
The aim of this paper is to present remarkable classes of Lie-admissible algebras containing in particular the associative algebras, the Vinberg algebras and pre-Lie algebras. We determine the associated quadratic operads and their dual…
The purpose of this note is to relate certain ring-theoretic properties of rings in mixed and positive characteristics that are related to each other by a tilting operation used in perfectoid geometry. To this aim, we exploit the…
An implicit operation of a class of similar algebras $\mathsf{K}$ is a collection of first order definable partial functions on the members of $\mathsf{K}$ that is globally preserved by homomorphisms. For instance, "taking inverses" can be…
These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…
We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…
We show that various combinatorial invariants of matroids such as Chow rings and Orlik--Solomon algebras may be assembled into "operad-like" structures. Specifically, one obtains several operads over a certain Feynman category which we…
We study classes of objects whose combinatorics are closely related to those of posets. The framework of operads and operad algebras allows us to make this relationship precise and provides tools for a deeper understanding of their…
A braided Frobenius algebra is a Frobenius algebra with braiding that commutes with the operations, that are related to diagrams of compact surfaces with boundary expressed as ribbon graphs. A heap is a ternary operation exemplified by a…
We introduce a general definition for colored cyclic operads over a symmetric monoidal ground category, which has several appealing features. The forgetful functor from colored cyclic operads to colored operads has both adjoints, each of…
We consider different classes of combinatory structures related to Krivine realizability. We show, in the precise sense that they give rise to the same class of triposes, that they are equivalent for the purpose of modeling higher-order…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…
Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…
We introduce balanced polyominoes and show that their ideal of inner minors is a prime ideal and has a quadratic Gr\"obner basis with respect to any monomial order, and we show that any row or column convex and any tree-like polyomino is…
We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…