Related papers: Derivation of normal forms for dispersive PDEs via…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
We introduce a natural map from the space of pure-type complex differential forms on a complex manifold to the corresponding one on the infinitesimal deformations of this complex manifold. By use of this map, we generalize an extension…
Starting from a very general trace-form entropy, we introduce a pair of algebraic structures endowed by a generalized sum and a generalized product. These algebras form, respectively, two Abelian fields in the realm of the complex numbers…
A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We define in this paper several Hopf algebras describing the combinatorics of the so-called multi-scale renormalization in quantum field theory. After a brief recall of the main mathematical features of multi-scale renormalization, we…
We derive a Serre presentation of distribution algebras of loop groups in characteristic $p$ and apply it to give a new proof of the normality of Schubert varieties inside parahoric affine Grassmannians, for all connected reductive groups…
Central in the Hopf algebra approach to the renormalization of perturbative quantum field theory of Connes and Kreimer is their Algebraic Birkhoff Decomposition. In this tutorial article, we introduce their decomposition and prove it by the…
We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
The adjunction between coalgebras and Hopf algebras, first described by Takeuchi, allows one to prove that the semi-abelian category of cocommutative Hopf algebras has enough $\mathcal E$-projective objects with respect to the class…
We have been interested in graphs and realizing them as Reeb graphs of explicit real algebraic functions. The Reeb graph of a differentiable function is the quotient space of the manifold of the domain, regarded as the space consisting of…
Arc-standard derivations over projective dependency trees can be interpreted as the incremental construction of lexicalized ordered trees with contiguous yields. Each \textsc{shift}, \textsc{leftarc}, and \textsc{rightarc} transition…
We study the problem of sampling a uniformly random directed rooted spanning tree, also known as an arborescence, from a possibly weighted directed graph. Classically, this problem has long been known to be polynomial-time solvable; the…
We introduce tropical skeletons for Berkovich spaces based on results of Ducros. Then we study harmonic functions on good strictly analytic spaces over a non-trivially valued non-Archimedean field. Chambert-Loir and Ducros introduced…
Bialgebras and Hopf (bi)modules are typical algebraic structures with several interacting operations. Their structural and homological study is therefore quite involved. We develop the machinery of braided systems, tailored for handling…
Additive deformations of bialgebras in the sense of J. Wirth, i.e. deformations of the multiplication map fulfilling a certain compatibility condition w.r.t. the coalgebra structure, can be generalized to braided bialgebras. The theorems…
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study the problem of designing efficient dynamic programming…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…