相关论文: Hook length polynomials for plane forests of a cer…

By rewriting the famous hook-content formula it easily follows that there are $\prod\limits_{1 \le i < j \le n} \frac{k_j - k_i + j -i}{j-i}$ semistandard tableaux of shape $(k_n,k_{n-1},...,k_1)$ with entries in $\{1,2,...,n\}$ or,…

Decision trees are well-known due to their ease of interpretability. To improve accuracy, we need to grow deep trees or ensembles of trees. These are hard to interpret, offsetting their original benefits. Shapley values have recently become…

In this paper, we provide a polynomial time algorithm to calculate the probability of a {\it ranked} gene tree topology for a given species tree, where a ranked tree topology is a tree topology with the internal vertices being ordered. The…

Column expansion identities of determinants give a source of quadratic spanning forest polynomial identities and allow us determine the dimension of the space of certain quadratic spanning forest identities, settling a conjecture of one of…

Matrices over a finite field having fixed rank and restricted support are a natural $q$-analogue of rook placements on a board. We develop this $q$-rook theory by defining a corresponding analogue of the hit numbers. Using tools from coding…

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…

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.

Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…

The symplectic/orthogonal contents of partitions are related to the dimensions of irreducible representations of symplectic/orthogonal groups. In 2012, motivated by Nekrasov--Okounkov's hook-length formula and Stanley's hook-content…

To a univariate monic polynomial is attached a special planar forest that is called the picture of the polynomial. Isotopy classes of pictures are called signatures. All combinatorially possible signatures are realized and spaces of…

We study the following problem that is motivated by demand-aware network design: Given a tree~$G$, the task is to find a binary tree~$H$ on the same vertex set. The objective is to minimize the sum of distances in~$H$ between vertex pairs…

We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…

Frequent tree mining asks us to enumerate tree patterns that occur frequently in a database of rooted trees. This problem is motivated by tree-structured data in bioinformatics, such as glycans and pseudoknot-free RNA secondary structures.…

Linear extensions of posets are important objects in enumerative and algebraic combinatorics that are difficult to count in general. Families of posets like Young diagrams of straight shapes and $d$-complete posets have hook-length product…

We investigate a trivariate polynomial associated with rooted trees. It generalises a bivariate polynomial for rooted trees that was recently introduced by Liu. We show that this polynomial satisfies a deletion-contraction recursion and can…

A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…

We give an expression for the determinant of the twisted Laplacian associated with any linear representation of a finite quiver in terms of traces of the holonomy of its cycles. To establish this expression, we prove a general identity for…