Pith. sign in

REVIEW 1 major objections 5 minor 3 cited by

An Introduction to Algebraic Combinatorics

T0 review · 1 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read These lecture notes build the standard core of algebraic combinatorics—formal power series, partitions, permutations, determinants, symmetric functions—into one rigorous path that ends with a Bender–Knuth proof of the…

desk verdict A meticulous, essentially complete graduate textbook with no new theorems; its proofs are unusually careful, and the one acknowledged gap (Section 3.15) is minor, while the intricate Littlewood–Richardson proof looks solid. read the letter →

arxiv 2506.00738 v1 pith:J2GIMWCI submitted 2025-05-31 math.CO

Darij Grinberg This is my paper
classification math.CO MSC 05E0505A1705A1505E10
keywords formalpowerseriesgeneratingfunctionsintegerpartitionsq-binomialcoefficientssymmetricpolynomialsSchurLittlewood–Richardsonrulesign-reversinginvolutions
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

These lecture notes set out to provide a rigorous and essentially self-contained graduate introduction to algebraic combinatorics, organized as one continuous path from formal power series to the Littlewood–Richardson rule. The author's organizing claim is that the same few mechanical ideas—summable formal series, coefficient comparison, and sign-reversing involutions—carry every step, from the Fibonacci recurrence and Catalan numbers to the expansion of products of Schur polynomials. Along the way the notes give full proofs of Jacobi's triple product identity and of the Littlewood–Richardson rule via Bender–Knuth involutions, and they supply more than two hundred exercises without solutions. A sympathetic reader should take the book at its word: it is a course, not a research monograph, and its value lies in the completeness and explicitness of the derivations.

What carries the argument

The primary machinery is the ring of formal power series $K[[x]]$ over a commutative ring $K$, defined as sequences and equipped with coefficientwise addition and convolution multiplication. Two structural facts carry the early chapters: an FPS with invertible constant term has a unique inverse, and composition $f[g]$ is defined whenever $g$ has zero constant term; on top of this, the exponential and logarithm maps give mutually inverse group isomorphisms between the additive group of zero-constant series and the multiplicative group of one-constant series. In the symmetric-function chapter the central object is the Schur polynomial, a ratio of alternants indexed by integer partitions, and the Bender–Knuth involutions—sign-reversing maps on semistandard tableaux that toggle the count of entries equal to a given number—are the mechanism that proves the Littlewood–Richardson rule.

What would settle it

Compute the expansion $s_{(2,1)}\,s_{(1)} = s_{(3,1)} + s_{(2,2)} + s_{(2,1,1)}$ by running the notes' Section 7.3 Bender–Knuth involution on the semistandard tableaux contributing to the left-hand side; if any tableau is left unpaired outside the three expected Schur summands, the claimed proof has a gap.

Watch

Extended reading notes

Core claim

At the center of the notes is the claim that the core of algebraic combinatorics can be built rigorously from formal power series defined as sequences over a commutative ring, with summable families playing the role that convergence plays in analysis. On that foundation the notes prove the standard identities—Chu–Vandermonde, Euler's pentagonal number theorem, Jacobi's triple product, the Lindström–Gessel–Viennot lemma—and then develop symmetric polynomials to the point where Schur polynomials are defined as ratios of alternants. The capstone is a proof of the Littlewood–Richardson rule by Bender–Knuth involutions: a sign-reversing involution on semistandard tableaux cancels all unwanted contributions, leaving exactly the tableaux counted by Littlewood–Richardson coefficients. In the author's framing, the notes are an introduction rather than a research monograph; their explicit contribution is a single self-contained derivation chain ending at that rule.

Load-bearing premise

The load-bearing premise is that the Bender–Knuth involution proof of the Littlewood–Richardson rule in Sections 7.3.4 and 7.3.5 has no hidden gap; the notes' claim to be a rigorous introduction depends on that proof being complete.

Editorial extensions

