中文
相关论文

相关论文: A classification of plane and planar 2-trees

200 篇论文

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…

组合数学 · 数学 2026-02-27 Helmut Prodinger

In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.

组合数学 · 数学 2008-05-12 Yidong Sun

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

组合数学 · 数学 2007-05-23 Jason Burns

We construct three new combinatorial Hopf algebras based on the Loday-Ronco operations on planar binary trees. The first and second algebras are defined on planar trees and labeled planar trees extending the Loday-Ronco and…

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…

组合数学 · 数学 2007-05-23 William Y. C. Chen , Nelson Y. Li , Louis W. Shapiro

We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…

组合数学 · 数学 2013-04-08 Olivier Bernardi , Alejandro H. Morales

Catalan numbers $C(n)=\frac{1}{n+1}{2n\choose n}$ enumerate binary trees and Dyck paths. The distribution of paths with respect to their number $k$ of factors is given by ballot numbers $B(n,k)=\frac{n-k}{n+k}{n+k\choose n}$. These integers…

组合数学 · 数学 2008-11-03 Jean-Christophe Aval

A new approach to the construction of general persistent polyhierarchical classifications is proposed. It is based on implicit description of category polyhierarchy by a generating polyhierarchy of classification criteria. Similarly to…

人工智能 · 计算机科学 2007-05-23 Pavel Babikov , Oleg Gontcharov , Maria Babikova

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

组合数学 · 数学 2019-10-31 Augusto Ferrante , Fabrizio Padula , Lorenzo Ntogramatzidis

This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…

组合数学 · 数学 2023-09-13 Yang Li , Zhicong Lin , Tongyuan Zhao

Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…

组合数学 · 数学 2023-11-14 Grégory Chatel , Vincent Pilaud

It is shown how one can apply the classification of the holonomy algebras of Lorentzian manifolds to solve some problems. In particular, a new proof to the classification of Lorentzian manifolds with recurrent curvature tensor is given; the…

微分几何 · 数学 2018-08-21 Anton S. Galaev

Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…

范畴论 · 数学 2008-02-26 Jonathan A. Cohen

\noindent In \cite{Casas} Casas-Alvero found decompositions of higher order polars of an irreducible plane curve generalizing the results of Merle. We improve his result giving a finer decomposition where we determine the topological type…

代数几何 · 数学 2019-10-02 Evelia R. García Barroso , Janusz Gwoździewicz

This is a largely expository paper in which we discuss various sets having a Catalan number of objects and some well-known bijections between these sets presented in a new and hopefully interesting way. We call these concepts "bookshelf"…

2-Theories are a canonical way of describing categories with extra structure. 2-theory-morphisms are used when discussing how one structure can be replaced with another structure. This is central to categorical coherence theory. We place a…

范畴论 · 数学 2007-05-23 Noson S. Yanofsky

We give correct explicit formulas for the probabilities of rooted binary trees and cladograms under Ford's $\alpha$-model.

种群与进化 · 定量生物学 2019-03-29 Tomás M. Coronado , Arnau Mir , Francesc Rosselló

We characterise the bracketing identities satisfied by linear quasigroups with the help of certain equivalence relations on binary trees that are based on the left and right depths of the leaves modulo some integers. The numbers of…

组合数学 · 数学 2023-10-16 Erkko Lehtonen , Tamás Waldhauser

We establish a correspondence between modules and spans of algebras within a general monoidal 2-category $\mathfrak{C}$. Specifically, for an algebra $A$ in $\mathfrak{C}$, we construct a normalized lax 3-functor from the 2-category of…

范畴论 · 数学 2025-12-03 Hao Xu

We introduce the hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas…

组合数学 · 数学 2008-05-19 Guo-Niu Han