Pith. sign in

REVIEW

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 2404.04091 v1 pith:4O4U4CL3 submitted 2024-04-05 math.CO

Bijections on pattern avoiding inversion sequences and related objects

classification math.CO
keywords avoidingnumberinversionpathssequencesbijectionsobjectobjects
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The number of inversion sequences avoiding two patterns $101$ and $102$ is known to be the same as the number of permutations avoiding three patterns $2341$, $2431$, and $3241$. This sequence also counts the number of Schr\"{o}der paths without triple descents, restricted bicolored Dyck paths, $(101,021)$-avoiding inversion sequences, and weighted ordered trees. We provide bijections to integrate them together by introducing $F$-paths. Moreover, we define three kinds of statistics for each of the objects and count the number of each object with respect to these statistics. We also discuss direct sums of each object.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.