Results 11 to 20 of about 74 (71)
Regional Science Policy &Practice, Volume 15, Issue 6, Page 1299-1316, August 2023., 2023 Abstract The biggest barrier to an egalitarian Sub‐Saharan Africa (SSA) appears to be deeply ingrained structural obstacles and gender imbalances. The significant prevalence of gender inequities, which have both structural and economic ramifications, must be addressed if SSA is committed to achieving the Africa 2063 Agenda (the Africa we want) and ...
Wycliffe Obwori Alwago
wiley +1 more source
The false theta functions of Rodgers and their modularity
Bulletin of the London Mathematical Society, Volume 53, Issue 4, Page 963-980, August 2021., 2021 Abstract In this survey article, we explain how false theta functions can be embedded into a modular framework and show some of the applications of this modularity.
Kathrin Bringmann
wiley +1 more source
Maximum entropy and integer partitions [PDF]
, 2023 We derive asymptotic formulas for the number of integer partitions with given sums of \(j\)th powers of the parts for \(j\) belonging to a finite, non-empty set \(J \subset \mathbb N\).
McKinley, Gweneth +2 more
core +1 more source
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles [PDF]
, 2007 Cyclic Sums, Network Sharing and Restricted Edge Cuts in Graphs with Long Cycles Dieter Rautenbach , Lutz Volkmann Preprint series: 07-06, 8 MSC 2000 05A17 Partitions of integers 05C40 Connectivity Abstract We study graphs G = (V,E ...
Rautenbach, Dieter, Volkmann, Lutz
core +1 more source
Congruences in ordered pairs of partitions
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 47, Page 2509-2512, 2004., 2004 Dyson defined the rank of a partition (as the first part minus the number of parts) whilst investigating certain congruences in the sequence p−1(n). The rank has been widely studied as have been other statistics, such as the crank. In this paper a “birank” is defined which relates to ordered pairs of partitions, and is used in an elementary proof of a ...
Paul Hammond, Richard Lewis
wiley +1 more source
A Combinatorial proof of a partition identity of Andrews and Stanley
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 47, Page 2495-2501, 2004., 2004 In his paper, “On a partition function of Richard Stanley,” George Andrews proves a certain partition identity analytically and asks for a combinatorial proof.This paper provides the requested combinatorial proof.
Andrew V. Sills
wiley +1 more source
Computational proofs of congruences for 2‐colored Frobenius partitions
International Journal of Mathematics and Mathematical Sciences, Volume 29, Issue 6, Page 333-340, 2002., 2002 In 1994, the following infinite family of congruences was conjectured for the partition function cΦ2(n) which counts the number of 2‐colored Frobenius partitions of n: for all n ≥ 0 and α ≥ 1, cΦ2(5αn + λα) ≡ 0(mod5α), where λα is the least positive reciprocal of 12 modulo 5α. In this paper, the first four cases of this family are proved.
Dennis Eichhorn, James A. Sellers
wiley +1 more source
n‐Color partitions with weighted differences equal to minus two
International Journal of Mathematics and Mathematical Sciences, Volume 20, Issue 4, Page 759-768, 1997., 1997 In this paper we study those n‐color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to −2 Results obtained in this paper for these partitions include several combinatorial identities, recurrence relations, generating functions, relationships with the divisor function and computer produced tables.
A. K. Agarwal, R. Balasubrananian
wiley +1 more source
q‐Analogue of a binomial coefficient congruence
International Journal of Mathematics and Mathematical Sciences, Volume 18, Issue 1, Page 197-200, 1995., 1995 We establish a q‐analogue of the congruence where p is a prime and a and b are positive integers.
W. Edwin Clark
wiley +1 more source
Congruences involving F‐partition functions
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 1, Page 187-188, 1994., 1994 The primary goal of this note is to prove the congruence ϕ3(3n + 2) ≡ 0(mod3), where ϕ3(n) denotes the number of F‐partitions of n with at most 3 repetitions. Secondarily, we conjecture a new family of congruences involving cϕ2(n), the number of F‐partitions of n with 2 colors.
James Sellers
wiley +1 more source