The Janjić–Petković Inset Counting Function: Riordan Array Properties and a Thermodynamic Application

Let q1+⋯+qn+m objects be arranged in n rows with q1,…,qn objects and one last row with m objects. The Janjić–Petković counting function denotes the number of (n+k)-insets, defined as subsets containing n+k objects such that at least one object is chosen from each of the first n rows, generalizing the binomial coefficient that is recovered for q1 = … = qn = 1, as then only the last row matters. Here, we discuss two explicit forms, combinatorial interpretations, recursion relations, an integral representation, generating functions, convolutions, special cases, and inverse pairs of summation formulas. Based on one of the generating functions, we show that the Janjić–Petković counting function, like the binomial coefficients that it generalizes, may be regarded as a Riordan array, leading to additional identities. As an application to a physical system, we calculate the heat capacity of a many-body system for which the configurations are constrained as described by the Janjić–Petković counting function, resulting in a modified Schottky anomaly.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-09-17
DOI
https://doi.org/10.3390/math13183007
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Janjić–Petković Inset Counting Function: Riordan Array Properties and a Thermodynamic Application

Marcus Kollar
Mathematics
Advanced Combinatorial Mathematics
article

The Janjić–Petković Inset Counting Function: Riordan Array Properties and a Thermodynamic Application

Marcus Kollar
article en

Abstract

Let q1+⋯+qn+m objects be arranged in n rows with q1,…,qn objects and one last row with m objects. The Janjić–Petković counting function denotes the number of (n+k)-insets, defined as subsets containing n+k objects such that at least one object is chosen from each of the first n rows, generalizing the binomial coefficient that is recovered for q1 = … = qn = 1, as then only the last row matters. Here, we discuss two explicit forms, combinatorial interpretations, recursion relations, an integral representation, generating functions, convolutions, special cases, and inverse pairs of summation formulas. Based on one of the generating functions, we show that the Janjić–Petković counting function, like the binomial coefficients that it generalizes, may be regarded as a Riordan array, leading to additional identities. As an application to a physical system, we calculate the heat capacity of a many-body system for which the configurations are constrained as described by the Janjić–Petković counting function, resulting in a modified Schottky anomaly.

MathematicsVol. 13(18)
University of Augsburg (DE)
Openalex Percentile: Top 68%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Janjić–Petković Inset Counting Function: Riordan Array Properties and a Thermodynamic Application — Marcus Kollar · Mathematics (2025) | TGRS Research Map | TGRS