相关论文: Labeled binary trees, subarrangements of the Catal…

Pondering upon the grammatical labeling of 0-1-2 increasing plane trees, we come to the realization that the grammatical labels play a role as records of chopped off leaves of the original increasing binary trees. While such an…

We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…

Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…

Some new relations on skew Schur function differences are established both combinatorially using Sch\"utzenberger's jeu de taquin, and algebraically using Jacobi-Trudi determinants. These relations lead to the conclusion that certain…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

We study the distribution of fringe trees in Patricia tries (extending earlier results by Ischebeck (2025)) and compressed binary search trees; both cases are random binary trees that have been compressed by deleting nodes of outdegree 1 so…

We generalize the famous weight basis constructions of the finite-dimensional irreducible representations of $\mathfrak{sl}(n,\mathbb{C})$ obtained by Gelfand and Tsetlin in 1950. Using combinatorial methods, we construct one such basis for…

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if G is an abelian group, then the follwing are equivalent: 1. Th(G, +) has the…

We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some…

A Schur-class function in $d$ variables is defined to be an analytic contractive-operator valued function on the unit polydisk. Such a function is said to be in the Schur--Agler class if it is contractive when evaluated on any commutative…

A closed expression is given for the generating function of (virtual) Poincar\'e polynomials of moduli spaces of semi-stable sheaves on the projective plane $\mathbb{P}^2$ with arbitrary rank $r$ and Chern classes. This generating function…

Vector autoregression has been widely used for modeling and analysis of multivariate time series data. In high-dimensional settings, model parameter regularization schemes inducing sparsity yield interpretable models and achieved good…

Let $G$ be a group. We give a categorical definition of the $G$-equivariant $\alpha$-induction associated with a given $G$-equivariant Frobenius algebra in a $G$-braided multitensor category, which generalizes the $\alpha$-induction for…

Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

We provide a uniform construction of "mixed versions" or "graded lifts" in the sense of Beilinson-Ginzburg-Soergel which works for arbitrary Artin stacks. In particular, we obtain a general construction of graded lifts of many categories…

We study the counting problem of rigid quadrangulations, recently introduced by Budd and proven to be in bijection with colorful quadrangulations. The generating function for the latter has been derived in an algebraic manner by…

Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered…

The manuscript develops new method and theory for non-linear regression for binary dependent data using random forests. Existing implementations of random forests for binary data cannot explicitly account for data correlation common in…