搜索结果: 1-15 共查到“数学 partitions”相关记录49条 . 查询时间(0.07 秒)
The spt-Crank for Ordinary Partitions
spt-function spt-crank congruence marked partition doubly marked partition
font style='font-size:12px;'>
2014/6/3
The spt-function spt(n) was introduced by Andrews as the weighted counting of partitions of n with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-...
Ordered Partitions Avoiding a Permutation Pattern of Length 3
pattern avoidance ordered partition descent
font style='font-size:12px;'>
2014/6/3
An ordered partition of [n]={1, 2,..., n} is a partition whose blocks are endowed with a linear order. Let OPn,k be set of ordered partitions of [n] with k blocks and OPn,k(σ) be set of ordered partit...
On the Positive Moments of Ranks of Partitions
rank of a partition k-marked Durfee symbol moment of ranks
font style='font-size:12px;'>
2014/6/3
By introducing k-marked Durfee symbols, Andrews found a combinatorial interpretation of 2k-th symmetrized moment η2k(n) of ranks of partitions of n in terms of (k + 1)-marked Durfee symbols of n. In t...
Linked Partitions and Permutation Tableaux
linked partition descent permutation tableau
font style='font-size:12px;'>
2014/6/3
Linked partitions are introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux are introduced by Steingrímsson and Williams in the study of totally posi...
On the number of partitions with designated summands
partition with designated summands Ramanujan type identity Ramanujan's cubic continued fraction cubic theta function
font style='font-size:12px;'>
2014/6/3
Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of n with designated summands, where we assume that among parts with equal size, exactly one is designate...
Noncrossing Linked Partitions and Large (3, 2)-Motzkin Paths
Noncrossing linked partition Schroder path large (3 2)-Motzkin path (3 2)-Motzkin path Schrö der number
font style='font-size:12px;'>
2014/6/3
Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and (3, 2)-Motzkin paths, where a (3,...
Combinatorial Telescoping for an Identity of Andrews on Parity in Partitions
creative telescoping combinatorial telescoping partition q-little Jacobi polynomial
font style='font-size:12px;'>
2014/6/3
Recently Andrews proposed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials. We give a classification of certain triples of partitions and find bijections ba...
Partitions and Partial Matchings Avoiding Neighbor Patterns
set partition partial matching neighbor alignment left nesting right nesting.
font style='font-size:12px;'>
2014/6/3
We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection betwee...
The Size of the Largest Part of Random Weighted Partitions of Large Integers
Random Weighted Partitions Large Integers Probability
font style='font-size:12px;'>
2011/9/20
Abstract: For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions...
Actions and identities on set partitions
Actions and identities set partitions Combinatorics
font style='font-size:12px;'>
2011/9/16
Abstract: A labeled set partition is a partition of a set of integers whose arcs are labeled by nonzero elements of an abelian group $A$. Inspired by the action of the linear characters of the unitria...
Crystal rules for $(\ell,0)$-JM partitions
Crystal rules Combinatorics Representation Theory
font style='font-size:12px;'>
2011/9/14
Abstract: Vazirani and the author \cite{BV} gave a new interpretation of what we called $\ell$-partitions, also known as $(\ell,0)$-Carter partitions. The primary interpretation of such a partition $\...
From flows of Lambda Fleming-Viot processes to lookdown processes via flows of partitions
Stochastic flow Fleming-Viot process Lookdown process Partition-valued process Coalescence Continuous state branching process Bridge
font style='font-size:12px;'>
2011/9/14
Abstract: We show that the lookdown process can be pathwise embedded into a stochastic flow of bridges (F_{s,t},s\leq t) associated to a \Lambda\ coalescent. Such a flow of bridges couples an infinite...
A note on vertex partitions
vertex partitions Combinatorics general lemma
font style='font-size:12px;'>
2011/8/31
Abstract: We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.
Unique path partitions: Characterization and Congruences
binary partitions unique path partitions rim hooks symmetric group character values congruences
font style='font-size:12px;'>
2011/8/26
Abstract: We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.
On Measures on Partitions Arising in Harmonic Analysis for Linear and Projective Characters of the Infinite Symmetric Group
Partitions Arising Harmonic Analysis the Infinite Symmetric Group Combinatorics
font style='font-size:12px;'>
2011/8/25
Abstract: The z-measures on partitions originated from the problem of harmonic analysis of linear representations of the infinite symmetric group in the works of Kerov, Olshanski and Vershik (1993, 20...