Frobenius symbols for partitions and degrees of spin characters.
From recursions to asymptotics: On Szekeres' formula for the number of partitions.
Full subsets of .
Generalizations and refinements of a partition theorem of Göllnitz.
Generalizations of Dyson's rank and non-Rogers-Ramanujan partitions.
Generalizations of Schur's partition theorem.
Generalizing the combinatorics of binomial coefficients via -nomials.
Generating function for -restricted jagged partitions.
Generic extensions of nilpotent k[T]-modules, monoids of partitions and constant terms of Hall polynomials
We prove that the monoid of generic extensions of finite-dimensional nilpotent k[T]-modules is isomorphic to the monoid of partitions (with addition of partitions). This gives us a simple method for computing generic extensions, by addition of partitions. Moreover we give a combinatorial algorithm that calculates the constant terms of classical Hall polynomials.
Hales-Jewett's theorem without short cycles
Higher chain formula proved by combinatorics.
Historická perspektiva konečné matematiky
Hooks and powers of parts in partitions.
Ideal version of Ramsey's theorem
We consider various forms of Ramsey's theorem, the monotone subsequence theorem and the Bolzano-Weierstrass theorem which are connected with ideals of subsets of natural numbers. We characterize ideals with properties considered. We show that, in a sense, Ramsey's theorem, the monotone subsequence theorem and the Bolzano-Weierstrass theorem characterize the same class of ideals. We use our results to show some versions of density Ramsey's theorem (these are similar to generalizations shown in [P....
Identically distributed pairs of partition statistics.
Infinite families of divisibility properties modulo 4 for non-squashing partitions into distinct parts.
Integer partitions and convexity.
Integer partitions, tilings of -gons and lattices
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of -gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a -gon is the disjoint union of distributive lattices which we describe. We also discuss the special case of linear integer partitions, for which other dynamical models exist.
Integer Partitions, Tilings of 2D-gons and Lattices
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of 2D-gons (hexagons, octagons, decagons, etc.). We show that the sets of partitions, ordered with a simple dynamics, have the distributive lattice structure. Likewise, we show that the set of tilings of a 2D-gon is the disjoint union of distributive lattices which we describe. We also discuss the special case of linear integer partitions, for which other dynamical models exist.
Integer partitions with fixed subsums.