REVIEW 4 cited by
Notes on the combinatorial fundamentals of algebra
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is entirely expository (and written to a large extent as a repository for folklore proofs); no new results (and few, if any, new proofs) appear.
Forward citations
Cited by 4 Pith papers
-
On Noether's Degree Bound for Finite Group Schemes
For linearly reductive finite group schemes, invariant rings are generated in degree at most the order of the group scheme, while for α_q the required degree is unbounded.
-
An introduction to the symmetric group algebra
A self-contained, proof-heavy graduate text that develops the symmetric group algebra from scratch and proves the standard basis theorem, Garnir relations, hook length formula, and Murphy cellular bases.
-
An introduction to the algebra of rings and fields
A freely licensed undergraduate textbook covering rings, modules, polynomial rings, finite fields, quadratic reciprocity, Gröbner bases, and Smith normal form, with over 200 exercises.
-
An Introduction to Algebraic Combinatorics
A proof-heavy, open-access graduate textbook on algebraic combinatorics, including a full proof of the Littlewood-Richardson rule.
Discussion (0). Continue with ORCID to comment.