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

Let $R$ be a ring with involution. The recently introduced notions of the core and dual core inverse are extended from matrix to an arbitrary $*$-ring case. It is shown that the group, Moore-Penrose, core and dual core inverse are closely…

Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. As in the reverse plane partition…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…

We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and…

Arborified multiple zeta values are a generalization of multiple zeta values associated with rooted trees. There are two types of decorated rooted trees, corresponding respectively to the series and the integral expressions. Manchon…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Differential graded algebra invariants are constructed for Legendrian links in the 1-jet space of the circle. In parallel to the theory for R^3, Poincare-Chekanov polynomials and characteristic algebras can be associated to such links. The…

An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and…

We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a…

We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…

We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…

We determine the symmetries and reversing symmetries within G, the group of real planar polynomial automorphisms, of area-preserving nonlinear polynomial maps L in generalised standard form, L: x'=x+p(y), y'=y+q(x'), where p and q are…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

We define the disposition polynomial $R_{m}(x_1, x_2, ..., x_n)$ as $\prod_{k=0}^{m-1}(x_1+x_2+...+x_n+k)$. When $m=n-1$, this polynomial becomes the generating function of plane trees with respect to certain statistics as given by Guo and…

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary…

A set of real $n$th roots that is pairwise linearly independent over the rationals must also be linearly independent. We show how this result may be extended to more general fields.

This paper is devoted to proving an infinite sequence of relations for rooted tree maps. On the way, we also give a basis for the space of rooted tree maps.

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…