English
Related papers

Related papers: On Weighted and Bounded Multidimensional Catalan N…

200 papers

The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…

Combinatorics · Mathematics 2020-10-01 Curtis Bennett , Juan Carrillo , John Machacek , Bruce E. Sagan

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…

Combinatorics · Mathematics 2015-09-22 Adrian Dumitrescu , Maarten Löffler , André Schulz , Csaba D. Tóth

We define new generalizations of (q,t)-Catalan numbers applying nabla operator on k-Schur functions indexed by column partitions. In some special cases, we give a combinatorial interpretation of these numbers using configurations of Dyck…

Combinatorics · Mathematics 2016-11-08 N. Bergeron , F. Descouens , M. Zabrocki

It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a…

Combinatorics · Mathematics 2013-05-14 David Callan

We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Toufik Mansour , Sherry H. F. Yan

Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…

Mathematical Physics · Physics 2022-04-15 Jins de Jong , Alexander Hock , Raimar Wulkenhaar

We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…

Combinatorics · Mathematics 2021-10-12 Jovan Mikić

This note is dedicated to presenting a polynomial analogue of $(n+1)!C_n=2^n(2n-1)!!$ (with $C_n$ as the $n$-th Catalan number) in the context of labeled plane trees and increasing plane trees, based on the definition of improper edges in…

Combinatorics · Mathematics 2025-10-06 Lora R. Du , Kathy Q. Ji , Dax T. X. Zhang

We define weighted renormalized volume coefficients and prove that they are variational. We also prove that they can be written as polynomials of weighted extended obstruction tensors, the weighted Schouten tensor, and the weighted Schouten…

Differential Geometry · Mathematics 2022-05-13 Ayush Khaitan

This is a companion paper of arXiv:1901.09461, where different notions of dimension for triangulated categories are discussed. Here we compute dimensions for some examples of triangulated categories and thus illustrate and motivate material…

Algebraic Geometry · Mathematics 2020-04-10 Alexey Elagin

We introduce the notion of a categorical valuative invariant of polyhedra or matroids, in which alternating sums of numerical invariants are replaced by split exact sequences in an additive category. We provide categorical lifts of a number…

Combinatorics · Mathematics 2024-10-23 Ben Elias , Dane Miyata , Nicholas Proudfoot , Lorenzo Vecchi

Analysis of the dynamics of the Dyck words helped solve the problem of representing the Catalan number as a sum of squares of natural numbers. In this case, the Dyck triangle is considered in different coordinates. In the calculations, we…

Combinatorics · Mathematics 2020-09-15 Gennady Eremin

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

Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…

Computational Complexity · Computer Science 2019-01-11 Cassio P. de Campos , Georgios Stamoulis , Dennis Weyland

The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was…

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

We explain how the moments of the (weight function of the) Askey Wilson polynomials are related to the enumeration of the staircase tableaux introduced by the first and fourth authors. This gives us a direct combinatorial formula for these…

Combinatorics · Mathematics 2010-08-16 Sylvie Corteel , Richard Stanley , Dennis Stanton , Lauren Williams

We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super…

Combinatorics · Mathematics 2015-02-26 Thomas M. Richardson

A novel higher-dimensional definition for Costas arrays is introduced. This definition works for arbitrary dimensions and avoids some limitations of previous definitions. Some non-existence results are presented for multidimensional Costas…

Information Theory · Computer Science 2022-08-05 Ivelisse Rubio , Jaziel Torres

In this note we show that various natural q-analogues of the Catalan numbers can be obtained in a uniform way. Furthermore we compute their Hankel determinants.

Combinatorics · Mathematics 2007-05-23 Johann Cigler

We consider multifold convolutions of a combinatorial sequence $(a_n)_{n=0}^{\infty}$: namely, for each $k \in \N$ the $k$-fold convolution is $\mathcal{M}^{(k)}_n(\boldsymbol{a}) = \sum_{j_1+\dots+j_k=n} a_{j_1} \cdots a_{j_k}$. Let $C_n$…

Combinatorics · Mathematics 2025-01-06 Timothy Li , Shannon Starr
‹ Prev 1 4 5 6 7 8 10 Next ›