Related papers: Poly-Cauchy numbers -- the combinatorics behind
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
In this paper, we will introduce the Cauchy numbers of both kinds in type B and produce their corresponding exponential generating functions. Then we will provide some identities involving Cauchy, Lah, and Stirling numbers in type B through…
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…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…
Some generalized multi-sum Chu-Vandermonde identities are presented and proved, generalizing some known multi-sum Chu-Vandermonde identities from literature and adding some quadratic and cubic examples of these identities. Some other…
We elaborate on the recent suggestion to consider averaging of Cauchy identities for the Schur functions over power sum variables. This procedure has apparent parallels with the Borel transform, only it changes the number of combinatorial…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…
We prove the Cauchy type identities for the universal double Schubert polynomials, introduced recently by W. Fulton. As a corollary, the determinantal formulae for some specializations of the universal double Schubert polynomials…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
In this paper, we study the class of one dimensional singular integrals that converge in the sense of Cauchy principal value. In addition, we present a simple method for approximating such integrals.
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
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…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
Some identities that involve the elliptic version of the Cauchy matrices are presented and proved. They include the determinant formula, the formula for the inverse matrix, the matrix product identity and the factorization formula.