Integer Partitions from the Polyhedral Point of View

We characterize integer partitions that are convex combinations of two partitions, which connects vertices of the partition polytopes with Sidon sets and sum-free sets. We prove that all vertices of the partition polytope can be generated from a subset of support vertices with the use of two operations of merging parts. Application of either operation results in an adjacent vertex. We present also some numerical data on vertices.     

On the structure of a random sum-free set of positive integers

Cameron introduced a natural probability measure on the set of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability measure. He showed that the set of subsets of the odd numbers has a positive probability, and that the set of subsets of any sum-free set corresponding to a complete modular sum-free set also has a positive probability of occurring. In this paper we consider, for every sum-free set S, the representation function r_s(n), and show that if r_s(n) grows sufficiently quickly then the set of subsets of S has positive probability, and conversely, that if r_s(n) has a sub-sequence with suitably slow growth, then the set of subsets of S has probability zero. The results include those of Cameron mentioned above as particular cases.     

On a partition identity of Lehmer

Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the excess of the number of parts in all partitions of n into odd parts over the number of parts in all partitions of n into distinct parts equals the number of partitions of n with exactly one even part (possibly repeated). Beck's original conjecture was followed by generalizations and so-called “Beck-type” companions to other identities.In this paper, we establish a collection of Beck-type companion identities to the following result mentioned by Lehmer at the 1974 International Congress of Mathematicians: the excess of the number of partitions of n with an even number of even parts over the number of partitions of n with an odd number of even parts equals the number of partitions of n into distinct, odd parts. We also establish various generalizations of Lehmer's identity, and prove related Beck-type companion identities. We use both analytic and combinatorial methods in our proofs.     

Partitions with Non-Repeating Odd Parts and Combinatorial Identities

Continuing our earlier work on partitions with non-repeating odd parts and q-hypergeometric identities, we now study these partitions combinatorially by representing them in terms of 2-modular Ferrers graphs. This yields certain weighted partition identities with free parameters. By special choices of these parameters, we connect them to the Göllnitz-Gordon partitions, and combinatorially prove a modular identity and some parity results. As a consequence, we derive a shifted partition theorem mod 32 of Andrews. Finally we discuss basis partitions in connection with the 2-modular representation of partitions with non-repeating odd parts, and deduce two new parity results involving partial theta series.     

Combinatorial proofs and generalizations of conjectures related to Euler’s partition theorem

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck. Subsequently, using the same method as Andrews, Chern presented the analytic proof of another Beck’s conjecture relating the gap-free partitions and distinct partitions with odd length. However, the combinatorial interpretations of these conjectures are still unclear and required. In this paper, motivated by Glaisher’s bijection, we give the combinatorial proofs of these three conjectures directly or by proving more generalized results.     

The dual form of Beck type identities

The Ramanujan Journal - Inspired by Andrews and Merca’s recent work on the number of even parts over all partitions into distinct parts, we introduce a new kind of Beck type identities, which...     

On the combinatorics of the number of even parts in all partitions with distinct parts

The Ramanujan Journal - Recently, Andrews and Merca obtained two identities concerning the number of even parts in all partitions of n into distinct parts. In this paper, we provide bijective...     

A combinatorial study and comparison of partial theta identities of Andrews and Ramanujan

We provide a simple proof of a partial theta identity of Andrews and study the underlying combinatorics. This yields a weighted partition theorem involving partitions into distinct parts with smallest part odd which turns out to be a companion to a weighted partition theorem involving the same partitions that we recently deduced from a partial theta identity in Ramanujan’s Lost Notebook. We also establish some new partition identities from certain special cases of Andrews’ partial theta identity.     

Weighted forms of Euler's theorem

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's “lost” notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by the insight of Andrews on the connection between Ramanujan's identities and Euler's theorem. Our combinatorial formulations of Ramanujan's identities rely on the notion of rooted partitions. Pak's iterated Dyson's map and Sylvester's fish-hook bijection are the main ingredients in the weighted forms of Euler's theorem.     

False theta functions and companions to Capparelli's identities

