Restricted Möbius Sums on Noncrossing Partitions: Marked Matchings, Gap Factorization, and Plane Trees

Let s be a standard semicircular variable and let x be a free Poisson variable of rate one, freely independent of s. For yθ = x+ √θs, with θ≥0, we evaluate the upper-interval transform σ≥πµ(π,σ)κσ(yθ) when π has one nonsingleton block. The answer depends on the circular gaps of that block. We give explicit finite formulas in factorials and Catalan numbers, together with a proof using marked noncrossing matchings and ordered trees with binary and ternary vertices. A more general marked-matching identity applies to every base partition. It is proved by a sign-reversing involution on decorated strict chains in the original noncrossing-partition lattice. The surviving chains have both signs in general, so neither the block size nor the interval height determines a universal strict sign. Explicit examples and vanishing families illustrate the evaluation. All evaluations use finite combinatorics; no analytic transforms or formal power-series inversion are used.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23916377
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

Restricted Möbius Sums on Noncrossing Partitions: Marked Matchings, Gap Factorization, and Plane Trees

Y YH
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
article

Restricted Möbius Sums on Noncrossing Partitions: Marked Matchings, Gap Factorization, and Plane Trees

Y YH
article en

Abstract

Let s be a standard semicircular variable and let x be a free Poisson variable of rate one, freely independent of s. For yθ = x+ √θs, with θ≥0, we evaluate the upper-interval transform σ≥πµ(π,σ)κσ(yθ) when π has one nonsingleton block. The answer depends on the circular gaps of that block. We give explicit finite formulas in factorials and Catalan numbers, together with a proof using marked noncrossing matchings and ordered trees with binary and ternary vertices. A more general marked-matching identity applies to every base partition. It is proved by a sign-reversing involution on decorated strict chains in the original noncrossing-partition lattice. The surviving chains have both signs in general, so neither the block size nor the interval height determines a universal strict sign. Explicit examples and vanishing families illustrate the evaluation. All evaluations use finite combinatorics; no analytic transforms or formal power-series inversion are used.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 9%
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.

Laika access coming soon