相关论文: Planar Binomial Coefficients
We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing…
We provide an explicit algorithm to calculate invariant tensors for the adjoint representation of the simple Lie algebra $sl(n)$, as well as arbitrary representation in terms of roots. We also obtain explicit formulae for the adjoint…
One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
The modified Bernoulli numbers \begin{equation*} B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 \end{equation*} introduced by D. Zagier in 1998 were recently extended to the polynomial case by replacing $B_{r}$ by…
A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…
We consider matrices with entries that are polynomials in $q$ arising from natural $q$-generalisations of two well-known formulas that count: forests on $n$ vertices with $k$ components; and trees on $n+1$ vertices where $k$ children of the…
Permutations can be represented as linear combinations of natural numbers with different powers. In this paper, its coefficient matrix and inverse matrix is derived, and the results show the coefficient matrix is a lower triangular matrix…
This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…
The definition of the Soret coefficient of a binary mixture includes a concentration prefactor, $x(1-x)$ when mol fraction $x$ is used, or $w(1-w)$ when mass fraction $w$ is used. In this paper the physical reasons behind this choice are…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.