RECORD
Counting $r\times s$ rectangles in nondecreasing and Smirnov words
Combinatorics · Submitted 27 Jun 2024
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim In this work we find the bivariate generating function for the distribution on nondecreasing words of the number of $r\times s$ rectangles and the generating function for their total number over all nondecreasing words.
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
The rectangle capacity, a word statistic that was recently introduced by the author and Mansour, counts, for two fixed positive integers $r$ and $s$, the number of occurrences of a rectangle of size $r\times s$ in the bargraph representation of a word. In this work we find the bivariate generating function for the distribution on nondecreasing words of the number of $r\times s$ rectangles and the generating function for their total number over all nondecreasing words. We also obtain the analog results for Smirnov words, which are words that have no consecutive equal letters. This complements our recent results concerned with general words (i.e., not restricted) and Catalan words.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The rectangle capacity, a word statistic that was recently introduced by the author and Mansour, counts, for two fixed positive integers $r$ and $s$, the number of occurrences of a rectangle of size $r\times s$ in the bargraph representation of a word. | background 1.00 | 0.26 | 0.04 | asserted 1.00 |
| s1 | In this work we find the bivariate generating function for the distribution on nondecreasing words of the number of $r\times s$ rectangles and the generating function for their total number over all nondecreasing words. | contribution 0.55 | 0.97 | 0.67 | asserted 1.00 |
| s2 | We also obtain the analog results for Smirnov words, which are words that have no consecutive equal letters. | contribution 0.56 | 0.94 | 0.12 | asserted 1.00 |
| s3 | This complements our recent results concerned with general words (i.e., not restricted) and Catalan words. | background 0.80 | 0.73 | 0.05 | asserted 0.99 |
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
The rectangle capacity, a word statistic that was recently introduced by the author and Mansour, counts, for two fixed positive integers $r$ and $s$, the number of occurrences of a rectangle of size $r\times s$ in the bargraph representation of a word. In this work we find the bivariate generating function for the distribution on nondecreasing words of the number of $r\times s$ rectangles and the generating function for their total number over all nondecreasing words. We also obtain the analog results for Smirnov words, which are words that have no consecutive equal letters. This complements our recent results concerned with general words (i.e., not restricted) and Catalan words.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites
Builds on 1 paper
-
In this work we continue the study of a new statistic, that was introduced by the author and Mansour in [ref] , called rectangle capacity.
Counting $r\times s$ rectangles in (Catalan) words · Introduction · 0.93
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.