Skip to content
DraconiticResearch
Search Sources API
194,164 studies31 sourcesUpdated 45 min ago
PreprintarXiv licencearXiv

Laurentness of Svinin's even-order recurrences

  • Qiyue Tang
Open at sourcePDFDOICite

Abstract

We prove every term of Svinin's even-order recurrences is a Laurent polynomial in the initial values.

Related

  1. Ad-conditions for higher-order recurrences: Dunkl and matrix-valued settings
    I. Bono Parisi, F. A. Grünbaum, I. Zurrián
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. Minimum net-saturated graphs of even order
    Xuanyu Cao, Chunxiang Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Equivalence of Fixed-Rank and Rank-One Even-Order Symmetric Tensor Factorization
    Ruba Hussen Morsi, Anas A. Rahman
    arXivPreprintCC BY 4.0Full textMathematical physicsStatisticsarXiv
  4. Counting transversals in Latin squares over groups of even order
    James A. Davis, Jonathan Jedwab, Ian M. Wanless +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Recurrences for permutations with long increasing subsequences
    Manuel Kauers, Chen Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{tang2026laurentness,
  title = {{Laurentness of Svinin's even-order recurrences}},
  author = {Qiyue Tang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.00307},
  eprint = {2610.00307},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.00307},
}
RIS
TY  - UNPB
TI  - Laurentness of Svinin's even-order recurrences
AU  - Qiyue Tang
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.00307
UR  - https://arxiv.org/abs/2610.00307
AB  - We prove every term of Svinin's even-order recurrences is a Laurent polynomial in the initial values.
ER  -