If this is right

  • A student who works through the notes can derive Binet's formula, the Catalan-number formula, and Euler's pentagonal theorem from formal power series without leaving the ring-theoretic setting.
  • The Exp–Log isomorphism means that the usual exponential and logarithm identities hold for formal power series over any commutative $\mathbb{Q}$-algebra, including rings of finite characteristic where analysis is unavailable.
  • Jacobi's triple product identity implies Euler's pentagonal theorem and yields a recursion for the sum-of-divisors function, both of which the notes prove.
  • The Bender–Knuth proof of the Littlewood–Richardson rule gives a constructive, tableau-level explanation of why products of Schur polynomials have nonnegative integer coefficients.
  • The appendix's 200+ exercises provide a ready-made problem set for a quarter-long graduate course.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The notes leave implicit that the same involutive-cancellation technology used for the Littlewood–Richardson rule could in principle be adapted to prove other tableau product rules; the Pieri rules are treated as corollaries of the same setup rather than as independent targets.
  • Because the formal-power-series foundations work over arbitrary commutative rings, the generating-function arguments should transfer to combinatorial settings over finite fields and Boolean rings, where no notion of convergence is available; the notes include the Boolean-ring example but do not advertise this generality as a program.
  • A reader could test the pedagogical claim by turning the chapter's proofs into a formal proof assistant development; the Bender–Knuth sections are the natural stress point, since they contain the longest unformalized chain of cases.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 5 minor

Summary. The manuscript is a set of lecture notes for a graduate course in algebraic combinatorics. It develops formal power series over a commutative ring with unusual rigor, then treats integer partitions and q-binomial coefficients (including Jacobi's triple product identity), permutations and Lehmer codes, and subtractive methods such as inclusion–exclusion, sign-reversing involutions, determinants, and the Lindström–Gessel–Viennot lemma. The final chapter introduces symmetric and Schur polynomials and proves the Littlewood–Richardson rule via Bender–Knuth involutions, following Stembridge. An appendix contains over 200 exercises without solutions. The preface states that almost all of the notes are finished, with the sole exception of Section 3.15 (multivariate formal power series), which is admittedly only an overview.

Significance. If the proofs are correct, these notes constitute a valuable and unusually self-contained presentation of a standard body of algebraic combinatorics. The treatment of formal power series is rigorous and pedagogical, with explicit justification of infinite manipulations and honest discussion of the one delicate interchange in §3.5.2. The proof of the Littlewood–Richardson rule by Bender–Knuth involutions is a substantial pedagogical contribution, as is the inclusion of sign-reversing involutions and the LGV lemma as organizing themes. The transparent admission that Section 3.15 is unfinished is a sign of scholarly honesty, though it also creates a small gap in the claimed completeness. The notes are not machine-checked, but the human-written proofs are unusually detailed and the reader is directed to the original source for the most intricate argument.

major comments (1)
  1. [§3.15] The section titled 'Multivariate FPSs' is explicitly acknowledged in §1 as an overview rather than a finished treatment. Since the abstract and §1 present the notes as a rigorous introduction, including an unfinished section is a gap in scope, even though later chapters do not depend on it. The authors should either complete §3.15 or remove it from this version and adjust the scope statement accordingly.
minor comments (5)
  1. [§1] The sentence 'Almost all of these notes is in a finished state' is ungrammatical and also makes an imprecise promise; the exception (Section 3.15) should be noted in the table of contents or in the section header itself.
  2. [§3.5.2] The proof of Proposition 3.5.4(b) contains a self-described 'I have cheated' interlude. This is commendable, but the interlude could be made shorter by stating the summability condition up front and then referring to it in the main proof.
  3. [§3.6] Theorem 3.6.2(h) is cited to [Grinbe17]; since this fact is used in the proof of Theorem 3.7.5, it would be helpful to include a short proof directly in the notes.
  4. [§7.3.4] The Bender–Knuth involution proof is the most intricate argument in the notes. While I did not find a specific gap, it would help the reader to have a sentence stating that the proof follows Stembridge's version and that the crux is the fixed-point characterization.
  5. [Abstract] The abstract says the notes are 'written for a quarter-long graduate course'; adding a sentence noting that the text is self-contained apart from standard ring-theoretic prerequisites would better set expectations.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the derivations are self-contained and the self-citations are background-only.

full rationale

The derivation chain in these notes is self-contained. Chapter 3 constructs formal power series from definitions (sequences, sum, product, coefficient extraction, substitution, derivatives), proves the ring and substitution laws, and only then uses those tools to derive formulas such as Binet's formula, the Catalan generating function, and the Chu–Vandermonde identity. The later chapters are presented as standard combinatorial proofs leading to Jacobi's triple product identity and the Littlewood–Richardson rule; the latter is explicitly described as following the Bender–Knuth involution method “à la Stembridge”, an external source, rather than being forced by a prior result of the same author. Self-citations occur mainly in the prerequisites section, where the author points to his own notes for background algebra and enumerative combinatorics (e.g., [23wa], [22fco], [19fco]); these are inputs to the course, not load-bearing steps in the proofs of the target theorems. No fitted parameter is renamed as a prediction, no uniqueness theorem is imported from the author's prior work to forbid alternatives, and no equation in the available text reduces a claimed result to its own input by construction. The only acknowledged incompleteness, Section 3.15, is explicitly stated to be “currently an overview” and is not used to establish any later theorem. Therefore the paper shows no significant circularity and receives the lowest score.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters or invented entities appear; the notes use standard background algebra and combinatorics.

assumptions (5)
  • standard math Commutative ring axioms as presented in Definition 3.2.1
    The book builds FPSs on the assumed ring axioms; these are not proved but are standard background.
  • standard math K-algebra axioms (Definition 3.4.4)
    Substitution of polynomials into K-algebras relies on these axioms.
  • standard math Polynomial identity trick: two univariate polynomials over Q/R/C that agree on infinitely many points are equal
    Used in the proof of the Chu-Vandermonde identity (Theorem 3.2.21) to extend from N to C.
  • domain assumption K is a commutative Q-algebra
    Convention 3.7.1, needed to define exponentials, logarithms, and non-integer powers of FPSs.
  • domain assumption Basic enumerative combinatorics prerequisites: sum/product/bijection rules
    Section 2.2 assumes these, citing [Newste19] and the author's own [22fco].

how reviews work

0 comments
Cite this review

Pith. "Pith review of An Introduction to Algebraic Combinatorics." pith.science (2026). https://pith.science/paper/J2GIMWCI

@misc{pith2026250600738,
  author       = {Pith},
  title        = {Pith review of: An Introduction to Algebraic Combinatorics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/J2GIMWCI}},
  note         = {Machine review of arXiv:2506.00738}
}
read the original abstract

