具有初始重复的一类分区的勒让德定理

IF 0.6 4区数学 Q4 MATHEMATICS, APPLIED

Annals of Combinatorics Pub Date : 2024-06-25 DOI:10.1007/s00026-024-00706-1

Darlison Nyirenda, Beaullah Mugwangwavari

引用次数: 0

摘要

乔治-安德鲁斯（George Andrews）提出了具有初始重复的分区。我们考虑了这些分区的一个子类，并找到了与它们各自的分区函数相关的勒让德定理。这些结果反过来又为露西-J-斯莱特（Lucy J. Slater）提出的一些罗杰斯-拉玛努扬（Rogers-Ramanujan）等式提供了分区理论解释。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Legendre Theorems for a Class of Partitions with Initial Repetitions

Partitions with initial repetitions were introduced by George Andrews. We consider a subclass of these partitions and find Legendre theorems associated with their respective partition functions. The results in turn provide partition-theoretic interpretations of some Rogers–Ramanujan identities due to Lucy J. Slater.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Annals of Combinatorics 数学-应用数学

CiteScore

1.00

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches