Refinements and Generalizations of Capparelli′s Conjecture on Partitions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjecture of Andrews on Partitions

Definition 1.2. For an even integer λ, let Aλ,k,a(n) denote the number of partitions of n into parts such that no part which is not equivalent to 0(mod λ+ 1) may be repeated and no part is equivalent to 0,±(a−λ/2)(λ+1)mod[(2k−λ+1)(λ+1)]. For an odd integer λ, let Aλ,k,a(n) denote the number of partitions of n into parts such that no part which is not equivalent to 0(mod((λ+1)/2)) may be repeate...

متن کامل

Some refinements and generalizations of Carleman's inequality

The constant is the best possible. There is a vast literature which deals with alternative proofs, various generalizations and extensions, and numerous variants and applications in analysis of inequality (1.1); see [1, 2, 3, 5, 7, 9, 8, 10, 13, 14, 15, 16, 17, 18, 19] and the references given therein. According to Hardy (see [6, Theorem 349]), Carleman’s inequality was generalized as follows. I...

متن کامل

Generalizations and Refinements for Nesbitt’s Inequality

In this paper we present a new generalizations and refinements for Nesbitt’s inequality (see [5]). In every section, we give example of inequalities by particularization.

متن کامل

Term Partitions and Minimal Generalizations of Clauses

Term occurrences of any clause C are determined by their positions. The set of all term partitions defined on subsets of term occurrences of C form a partially ordered set. This poset is isomorphic to the set of all generalizations of C. The structure of this poset can be inferred from the term occurrences in C alone. We can apply these constructions in this poset in machine learning.

متن کامل

Generalizations of Graham's pebbling conjecture

We investigate generalizations of pebbling numbers and of Graham’s pebbling conjecture that π(G × H) ≤ π(G)π(H), where π(G) is the pebbling number of the graph G. We develop new machinery to attack the conjecture, which is now twenty years old. We show that certain conjectures imply others that initially appear stronger. We also find counterexamples that show that Sjöstrand’s theorem on cover p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1995

ISSN: 0021-8693

DOI: 10.1006/jabr.1995.1144