This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving Jacobi's triple product identity), permutations (Lehmer codes, cycles) and subtractive methods (alternating sums, cancellations and inclusion-exclusion principles, with a particular focus on sign-reversing involutions and determinants). The last chapter introduces symmetric polynomials and proves the Littlewood--Richardson rule using Bender--Knuth involutions (a la Stembridge). The appendix contains over 200 exercises (without solutions).

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Formalized $q$-series: The Rogers-Ramanujan Identities and Beyond

    math.NT 2026-07 unverdicted novelty 7.0 of 10

    The authors construct Lean libraries for q-series primitives and deliver verified proofs of the Jacobi triple product and Rogers-Ramanujan identities.

  2. How Your Credentials Are Leaked by LLM Agent Skills: An Empirical Study

    cs.CR 2026-04 conditional novelty 7.0 of 10

    Large-scale audit of SkillsMP agent skills finds 520 skills with 1,708 credential-leak issues, dominated by debug logging into the LLM context and hard-to-remediate forks.

  3. Top to random and reverse: analysis of a new descent algebra shuffle

    math.CO 2025-08 accept novelty 6.0 of 10

    Reversing the deck after a top-to-random shuffle gives an operator whose minimal polynomial is a product of distinct linear factors, with roots the signed knapsack numbers: for the basic reverse shuffle, the integers ...

Reference graph

Works this paper leans on

