Related papers: Trees, valuations and the Green-Lazrsfeld set
We review the Moyal and Wick-Voros products, and more in general the translation invariant non-commutative products, and apply them to classical and quantum field theory. We investigate phi^4 field theories calculating their Green's…
Using the existence of a good leaf in every simplicial tree, we order the facets of a simplicial tree in order to find combinatorial information about the Betti numbers of its facet ideal. Applications include an Eliahou-Kervaire splitting…
The aim of this paper is to consider the relation between Lie-isoclinism and isomorphism of two pairs of Leibniz algebras. We show that, unlike the absolute case for finite dimensional Lie algebras, these concepts are not identical, even if…
We survey here the construction and the basic properties of descendent invariants in the theory of stable pairs on nonsingular projective 3-folds. The main topics covered are the rationality of the generating series, the functional…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C)…
In this paper we construct several models with nearest-neighbor interactions and with the set $[0,1]$ of spin values, on a Cayley tree of order $k\geq 2$. We prove that each of the constructed model has at least two translational-invariant…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…
Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…
In this article, we will prove that the set of 4-dissimilarity vectors of n-trees is contained in the tropical Grassmannian G_{4,n}. We will also propose three equivalent conjectures related to the set of m-dissimilarity vectors of n-trees…
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The…
We give a detailed description of the nested algebraic Bethe ansatz. We consider integrable models with a $\mathfrak{gl}_3$-invariant $R$-matrix as the basic example, however, we also describe possible generalizations. We give recursions…
The paper deals with a mixed boundary value problem for the Stokes system in a polyhedral cone. Here different boundary conditions (in particular, Dirichlet, Neumann, free surface conditions) are prescribed on the sides of the polyhedron.…
This paper is the continuation of a program, initiated in Grenier-Nguyen [8,9], to derive pointwise estimates on the Green function of Orr Sommerfeld equations. In this paper we focus on long wavelength perturbations, more precisely…
We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an ordered field and the definable rank of the value group of its…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
We consider an integral series f(X,t) which depends on the choice of a set X of labelled planar rooted trees. We prove that its inverse for composition is of the form f(Z,t) for another set Z of trees, deduced from X. The proof is…
In an attempt to prove the Graceful Tree Conjecture, we present two propagation of graphs. The first is to propagate graceful graphs, and the second is to propagate trees from a gracefully labeled tree. The motivation in propagating such…