Related papers: Hypertrees and embedding of the $\mathrm{FMan}$ op…
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 equip the graded polynomial algebra generated by nonplanar rooted binary trees with a Hopf algebra structure by defining a coproduct which disallows cutting both children of any given vertex, refining Connes-Kreimer's notion of…
This paper introduces a differentiable framework that embeds the axiomatic structure of Random Utility Models (RUM) directly into deep neural networks. Although projecting empirical choice data onto the RUM polytope is NP-hard in general,…
Typed decorated trees are used by Bruned, Hairer and Zambotti to give a description of a renormalisation processon stochastic PDEs. We here study the algebraic structures on these objects: multiple prelie algebrasand related operads…
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…
The vector space of all polygons with configurations of diagonals is endowed with an operad structure. This is the consequence of a functorial construction $\mathsf{C}$ introduced here, which takes unitary magmas $\mathcal{M}$ as input and…
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…
We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of…
We compute the characteristic polynomials of the posets of hypertrees. We show that the generating series of the polynomials can be expressed using cyclic hypertrees. We also propose a conjecture on the action of the symmetric groups on the…
We study a natural Lie algebra structure on the free vector space generated by all rooted planar trees as the associated Lie algebra of the nonsymmetric operad (non-$\Sigma$ operad, preoperad) of rooted planar trees. We determine whether…
An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…
A \emph{metric tree embedding} of expected \emph{stretch~$\alpha \geq 1$} maps a weighted $n$-node graph $G = (V, E, \omega)$ to a weighted tree $T = (V_T, E_T, \omega_T)$ with $V \subseteq V_T$ such that, for all $v,w \in V$,…
The notion of an F-manifold algebra is the underlying algebraic structure of an $F$-manifold. We introduce the notion of pre-Lie formal deformations of commutative associative algebras and show that F-manifold algebras are the corresponding…
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 provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequently forms a Lie…
Hopf algebra structures on rooted trees are by now a well-studied object, especially in the context of combinatorics. In this work we consider a Hopf algebra H by introducing a coproduct on a (commutative) algebra of rooted forests,…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
We use the diagram-free approach to regularity structures introduced by Otto et. al. to build rough paths based on multi-indices. We identify the analogue of the insertion pre-Lie algebra of trees and use it to build the corresponding group…
Pretrained language models (LMs) are prone to arithmetic errors. Existing work showed limited success in probing numeric values from models' representations, indicating that these errors can be attributed to the inherent unreliability of…