Related papers: Column expansion identities and quadratic spanning…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
Topological phylogenetic trees can be assigned edge weights in several natural ways, highlighting different aspects of the tree. Here the rooted triple and quartet metrizations are introduced, and applied to formulate novel fast methods of…
Quadratic Poisson brackets on associative algebras are studied. Such a bracket compatible with the multiplication is related to a differentiation in tensor square of the underlying algebra. Jacobi identity means that this differentiation…
Decision trees are widely used for interpretable machine learning due to their clearly structured reasoning process. However, this structure belies a challenge we refer to as predictive equivalence: a given tree's decision boundary can be…
New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
We prove four identities for the squared central binomial coefficients. The first three of them reflect certain transformation properties of the complete elliptic integrals of the first and the second kind, while the last one is based on…
If an outer (multilinear) commutator identity holds in a large subgroup of a group, then it holds also in a large characteristic subgroup. Similar assertions are valid for algebras and their ideals or subspaces. Varying the meaning of the…
Motivated by some binomial coefficients identities encountered in our approach to the enumeration of convex polyominoes, we prove some more general identities of the same type, one of which turns out to be related to a strange evaluation of…
We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…
In this paper, we derive eight basic identities of symmetry in three variables related to Bernoulli polynomials and power sums. These and most of their corollaries are new, since there have been results only about identities of symmetry in…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
In this paper we present a theorem concerning an equivalent statement of the Jacobian Conjecture in terms of Picard-Vessiot extensions. Our theorem completes the earlier work of T. Crespo and Z. Hajto which suggested an effective criterion…
In this paper we provide some exact formulas for projective dimension and the regularity of powers of edge ideals of vertex-weighted rooted forests. These formulas are functions of the weight of the vertices and the number of edges. We also…
In this note, we give a criteria whether given two Eisenstein polynomials over a padic field define the same extension (Proposition 1.6). In particular, we completely identify Eisenstein polynomials of degree p (Theorem 1.16). This note is…
Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a `supertree' that classifies all the taxa. In this paper, we ask how much coverage of the total set of…
We consider properties of the box polynomials, a one variable polynomial defined over all integer partitions $\lambda$ whose Young diagrams fit in an $m$ by $n$ box. We show that these polynomials can be expressed by the finite difference…
In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…