Capparelli conjectured two modular identities for partitions whose parts satisfy certain gap conditions, which were motivated by the calculation of characters for the standard modules of certain affine Lie algebras and by vertex operator theory. These identities were subsequently proved and refined by Andrews, who related them to Jacobi theta functions, and also by Alladi–Andrews–Gordon, Capparelli and Tamba–Xie. In this paper we prove two new companions to Capparelli's identities, where the evaluations are expressed in terms of Jacobi theta functions and false theta functions.     

On the number of equivalence classes arising from partition involutions II

In this paper, we consider the pseudo-conjugation and its variations on the sets of partitions with restricted cranks and involutions on Frobenius symbols. We give several partition identities revealing relations between the number of equivalence classes in the set of partitions arising from an involution and the number of partitions satisfying a certain parity condition.     

New weighted Rogers-Ramanujan partition theorems and their implications

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of Göllnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at least two. Consequences of this include Jacobi's celebrated triple product identity for theta functions, Sylvester's famous refinement of Euler's theorem, as well as certain weighted partition identities. Next, by studying partitions with prescribed bounds on successive ranks and replacing these with weighted Rogers-Ramanujan partitions, we obtain two new sets of theorems - a set of three theorems involving partitions into parts (mod 6), and a set of three theorems involving partitions into parts (mod 7), .

     

Odd‐sized partitions of Russell‐sets

In the setting of ZF, i.e., Zermelo–Fraenkel set theory without the Axiom of Choice (AC), we study partitions of Russell‐sets into sets each with exactly n elements (called n ‐ary partitions), for some integer n. We show that if n is odd, then a Russell‐set X has an n ‐ary partition if and only if |X | is divisible by n. Furthermore, we establish that it is relative consistent with ZF that there exists a Russell‐set X such that |X | is not divisible by any finite cardinal n > 1 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets

Covering rough sets generalize traditional rough sets by considering coverings of the universe instead of partitions, and neighborhood-covering rough sets have been demonstrated to be a reasonable selection for attribute reduction with covering rough sets. In this paper, numerical algorithms of attribute reduction with neighborhood-covering rough sets are developed by using evidence theory. We firstly employ belief and plausibility functions to measure lower and upper approximations in neighborhood-covering rough sets, and then, the attribute reductions of covering information systems and decision systems are characterized by these respective functions. The concepts of the significance and the relative significance of coverings are also developed to design algorithms for finding reducts. Based on these discussions, connections between neighborhood-covering rough sets and evidence theory are set up to establish a basic framework of numerical characterizations of attribute reduction with these sets.     

A Note on Partitions into Distinct Parts and Odd Parts

Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijection implies the above statement.     

Partition-Theoretic Interpretations of Certain Modular Equations of Schröter,Russell, and Ramanujan

We show that certain modular equations studied by Schr?oter, Russell, and Ramanujan yield elegant identities for colored partitions. Received May 3, 2006 Bruce C. Berndt: Research partially supported by grant MDA904-00-1-0015 from the National Security Agency.     

Generalizations of two identities of Guo and Yang

In this paper, we provide generalizations of two identities of Guo and Yang [2] for the q-binomial coe?cients. This approach allows us to derive new convolution identities for the complete and elementary symmetric functions. New identities involving q-binomial coe?cients are obtained as very special cases of these results. A new relationship between restricted partitions and restricted partitions into parts of two kinds is derived in this context.     

Partition Identities Involving Gaps and Weights,II

In this second paper under the same title, some more weighted representations are obtained for various classical partition functions including p(n), the number of unrestricted partitions ofn , Q(n), the number of partitions ofn into distinct parts and the Rogers-Ramanujan partitions ofn (of both types). The weights derived here are given either in terms of congruence conditions satisfied by the parts or in terms of chains of gaps between the parts. Some new connections between partitions of the Rogers-Ramanujan, Schur and Göllnitz–Gordon type are revealed.     

A Bijective Toolkit for Signed Partitions

The recently formalized idea of signed partitions is examined with intent to expand the standard repertoire of mappings and statistics used in bijective proofs for ordinary partition identities. A new family of partitions is added to Schur’s Theorem and observations are made concerning the behavior of signed partitions of zero in arithmetic progression.