RECORD
Bijections for generalized Wilf equivalences
Combinatorics · Submitted 29 Oct 2024
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We apply this method to identities for generalized Wilf equivalences among consecutive patterns in inversion sequences, giving direct bijective proofs of some generalized Wilf equivalences shown by Auli and Elizalde.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized Wilf equivalences among consecutive patterns in inversion sequences, giving direct bijective proofs of some generalized Wilf equivalences shown by Auli and Elizalde. We also give new bijective proofs of a stronger relation among some consecutive patterns.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). | method 0.93 | 0.43 | 0.21 | asserted 0.80 |
| s1 | We apply this method to identities for generalized Wilf equivalences among consecutive patterns in inversion sequences, giving direct bijective proofs of some generalized Wilf equivalences shown by Auli and Elizalde. | contribution 0.90 | 0.94 | 0.50 | asserted 1.00 |
| s2 | We also give new bijective proofs of a stronger relation among some consecutive patterns. | contribution 0.81 | 0.96 | 0.17 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized Wilf equivalences among consecutive patterns in inversion sequences, giving direct bijective proofs of some generalized Wilf equivalences shown by Auli and Elizalde. We also give new bijective proofs of a stronger relation among some consecutive patterns.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.