This entry provides a basic library for number partitions, defines the two-argument partition function through its recurrence relation and relates this partition function to the cardinality of number partitions. The main proof shows that the recursively-defined partition function with arguments n and k equals the cardinality of number partitions of n with exactly k parts. The combinatorial proo...

We calculate certain features of Bose–Einstein condensation in the ideal gas by using recurrence relations for the partition function. The grand canonical ensemble gives inaccurate results for certain properties of the condensate that are accurately provided by the canonical ensemble. Calculations in the latter can be made tractable for finite systems by means of the recurrence relations. The i...

1. Review of Fundamental Concepts...........................................................................................................4 Differential Equations.............................................................................................................................4 Difference Equations ........................................................................................

Survey of the qualitative properties of fractional difference operators: monotonicity, convexity, and asymptotic behavior of solutions" (2016). Faculty Publications, Department of Mathematics. 87. Abstract In this article we discuss some of the qualitative properties of fractional difference operators. We especially focus on the connections between the fractional difference operator and the mon...

We introduce the hypersymmetric functions of 2× 2 nonautonomous matrices and show that they are related, by simple expressions, to the Pochhammers (factorial polynomials) of these matrices. The hypersymmetric functions are generalizations of the associated elementary symmetric functions, and for a specific class of 2×2 matrices, having a high degree of symmetry, they reduce to these latter func...

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...

In order to obtain the conditions for the existence of periodic and almost periodic solutions of Volterra difference equations, x(n+1) = f(n, x(n))+ ∑n s=−∞ F (n, s, x(n+ s), x(n)), we consider certain stability properties, which are referred to as (K, ρ)-weakly uniformly-asymptotic stability and (K, ρ)-uniformly asymptotic stability. Moreover, we discuss the relationship between the ρ-separati...