Search arXivSearch

arXiv · 2604.04900

On Semisymmetric Height and a Multidimensional Generalization of Weighted Catalan Numbers

Abstract

Weighted Catalan numbers are a class of weighted sums over Dyck paths. Well-studied for their arithmetic properties and applications to enumerative combinatorics, these numbers were recently generalized to the setting of $k$-dimensional Catalan numbers for $k \geq 2$. In this paper, we introduce the $k$-dimensional semisymmetric weighted Catalan numbers ($k$-dimensional SSWCNs), an alternative $k$-dimensional generalization, along with their variant, the $k$-dimensional $u$-bounded semisymmetric weighted Catalan numbers ($k$-dimensional $u$-bounded SSWCNs). We define these two classes of numbers using the notion of semisymmetric height, a new statistic on points in $\mathbb{Z}^k_{\geq 0}$ motivated by geometric symmetries of $k$-dimensional analogs of Dyck paths and of the fundamental Weyl chamber of type $A_{k-1}$. For our main results, we prove the eventual periodicity of $k$-dimensional SSWCNs and their $u$-bounded variants modulo a suitable integer $m$, and we derive formulas for several classes of $k$-dimensional $u$-bounded SSWCNs. Additionally, using semisymmetric height, we derive novel analogs in the $k$-dimensional setting of the integer sequence counting Dyck paths by height and of the Narayana numbers. We conclude the paper with a future direction for generalizing weighted Catalan numbers to the $k$-dimensional setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ryota Inagaki, Dimana Pramatarova. 2026-04-06. On Semisymmetric Height and a Multidimensional Generalization of Weighted Catalan Numbers. https://arxiv.org/abs/2604.04900

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO