Related papers: Column expansion identities and quadratic spanning…
In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…
We present a broader framework for the Cauchy identity derived from the determinant expansion of collocation matrices. This approach yields an infinite family of identities, where the original Cauchy identity stands as a particular case. To…
We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…
In this paper, we considered the theory of quasideterminants and row and column determinants. We considered the application of this theory to the solving of a system of linear equations in quaternion algebra. We established correspondence…
A nice factorization is given for the characteristic polynomials of intervals in some posets of leaf-labeled forests of rooted binary trees.
In this paper I consider polynomial composites with the coefficients from $K\subset L$. We already know many properties, but we do not know the answer to the question of whether there is a relationship between composites and field…
We show that several orbital equations and orbital clusters of the quadratic (logistic) map coincide surprisingly with cyclotomic {\it period equations}, polynomials whose roots are Gaussian periods. An analytical expression for the field…
We consider determinantal point processes (DPPs) constrained by spanning trees. Given a graph $G=(V,E)$ and a positive semi-definite matrix $\mathbf{A}$ indexed by $E$, a spanning-tree DPP defines a distribution such that we draw…
We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
By studying non-commutative series in an infinite alphabet we introduce shift-plethystic trees and a class of integer compositions as new combinatorial models for the Rogers-Ramanujan identities. We prove that the language associated to…
We prove a universal identity for powers of elements in quadratic algebras, expressing x^m in terms of x and the identity. As a consequence, we obtain a general formula for powers of 2x2 matrices depending only on trace and determinant.…
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…
We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…
We give bijective proofs using Fomin's growth diagrams for identities involving numbers of vacillating tableaux that arose in the representation theory of partition algebras or are inspired by such identities.
We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…
We study polynomial identities satisfied by the mutation product $xpy - yqx$ on the underlying vector space of an associative algebra $A$, where $p, q$ are fixed elements of $A$. We simplify known results for identities in degree $4$,…
Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale…
Our goal is to visualize an additional data dimension of a tree with multifaceted data through superimposition on vertical strips, which we call columns. Specifically, we extend upward drawings of unordered rooted trees where vertices have…