English
Related papers

Related papers: Expressions for Catalan Kronecker Products

200 papers

We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…

Combinatorics · Mathematics 2026-04-24 Jean-Christophe Pain

In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…

Combinatorics · Mathematics 2019-05-03 Johann Cigler

In this paper, we obtain an explicit expression for the resultant of n quadratic algebraic equations dS/dx_1 = 0,..., dS/dx_n = 0, where S is a cubic polynomial in n variables, symmetric under permutations of its arguments. Application of…

Mathematical Physics · Physics 2010-03-24 N. Perminov

We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $\alpha, \beta \le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^\alpha$ are primes and $s \le m^\beta$ is a product of at…

Number Theory · Mathematics 2017-05-18 Igor E. Shparlinski

The identity j/n {kn}\choose{n+j} =(k-1) {kn-1}\choose{n+j-1}- {kn-1}\choose{n+j} shows that j/n {kn}\choose{n+j} is always an integer. Here we give a combinatorial interpretation of this integer in terms of lattice paths, using a uniformly…

Combinatorics · Mathematics 2007-05-23 David Callan

Let $d_S$ denote the arithmetic density of a subset $S \subseteq \mathbb N$. We derive a power series in $q\in \mathbb C$, $|q|<1$, with co\"efficients related to integer partitions and integer compositions, that yields $1/d_S$ in the limit…

Number Theory · Mathematics 2022-08-29 Robert Schneider , Andrew V. Sills

We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…

Combinatorics · Mathematics 2026-05-15 Jimmy Dillies

We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a…

Quantum Physics · Physics 2007-05-23 A. Horzela , P. Blasiak , G. H. E. Duchamp , K. A. Penson , A. I. Solomon

In a recent paper, the authors introduced a new basis of the ring of symmetric functions which evaluate to the irreducible characters of the symmetric group at roots of unity. The structure coefficients for this new basis are the stable…

Combinatorics · Mathematics 2017-09-26 Rosa Orellana , Mike Zabrocki

We introduce Macdonald polynomials indexed by $n$-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials…

Combinatorics · Mathematics 2019-09-23 Camilo González , Luc Lapointe

We give an introduction to the concept of Kan extensions, and study its relation with the notions of coend and adjoint functors. We state and prove in detail a well known formula to compute Kan extensions by using coends: a certain colimit…

Category Theory · Mathematics 2016-10-05 Marco A. Pérez

How many ways can we write $n$ as a sum of $3$ positive integers, no pair of which share a common factor? We express this quantity in terms of the number of solutions to a certain class of linear Diophantine equations. This allows us to…

Number Theory · Mathematics 2020-02-03 James Thomas

For every $2n\times 2n$ real positive definite matrix $A,$ there exists a real symplectic matrix $M$ such that $M^TAM=\diag(D,D),$ where $D$ is the $n\times n$ positive diagonal matrix with diagonal entries $d_1(A)\le \cdots\le d_n(A).$ The…

Functional Analysis · Mathematics 2021-08-25 Tanvi Jain

The Kronecker product is a key algorithm and is ubiquitous across the physical, biological, and computation social sciences. Thus considerations of optimal implementation are important. The need to have high performance and computational…

Mathematical Software · Computer Science 2009-07-07 Lenore M. Mullin , James E. Raynolds

Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…

Combinatorics · Mathematics 2026-03-24 Voalaza Mahavily Romuald Aubert , Benjamin Randrianirina

We show that, under fairly general conditions, many elements of a p-adic group can be well approximated by a product whose factors have properties that are helpful in performing explicit character computations.

Representation Theory · Mathematics 2020-07-07 Jeffrey D. Adler , Loren Spice

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

We give a conjectured evaluation of the determinant of a certain matrix $\tilde{D}(n,k)$. The entries of $\tilde{D}(n,k)$ are either 0 or specializations $\mathfrak{S}_w(1,\dots,1)$ of Schubert polynomials. The conjecture implies that the…

Combinatorics · Mathematics 2017-04-06 Richard P. Stanley

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Combinatorics · Mathematics 2010-12-20 Milan Janjic

We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.

Number Theory · Mathematics 2011-11-01 Roberto Tauraso
‹ Prev 1 4 5 6 7 8 10 Next ›