Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 22 min ago
Peer-reviewedLicence not statedActa Mathematica Sinica English Series

Increasing Paths on N-ary Trees

  • Xinxin Chen1,2
  1. 1School of Mathematical Sciences, Beijing Normal University, Beijing, 100875, P. R. China
  2. 2LPMA - Laboratoire de Probabilités et Modèles Aléatoires (France)
Open at sourcePDFDOICite

Related

  1. Wold-type decompositions for norm-increasing m-concave weighted shifts on directed trees
    Ashish Kujur
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. Some advances on stretching operations applied to cliques of edge intersection graphs of paths in trees
    Mariana Escalante, Victoria Kaial, Annegret K Wagler
    HALPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsHAL
  3. Log-concavity of longest increasing subsequence
    Yupeng Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  4. Recurrences for permutations with long increasing subsequences
    Manuel Kauers, Chen Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. How much do increasing events occur disjointly?
    Pierre Tesio
    HALPreprintCC BY 4.0Full textProbabilityHALarXiv

Cite

BibTeXRIS
BibTeX
@article{chen2026increasing,
  title = {{Increasing Paths on N-ary Trees}},
  author = {Xinxin Chen},
  journal = {Acta Mathematica Sinica English Series},
  year = {2026},
  month = jun,
  doi = {10.1007/s10114-026-5033-9},
  url = {https://doi.org/10.1007/s10114-026-5033-9},
}
RIS
TY  - JOUR
TI  - Increasing Paths on N-ary Trees
AU  - Xinxin Chen
PY  - 2026
DA  - 2026/06/01
JO  - Acta Mathematica Sinica English Series
DO  - 10.1007/s10114-026-5033-9
UR  - https://doi.org/10.1007/s10114-026-5033-9
SN  - 1439-7617
SN  - 1439-8516
ER  -