Related papers: Multisymmetric functions on eventually constant cy…
To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…
A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…
We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…
In this article we study the K- and L-theory of groups acting on trees. We consider the problem in the context of the fibered isomorphism conjecture of Farrell and Jones. We show that in the class of residually finite groups it is enough to…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.
We generalize to higher algebraic $K$-theory an identity (originally due to Milnor) that relates the Reidemeister torsion of an infinite cyclic cover to its Lefschetz zeta function. Our identity involves a higher torsion invariant, the…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…
We study the equivariant generalization of topological strings on toric manifolds, focusing in particular on defining the contributions of constant maps in the genus expansion of the partition function. This approach regularizes the…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…