Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Enumeration of plane partitions with a restricted number of parts  [PDF]
Andrij Rovenchak
Mathematics , 2014, DOI: 10.1007/s11232-014-0223-5
Abstract: In the paper, the quantum-statistical approach is used to estimate the number of restricted plane partitions of an integer $n$ with the number of parts not exceeding some finite $N$. The analogy between this number-theoretical problem and the enumeration of microstates of the ideal two-dimensional Bose-gas is used. The conjectured expression for the number of restricted plane partitions shows a good agreement between calculated and exact values for $n=10\div20$.
Congruences on the Number of Restricted $m$-ary Partitions  [PDF]
Qing-Hu Hou,Hai-Tao Jin,Yan-Ping Mu,Li Zhang
Mathematics , 2015,
Abstract: Andrews, Brietzke, R\o dseth and Sellers proved an infinite family of congruences on the number of the restricted $m$-ary partitions when $m$ is a prime. In this note, we show that these congruences hold for arbitrary positive integer $m$ and thus confirm the conjecture of Andrews, et al.
Restricted k-color partitions  [PDF]
William J. Keith
Mathematics , 2014,
Abstract: We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems: generating function dissections, modular forms, bijections, and other combinatorial maps. We find connections to divisor sums, the Han/Nekrasov-Okounkov hook length formula and a possible approach to a finitization, and other topics, suggesting that a rich mine of results is available.
Generating function for K-restricted jagged partitions  [PDF]
J. -F. Fortin,P. Jacob,P. Mathieu
Mathematics , 2003,
Abstract: We present a natural extension of Andrews' multiple sums counting partitions with difference 2 at distance $k-1$, by deriving the generating function for $K$-restricted jagged partitions. A jagged partition is a collection of non-negative integers $(n_1,n_2,..., n_m)$ with $n_m\geq 1$ subject to the weakly decreasing conditions $n_i\geq n_{i+1}-1$ and $n_i\geq n_{i+2}$. The $K$-restriction refers to the following additional conditions: $n_i \geq n_{i+K-1} +1$ or $ n_i = n_{i+1}-1 = n_{i+K-2}+1= n_{i+K-1}$. The corresponding generalization of the Rogers-Ramunjan identities is displayed, together with a novel combinatorial interpretation.
Joel Ratsaby
Applicable Analysis and Discrete Mathematics , 2008, DOI: 10.2298/aadm0802222r
Abstract: Using the saddle-point method an estimate is computed for the number $w_{ ext{m,N}}(n)$ of ordered $m$-partitions (compositions) of a positive integer $n$ under a constraint that the size of every part is at most $N$. The approximation error rate is $O(n^{-1/5}).
The M?bius function of partitions with restricted block size  [PDF]
Richard Ehrenborg,Margaret Readdy
Mathematics , 2010,
Abstract: We study filters in the partition lattice formed by restricting to partitions by type. The M\"obius function is determined in terms of the easier-to-compute descent set statistics on permutations and the M\"obius function of filters in the lattice of integer compositions. When the underlying integer partition is a knapsack partition, the M\"obius function on integer compositions is determined by a topological argument. In this proof the permutahedron makes a cameo appearance.
Restricted Dumont permutations, Dyck paths, and noncrossing partitions  [PDF]
Alexander Burstein,Sergi Elizalde,Toufik Mansour
Mathematics , 2006,
Abstract: We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length.
SM(2,4k) fermionic characters and restricted jagged partitions  [PDF]
J. -F. Fortin,P. Jacob,P. Mathieu
Mathematics , 2004, DOI: 10.1088/0305-4470/38/8/007
Abstract: A derivation of the basis of states for the $SM(2,4k)$ superconformal minimal models is presented. It relies on a general hypothesis concerning the role of the null field of dimension $2k-1/2$. The basis is expressed solely in terms of $G_r$ modes and it takes the form of simple exclusion conditions (being thus a quasi-particle-type basis). Its elements are in correspondence with $(2k-1)$-restricted jagged partitions. The generating functions of the latter provide novel fermionic forms for the characters of the irreducible representations in both Ramond and Neveu-Schwarz sectors.
Corrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms  [PDF]
Steffen Eger
Computer Science , 2014,
Abstract: In this note, I discuss results on integer compositions/partitions given in the paper "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions". I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my comments may be subjective.
Restricted exchangeable partitions and embedding of associated hierarchies in continuum random trees  [PDF]
Bo Chen,Matthias Winkel
Mathematics , 2009,
Abstract: We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In particular, we deduce from the general theory developed here a limit result conjectured previously for Ford's alpha model and its extension, the alpha-gamma model, where restricted exchangeability arises naturally.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.