49 extracted references · 39 canonical work pages · cited by 3 Pith papers

  1. [1]

    http://www.cip.ifi.lmu.de/~grinberg/t/18f/hw4s-elafandi

    [17f-hw7s] Darij Grinberg, UMN Fall 2017 Math 4990 homework set #7 with solu- tions, http://www.cip.ifi.lmu.de/~grinberg/t/17f/hw7os.pdf [18f-hw2s] Darij Grinberg, UMN Fall 2018 Math 5705 homework set #2 with so- lutions, http://www.cip.ifi.lmu.de/~grinberg/t/18f/hw2s.pdf [18f-hw4s] Darij Grinberg, UMN Fall 2018 Math 5705 homework set #4 with so- lutions,...

    work page 2017

  2. [16]

    See https://site.uvm.edu/ddummit/files/2024/01/errata_ 3rd_edition_6_12_2022-1.pdf for errata

    ISBN: 978-0-471-43334-7. See https://site.uvm.edu/ddummit/files/2024/01/errata_ 3rd_edition_6_12_2022-1.pdf for errata. [EdeStr04] Alan Edelman and Gilbert Strang, Pascal Matrices, American Math- ematical Monthly, Vol. 111, No. 3 (March 2004), pp. 189–197. [Edward22] Harold M. Edwards, Essays in Constructive Mathematics , 2nd edi- tion, Springer

    work page 2024

  3. [17]

    See https://www.ericegge.net/cofsf/index.html for corrections and addenda. [EGHetc11] Pavel Etingof, Oleg Golberg, Sebastian Hensel, Tiankai Liu, Alex Schwendner, Dmitry Vaintrob, Elena Yudovina,Introduction to Rep- resentation Theory , with historical interludes by Slava Gerovitch, Student Mathematical Library 59, AMS 2011, updated version

    2011

  4. [21]

    https://www3.nd.edu/~dgalvin1/60610/60610_S21/index.html (Follow the Overleaf link and compile main.tex and Course-notes.tex. See also https://web.archive.org/web/ 20180205122609/http://www-users.math.umn.edu/~dgrinber/ comb/60610lectures2017-Galvin.pdf for an archived old ver- sion.) [Gashar98] Vesselin Gasharov, A Short Proof of the Littlewood–Richardso...

    work page Pith review arXiv 1998

  5. [22]

    Goodman, Algebra: Abstract and Concrete , edition 2.6, 1 May

    https://web.archive.org/web/20070824060559/http: //www.math.uwaterloo.ca/~dgwagner/MATH249/enum.pdf [Goodma15] Frederick M. Goodman, Algebra: Abstract and Concrete , edition 2.6, 1 May

    work page arXiv

  6. [24]

    [Grinbe17] Darij Grinberg, Why the log and exp series are mutually inverse , 11 May

    http://www.cip.ifi.lmu.de/~grinberg/primes2015/sols.pdf The numbering of theorems and formulas in this link might shift when the project gets updated; for a “frozen” version whose numbering is guaranteed to match that in the citations above, see https://github.com/darijgr/detnotes/releases/ tag/2022-09-15c or arXiv:2008.09862v3. [Grinbe17] Darij Grinberg,...

    arXiv 2022

  7. [25]

    https://www.cip.ifi.lmu.de/~grinberg/algebra/trach.pdf Math 701 Spring 2021, version 31 May 2025 page 696 [Grinbe20] Darij Grinberg, Alternierende Summen: Aufgaben und Lösungen , 28 June

    work page 2021

  8. [26]

    [GriRei20] Darij Grinberg, Victor Reiner, Hopf algebras in Combinatorics , version of 27 July 2020, arXiv:1409.8356v7

    https://www.cip.ifi.lmu.de/~grinberg/algebra/regpol.pdf [Grinbe23] Darij Grinberg, An introduction to graph theory, arXiv:2308.04512v2. [GriRei20] Darij Grinberg, Victor Reiner, Hopf algebras in Combinatorics , version of 27 July 2020, arXiv:1409.8356v7. See also http://www.cip.ifi.lmu.de/~grinberg/algebra/ HopfComb-sols.pdf for a version that gets update...

    arXiv 2020

