Pith. sign in

REVIEW 1 cited by

Parity statistics on restricted permutations and the Catalan--Schett polynomials

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.01558 v1 pith:NXCLQV6U submitted 2024-09-03 math.CO

classification math.CO
keywords permutationsascentsavoidingcatalan--schettkitaevnon-overlappingparitypolynomials
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Motivated by Kitaev and Zhang's recent work on non-overlapping ascents in stack-sortable permutations and Dumont's permutation interpretation of the Jacobi elliptic functions, we investigate some parity statistics on restricted permutations. Some new related bijections are constructed and two refinements of the generating function for descents over $321$-avoiding permutations due to Barnabei, Bonetti and Silimbanian are obtained. In particular, an open problem of Kitaev and Zhang about non-overlapping ascents on $321$-avoiding permutations is solved and several combinatorial interpretations for the Catalan--Schett polynomials are found. The stack-sortable permutations are at the heart of our approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bijections in weakly increasing trees via binary trees

    math.CO 2025-02 conditional novelty 7.0 of 10

    Switching left and right branches in binary trees yields new bijections on weakly increasing trees, reproving and generalizing known symmetries on plane trees and 312-avoiding permutations.

Pith tools