Statistics in Weak Ascent Sequences

Toufik Mansour

doi:10.3390/math14081378

Statistics in Weak Ascent Sequences

Toufik Mansour

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

Weak ascent sequences are a generalization of ascent sequences that appear in many combinatorial problems. In this paper, we give a method to find generating functions that count how often a given statistic (Formula presented.) appears in weak ascent sequences of length n, keeping track of the number of weak ascents, where (Formula presented.) is the number of levels, ascents, descents, and weak descents.

Original language	English
Article number	1378
Journal	Mathematics
Volume	14
Issue number	8
Early online date	Apr 2026
DOIs	https://doi.org/10.3390/math14081378
State	Published - Apr 2026

Keywords

generating functions
generating trees
statistics
weak ascent sequences

ASJC Scopus subject areas

Computer Science (miscellaneous)
General Mathematics
Engineering (miscellaneous)

Access to Document

10.3390/math14081378

Cite this

@article{99f6d590f59d4c61a2558126c60b7d94,

title = "Statistics in Weak Ascent Sequences",

abstract = "Weak ascent sequences are a generalization of ascent sequences that appear in many combinatorial problems. In this paper, we give a method to find generating functions that count how often a given statistic (Formula presented.) appears in weak ascent sequences of length n, keeping track of the number of weak ascents, where (Formula presented.) is the number of levels, ascents, descents, and weak descents.",

keywords = "generating functions, generating trees, statistics, weak ascent sequences",

author = "Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2026 by the author.",

year = "2026",

month = apr,

doi = "10.3390/math14081378",

language = "English",

volume = "14",

journal = "Mathematics",

issn = "2227-7390",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "8",

}

TY - JOUR

T1 - Statistics in Weak Ascent Sequences

AU - Mansour, Toufik

PY - 2026/4

Y1 - 2026/4

N2 - Weak ascent sequences are a generalization of ascent sequences that appear in many combinatorial problems. In this paper, we give a method to find generating functions that count how often a given statistic (Formula presented.) appears in weak ascent sequences of length n, keeping track of the number of weak ascents, where (Formula presented.) is the number of levels, ascents, descents, and weak descents.

AB - Weak ascent sequences are a generalization of ascent sequences that appear in many combinatorial problems. In this paper, we give a method to find generating functions that count how often a given statistic (Formula presented.) appears in weak ascent sequences of length n, keeping track of the number of weak ascents, where (Formula presented.) is the number of levels, ascents, descents, and weak descents.

KW - generating functions

KW - generating trees

KW - statistics

KW - weak ascent sequences

UR - https://www.scopus.com/pages/publications/105037070604

U2 - 10.3390/math14081378

DO - 10.3390/math14081378

M3 - Article

SN - 2227-7390

VL - 14

JO - Mathematics

JF - Mathematics

IS - 8

M1 - 1378

ER -

Statistics in Weak Ascent Sequences

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this