相关论文: On generating series of complementary planar trees

The generalized knots-quivers correspondence extends the original knots-quivers correspondence, by allowing higher level generators of quiver generating series. In this paper we explore the underlined combinatorics of such generating…

We prove an explicit formula for the tail of the colored Jones polynomial for a class of arborescent links in terms of a product of theta functions and/or false theta functions. We also provide numerical evidence towards a classification of…

These notes are a written version of my talk given at the CARMA workshop in June 2017, with some additional material. I presented a few concepts that have recently been used in the computation of tree-level scattering amplitudes (mostly…

Given a planar algebra we show the equivalence of the notions of a module over this algebra (in the operadic sense), and module over a universal annular algebra. We classify such modules, with invariant inner products, in the generic region…

The Raney numbers $R_{p,r}(n)$ are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns \cite{Raney}. We give a new combinatorial interpretation for all…

We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear. The…

This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…

We state the relation between the variety of binary forms of given rank and the dual of the multiple root loci. This is a new result for the suprageneric rank, as a continuation of the work by Buczy\'nski, Han, Mella and Teitler. We…

A generalization of the generating function for Gegenbauer polynomials is introduced whose coefficients are given in terms of associated Legendre functions of the second kind. We discuss how our expansion represents a generalization of…

We prove that Legendrian and transverse links in overtwisted contact structures having overtwisted complements can be classified coarsely by their classical invariants. We further prove that any coarse equivalence class of loose links has…

This paper is a brief mathematical excursion which starts from quantum electrodynamics and leads to the Moebius function of the Tamari lattice of planar binary trees, within the framework of groups of tree-expanded series. First we recall…

Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.

In this paper we give a sufficient and necessary condition for two rooted trees with the same plucking polynomial. Furthermore, we give a criteria for a sequence of non-negative integers to be realized as a rooted tree.

The grammar representation of a narrowing tree for a syntactically deterministic conditional term rewriting system and a pair of terms is a regular tree grammar that generates expressions for substitutions obtained by all possible…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Embedded Lagrangian cobordisms between Legendrian submanifolds are produced from isotopy, spinning, and handle attachment constructions that employ the technique of generating families. Moreover, any Legendrian with a generating family has…

Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…

The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…