Show all 49 references
  1. [27]

    [Hirsch87] Michael D

    See https://link.springer.com/chapter/10.1007/ 978-3-319-57762-3_44 for errata. [Hirsch87] Michael D. Hirschhorn, A simple proof of Jacobi’s four-square theorem, Proceedings of the American Mathematical Society 101 (1987), pp. 436–438. [Hopkin17] Sam Hopkins, RSK via local tra...

    1987

  2. [29]

    [KacChe02] Victor Kac, Pokman Cheung, Quantum Calculus, Springer

    https://web.archive.org/web/20160304122348/http: //www.permutationpuzzles.org/rubik/webnotes/ (link to the PDF at the bottom). [KacChe02] Victor Kac, Pokman Cheung, Quantum Calculus, Springer

  3. [30]

    Knapp, Basic Algebra , Digital Second Editions By Anthony W

    [Knapp16] Anthony W. Knapp, Basic Algebra , Digital Second Editions By Anthony W. Knapp, 2017, http://www.math.stonybrook.edu/ ~aknapp/download.html . [Knuth1] Donald Ervin Knuth, The Art of Computer Programming, volume 1: Fundamental Algorithms, 3rd edition, Addison–Wesley

    2017

  4. [34]

    8 (Oct., 1969), pp

    https://infinitedescent.xyz [Niven69] Ivan Niven, Formal Power Series , The American Mathematical Monthly 76, No. 8 (Oct., 1969), pp. 871–889. https://web.archive.org/web/20211114061642/https: //www.maa.org/sites/default/files/pdf/upload_library/ 22/Ford/IvanNiven.pdf [OlvSha1...

    1969

  5. [35]

    [Pak06] Igor Pak, Partition bijections, a survey , Ramanujan J 12 (2006), pp

    https://doi.org/10.1007/978-3-319-91041-3 See https://www-users.cse.umn.edu/~olver/ala.html for er- rata. [Pak06] Igor Pak, Partition bijections, a survey , Ramanujan J 12 (2006), pp. 5–75. See https://www.math.ucla.edu/~pak/papers/research.htm for a preprint and updates. [Pra...

    2006 doi

  6. [38]

    [Savage22] Alistair Savage, Symmetric Functions, lecture notes, 2 May

    https://mathweb.ucsd.edu/~ssam/188/notes-188.pdf [Sambal22] Benjamin Sambale, An invitation to formal power series , arXiv:2205.00879v5. [Savage22] Alistair Savage, Symmetric Functions, lecture notes, 2 May

    arXiv

  7. [41]

    [Stanko94] Zvezdelina E

    See https://web.archive.org/web/20240506043422/https: //mathcs.pugetsound.edu/~mspivey/Errata.html for errata. [Stanko94] Zvezdelina E. Stankova, Forbidden subsequences , Discrete Mathe- matics 132 (1994), pp. 291–316. [Stanle11] Richard P . Stanley, Enumerative Combinatorics,...

    1994

  8. [44]

    Math 701 Spring 2021, version 31 May 2025 page 702 [Tignol16] Jean-Pierre Tignol, Galois’ Theory of Algebraic Equations, 2nd edition, World Scientific

    https://scholarship.claremont.edu/hmc_theses/89/ [Talask12] Kelli Talaska, Determinants of weighted path matrices , arXiv:1202.3128v1. Math 701 Spring 2021, version 31 May 2025 page 702 [Tignol16] Jean-Pierre Tignol, Galois’ Theory of Algebraic Equations, 2nd edition, World Scientific

    2021 arXiv

  9. [45]

    [Uecker17] Torsten Ueckerdt, Lecture Notes Combinatorics (2017), 30 May

    2017

  10. [46]

    [Vorobi02] Nicolai N

    http://www.math.kit.edu/iag6/lehre/combinatorics2017s/ media/script.pdf See http://www.cip.ifi.lmu.de/~grinberg/algebra/ ueckerdt-script2017-errata.pdf for an inofficial list of er- rata. [Vorobi02] Nicolai N. Vorobiev, Fibonacci Numbers, Translated from the Rus- sian by Mirce...

    2002

  11. [47]

    Wagner, A First Course in Enumerative Combinatorics , Pure and Applied Undergraduate Texts 49, AMS

    https://web.archive.org/web/20221222034640/https: //math.sun.ac.za/swagner/NotesComb.pdf [Wagner20] Carl G. Wagner, A First Course in Enumerative Combinatorics , Pure and Applied Undergraduate Texts 49, AMS

  12. [48]

    pdf See http://www.cip.ifi.lmu.de/~grinberg/algebra/ symfuncs2017-2020-05-08-errata.pdf for an inofficial list of errata

    http://www.ma.rhul.ac.uk/~uvah099/Maths/Sym/SymFuncs2020. pdf See http://www.cip.ifi.lmu.de/~grinberg/algebra/ symfuncs2017-2020-05-08-errata.pdf for an inofficial list of errata. Math 701 Spring 2021, version 31 May 2025 page 703 [Wilf04] Herbert S. Wilf, generatingfunctionol...

    2020

  13. [49]

    https://garsia.math.yorku.ca/~zabrocki/math4160w03/ eulerpnt.pdf [Zeilbe85] Doron Zeilberger, A combinatorial approach to matrix algebra , Dis- crete Mathematics 56 (1985), pp. 61–72. [Zeilbe98] Doron Zeilberger, Dodgson’s Determinant-Evaluation Rule proved by Two-Timing Men a...

    1985 arXiv

  14. [1748]

    Math 701 Spring 2021, version 31 May 2025 page 694 [Fink17] Alex Fink, Enumerative Combinatorics, module taught at the London Taught Course Centre,

    2021

  15. [1867]

    Homological methods and representations of non-commutative algebras

    [Doyle19] Peter G. Doyle, Frobenius’s last proof, arXiv:1904.06573v1. See http://www.cip.ifi.lmu.de/~grinberg/algebra/ doyle-frob-errata.pdf for corrections. [Dumas08] François Dumas, An introduction to noncommutative polynomial in- variants, lecture notes (Cimpa-Unesco-Argent...

    1904 arXiv

  16. [1974]

    [Bresso99] David M

    [Brande14] Petter Brändén, Unimodality, log-concavity, real-rootedness and be- yond, arXiv:1410.6601v1. [Bresso99] David M. Bressoud, Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture , Cambridge University Press

    arXiv

  17. [1988]

    https://web.archive.org/web/20180328002253/http: //www-igm.univ-mlv.fr/~al/ [MuiMet60] Thomas Muir, A Treatise on the Theory of Determinants , revised and enlarged by William H

    Math 701 Spring 2021, version 31 May 2025 page 699 [Muir30] Thomas Muir, The theory of determinants in the historical order of development, 5 volumes (1906–1930), later reprinted by Dover. https://web.archive.org/web/20180328002253/http: //www-igm.univ-mlv.fr/~al/ [MuiMet60] T...

    2021

  18. [1991]

    [BruSch83] Richard A. Brualdi and Hans Schneider, Determinantal Identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley, Linear Algebra and its Applications 52–53, July 1983, pp. 769–791. [Camero16] Peter J. Cameron, Combinatorics 1: Th...

    1983

  19. [1996]

    [Kratte17] Christian Krattenthaler, Lattice Path Enumeration , arXiv:1503.05930v3, published in: Handbook of Enumerative Combinatorics, M

    https://kraftadmin.wixsite.com/hpkraft See http://www.cip.ifi.lmu.de/~grinberg/algebra/ KP-errata-web.pdf for unofficial errata. [Kratte17] Christian Krattenthaler, Lattice Path Enumeration , arXiv:1503.05930v3, published in: Handbook of Enumerative Combinatorics, M. Bóna (ed....

    1999 arXiv

  20. [1997]

    [GaiGup77] P

    See https://mathoverflow.net/questions/456463 for errata. [GaiGup77] P . Gaiha, S. K. Gupta, Adjacent Vertices on a Permutohedron , SIAM Journal on Applied Mathematics 32 (1977), issue 2, pp. 323–327. [Galvin17] David Galvin, Basic discrete mathematics, 13 December

    1977

  21. [1999]

    [Brewer14] Thomas S

    See http://web.archive.org/web/20220531023303/https: //www.macalester.edu/~bressoud/books/PnC/PnCcorrect.html for errata. [Brewer14] Thomas S. Brewer, Algebraic properties of formal power series compo- sition, PhD thesis at University of Kentucky,

  22. [2001]

    [Sagan19] Bruce Sagan, Combinatorics: The Art of Counting , Graduate Studies in Mathematics 210, 21 September

    https://doi.org/10.1007/978-1-4757-6804-6 See https://users.math.msu.edu/users/bsagan/Books/Sym/ errata.pdf for errata. [Sagan19] Bruce Sagan, Combinatorics: The Art of Counting , Graduate Studies in Mathematics 210, 21 September

    doi

  23. [2003]

    [LLPT95] D

    [Laue15] Hartmut Laue, Determinants, version 17 May 2015, http://www.math.uni-kiel.de/algebra/laue/homepagetexte/ det.pdf . [LLPT95] D. Laksov, A. Lascoux, P . Pragacz, and A. Thorup, The LLPT Notes, edited by A. Thorup, 28 March 2018, http://web.math.ku.dk/noter/filer/sympol....

    2015

  24. [2004]

    Benjamin and Jennifer J

    [BenQui08] Arthur T. Benjamin and Jennifer J. Quinn, An Alternate Approach to Alternating Sums: A Method to DIE for , The College Mathematics Journal, Volume 39, Number 3, May 2008, pp. 191-202(12). [Berndt06] Bruce C. Berndt, Number Theory in the Spirit of Ramanujan , Student...

    2008

  25. [2005]

    [BluCos16] Ben Blum-Smith, Samuel Coskey, The Fundamental Theorem on Symmetric Polynomials: History’s First Whiff of Galois Theory , arXiv:1301.7116v5

    See https://www.mat.uniroma2.it/~brenti/correct.ps for er- rata. [BluCos16] Ben Blum-Smith, Samuel Coskey, The Fundamental Theorem on Symmetric Polynomials: History’s First Whiff of Galois Theory , arXiv:1301.7116v5. Math 701 Spring 2021, version 31 May 2025 page 692 [Bona22] ...

    2021 arXiv

  26. [2006]

    [Berndt17] Bruce C

    See https://berndt.web.illinois.edu/spiritcorrections.pdf for errata. [Berndt17] Bruce C. Berndt, Spring 2017, MATH

    2017

  27. [2007]

    Robinson, The classical adjoint , Linear Algebra and its Applications 411 (2005), pp

    [Quinla21] Rachel Quinlan, MA3343 Groups, Semester 2020-2021, http://www.maths.nuigalway.ie/~rquinlan/groups/ Math 701 Spring 2021, version 31 May 2025 page 700 [Robins05] Donald W. Robinson, The classical adjoint , Linear Algebra and its Applications 411 (2005), pp. 254–276. ...

    2005

  28. [2008]

    487– 495, arXiv:math/0407093v1

    http://arpeg.nl/wp-content/uploads/2016/01/CoxNotes.pdf [Cohn04] Henry Cohn, Projective geometry over F1 and the Gaussian binomial coefficients, American Mathematical Monthly 111 (2004), pp. 487– 495, arXiv:math/0407093v1. Math 701 Spring 2021, version 31 May 2025 page 693 [Co...

    2004 arXiv

  29. [2009]

    pdf [Smith95] Larry Smith, Polynomial Invariants of Finite Groups, A K Peters

    https://web.archive.org/web/20230523111347/https: //faculty.math.illinois.edu/~nirobles/files453/iep_proof. pdf [Smith95] Larry Smith, Polynomial Invariants of Finite Groups, A K Peters

  30. [2010]

    Rings First

    [Bell06] Jordan Bell, Euler and the pentagonal number theorem , arXiv:math/0510054v2. [Benede25] Bruno Benedetti, Introduction to Abstract Algebra “Rings First” , lec- ture notes, 6 March

    arXiv

  31. [2012]

    [Stanle15] Richard P

    See http://math.mit.edu/~rstan/ec/ for a draft (2021) and er- rata. [Stanle15] Richard P . Stanley, Catalan Numbers, 1st edition, Cambridge Uni- versity Press

    2021

  32. [2015]

    [GouJac83] I

    http://homepage.math.uiowa.edu/~goodman/algebrabook.dir/ book.2.6.pdf . [GouJac83] I. P . Goulden, D. M. Jackson, Combinatorial Enumeration, John Wiley & Sons 1983, reprinted by Dover

    1983

  33. [2016]

    http://www.personal.psu.edu/gea1/pdf/317.pdf [ApaKau13] Ainhoa Aparicio Monforte, Manuel Kauers, Formal Laurent series in several variables, Expositiones Mathematicae, 31(4), pp. 350–367. Math 701 Spring 2021, version 31 May 2025 page 691 [Armstr19] Drew Armstrong, Abstract Al...

    2021

  34. [2017]

    9 (Nov., 2000), pp

    https://berndt.web.illinois.edu/math595-tp.html [Bharga00] Manjul Bhargava, The Factorial Function and Generalizations , The American Mathematical Monthly 107, No. 9 (Nov., 2000), pp. 783–

    2000

  35. [2018]

    Erdös, On an elementary proof of some asymptotic formulas in the theory of partitions, Annals of Mathematics 43 (1942), pp

    [Erdos42] P . Erdös, On an elementary proof of some asymptotic formulas in the theory of partitions, Annals of Mathematics 43 (1942), pp. 437–450. [Euler48] Leonhard Euler, Introductio in analysin infinitorum, tomus 1 , Lau- sannæ

    1942

  36. [2019]

    https://www.cip.ifi.lmu.de/~grinberg/t/19s/mt3s.pdf [19fco] Darij Grinberg, Enumerative Combinatorics: class notes (Drexel Fall 2019 Math 222 notes), 11 September

    http://www.cip.ifi.lmu.de/~grinberg/t/19s/notes.pdf [19s-mt3s] Darij Grinberg, Math 4281: Introduction to Modern Algebra, Spring 2019: Midterm 3 with solutions . https://www.cip.ifi.lmu.de/~grinberg/t/19s/mt3s.pdf [19fco] Darij Grinberg, Enumerative Combinatorics: class notes ...

    2019

  37. [2020]

    Math 701 Spring 2021, version 31 May 2025 page 697 [Joyner08] W. D. Joyner, Mathematics of the Rubik’s cube, 19 August

    2021

  38. [2021]

    https://www.cip.ifi.lmu.de/~grinberg/t/22fco/ [23wa] Darij Grinberg, An introduction to the algebra of rings and fields , 10 March

    http://www.cip.ifi.lmu.de/~grinberg/t/20f/mps.pdf [22fco] Darij Grinberg, Math 220: Enumerative Combinatorics, Fall 2022 . https://www.cip.ifi.lmu.de/~grinberg/t/22fco/ [23wa] Darij Grinberg, An introduction to the algebra of rings and fields , 10 March

    2022

  39. [2022]

    https://doi.org/10.1201/9780429274107 [Bourba02] Nicolas Bourbaki, Lie Groups and Lie Algebras: Chapters 4–6 , Springer

    doi

  40. [2023]

    [Stanle89] Richard P

    See http://math.mit.edu/~rstan/ec/ for errata. [Stanle89] Richard P . Stanley, Log-Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry, Annals of the New York Academy of Sciences, 576 (1 Graph Theory), pp. 500–535. [Stembr02] John R. Stembridge, A Concise Pr...

    2002

  41. [2024]

    Spivey, The Art of Proving Binomial Identities , CRC Press

    Math 701 Spring 2021, version 31 May 2025 page 701 [Spivey19] Michael Z. Spivey, The Art of Proving Binomial Identities , CRC Press

    2021

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.