理学 >>> 数学 信息科学与系统科学 物理学 化学 天文学 地球科学总论 大气科学 地球物理学 地理学 地质学 水文学 海洋科学 生物学 科学技术史
搜索结果: 1-15 共查到理学 partitions相关记录55条 . 查询时间(0.078 秒)
Patterns of the entire range of REE in crude oils and coexisting water, collected from mud volcanoes in Xinjiang Province of China, are reported here for the first time. Crude oils show light REE enri...
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...
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 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,...
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...
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...
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 $\...
Abstract: The paper addresses the the number of nodal domains for eigenfunctions of Schr\"{o}dinger operators with Dirichlet boundary conditions in bounded domains. In dimension one, the $n$th eigenfu...
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.

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...