相关论文: Generalized Cauchy identities, trees and multidime…

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…

The (dual) Cauchy identity has an easy algebraic proof utilising a commutation relation between the up and (dual) down operators. By using Fomin's growth diagrams, a bijective proof of the commutation relation can be "bijectivised" to…

We consider pairs of a set-valued column-strict tableau and a reverse plane partition of the same shape. We introduce algortithms for them, which implies a bijective proof for the finite sum Cauchy identity for Grothendieck polynomials and…

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 study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

We present a particular connection between classical partition combinatorics and the theory of quiver representations. Specifically, we give a bijective proof of an analogue of A. L. Cauchy's Durfee square identity to multipartitions. We…

In this article, a short combinatorial proof of the Capelli's identity is given. It also leads to an easy proof of the Capelli--Cauchy--Binet identity, a more general form of Capelli's identity. With the technique introduced, the Turnbull's…

We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…

In this paper, we present an independent proof of the Cauchy identities for staircase matrices, originally discovered in arXiv:2411.03117, using the combinatorics of the Bruhat poset and the bubble-sort procedure. Additionally, we derive…

We present three new identities in law for quadratic functionals of conditioned bivariate Gaussian processes. In particular, our results provide a two-parameter generalization of a celebrated identity in law, involving the path variance of…

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…

The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…

In this paper we prove some combinatorial identities which can be considered as generalizations and variations of remarkable Chu-Vandermonde identity. These identities are proved by using an elementary combinatorial-probabilistic approach…

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

Brownian motions in the infinite-dimensional group of all unitary operators are studied under strong continuity assumption rather than norm continuity. Every such motion can be described in terms of a countable collection of independent…

We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…

We give a short proof of the Cauchy-Binet determinantal formula using multilinear algebra by first generalizing it to an identity {\em not} involving determinants. By extending the formula to abstract Hilbert spaces we obtain, as a…

The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space $E$, one can associate an $\R$-tree called the continuous cactus of $E$. We prove under general assumptions…

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…