中文
相关论文

相关论文: On the distribution of rank statistic for strongly…

200 篇论文

In this paper, we study concave compositions, an extension of partitions that were considered by Andrews, Rhoades, and Zwegers. They presented several open problems regarding the statistical structure of concave compositions including the…

组合数学 · 数学 2021-06-11 Avinash J. Dalal , Amanda Lohss , Daniel Parry

Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo $a$ of the number of concave compositions. Let $c(n)$ be the number of concave compositions of $n$ having even…

数论 · 数学 2014-07-07 Keenan Monks , Lynnelle Ye

Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…

数论 · 数学 2026-05-11 Bing He , Guanting Liu

We study combinatorial and asymptotic properties of the rank of strongly unimodal sequences. We find a generating function for the rank enumeration function, and give a new combinatorial interpretation of the ospt-function introduced by…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

组合数学 · 数学 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…

组合数学 · 数学 2008-02-17 Jason Morton , Lior Pachter , Anne Shiu , Bernd Sturmfels , Oliver Wienand

Bringmann, Mahlburg, and Rhoades have found asymptotic expressions for all moments of the partition statistics rank and crank. In this work we extend their methods to higher ranks. The $T$-rank, introduced by Garvan, for odd integers T=3 is…

数论 · 数学 2012-05-15 Matthias Waldherr

In the course of studies of the measure of chaos for the distribution of the prime numbers among the positive integers N arched structures have been found. It is given a brief description of the fine structure of the positive integers…

综合数学 · 数学 2007-05-23 Andrei V. Vityazev , Galina V. Pechernikova

An integer partition \lambda of n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition \lambda corresponds to an integrally closed ideal we call…

组合数学 · 数学 2007-05-23 Jan Snellman , Michael Paulsen

Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for…

数论 · 数学 2019-10-03 Nian Hong Zhou

We study the Dyson rank function $N(r,t;n)$, the number of partitions with rank congruent to $r$ modulo $t$. We first show that it is monotonic in $n$, and then show that it equidistributed as $n \rightarrow \infty$. Using this result we…

数论 · 数学 2020-09-14 Joshua Males

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

组合数学 · 数学 2015-04-03 Steffen Eger

In this paper we study restricted overpartitions and concave compositions. In several cases the resulting generating functions involve simultaneously modular forms, mock theta functions, mock Maass theta functions, and false theta…

数论 · 数学 2026-04-06 Koustav Banerjee , Kathrin Bringmann , Atul Dixit

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

组合数学 · 数学 2018-03-26 L. Bruce Richmond

We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…

算子代数 · 数学 2021-09-08 David Pask , Adam Sierakowski , Aidan Sims

The modularity of the partition generating function has many important consequences, for example asymptotics and congruences for $p(n)$. In a series of papers the author and Ono \cite{BO1,BO2} connected the rank, a partition statistic…

数论 · 数学 2007-12-05 Kathrin Bringmann

It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…

组合数学 · 数学 2020-06-24 Jonathan Novak , Brendon Rhoades

We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…

统计理论 · 数学 2007-06-13 Jason Morton , Lior Pachter , Anne Shiu , Bernd Sturmfels , Oliver Wienand

A new version of a strong law of large numbers for a ``good'' pairwise independent sequence of random variables (r.v.'s) with a small part of ``bad'' dependent r.v.'s is proposed. The main goal is to relax the assumption on the existence of…

概率论 · 数学 2025-06-10 I. V. Kozlov , A. Yu. Veretennikov

Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…

概率论 · 数学 2007-05-23 Alexander Gnedin
‹ 上一页 1 2 3 10 下一页 ›