Related papers: A note on super Catalan numbers

Shapiro proved an elegant convolution formula involving Catalan numbers of even index. This paper gives a simple combinatorial proof of his formula. In addition, we show that it is equivalent with the alternating convolution formula of…

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

Computer experiments suggest some conjectures about Hankel determinants of convolution powers of Catalan numbers. Unfortunately, for most of them I have no proofs. I would like to present them anyway hoping that someone finds them…

The explicit formula for the superconformal singular vectors in the Neveu-Schwarz sector has been obtained recently, via its symmetric polynomial representation, as a sum of Jack superpolynomials. Here we present the analogous, but slightly…

We give some elementary manifestly positive formulae for the Kronecker products s_(d,d) * s_(d+k,d-k) and s_(d,d) * s_(2d-k,1^k). These formulae demonstrate some fundamental properties of the Kronecker coefficients, and we use them to…

The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures concerning the…

We prove that the inverse of the Hankel matrix of the reciprocals of the Catalan numbers has integer entries. We generalize the result to an infinite family of generalized Catalan numbers. The Hankel matrices that we consider are associated…

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

We introduce a kind of $(p, q, t)$-Catalan numbers of Type A by generalizing the Jacobian type continued fraction formula, we proved that the corresponding expansions could be expressed by the polynomials counting permutations on…

Descending plane partitions, alternating sign matrices, and totally symmetric self-complementary plane partitions are equinumerous combinatorial sets for which no explicit bijection is known. In this paper, we isolate a subset of descending…

We show the existence of fundamental solutions for p-adic pseudo-differential operators with polynomial symbols.

We give a complete classification in canonical forms on finite-dimensional vector spaces over the real numbers.

Krawtchouk matrices have as entries values of the Krawtchouk polynomials for nonnegative integer arguments. We show how they arise as condensed Sylvester-Hadamard matrices via a binary shuffling function. The underlying symmetric tensor…

In a preceding paper the theory of nonsymmetric Macdonald polynomials taking values in modules of the Hecke algebra of type $A$ (Dunkl and Luque SLC 2012) was applied to such modules consisting of polynomials in anti-commuting variables, to…

In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…

We put together the ingredients for an efficient operator calculus based on Krawtchouk polynomials, including Krawtchouk transforms and corresponding convolution structure which provide an inherently discrete alternative to Fourier…

Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…

New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…