中文
相关论文

相关论文: Partition Statistics Equidistributed with the Numb…

200 篇论文

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…

组合数学 · 数学 2024-06-27 Catherine Cossaboom

The coefficients of the generating function $(q;q)^\alpha_\infty$ produce $p_\alpha(n)$ for $\alpha \in \mathbb{Q}$. In particular, when $\alpha = -1$, the partition function is obtained. Recently, Chan and Wang identified and proved…

数论 · 数学 2021-03-16 Yunseo Choi

We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\phi_1 \rightarrow {}_2\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions,…

数论 · 数学 2016-11-15 Alexander Berkovich , Ali Kemal Uncu

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

离散数学 · 计算机科学 2011-06-24 Giovanni Rossi

Based on two involutions and a bijection, we completely determine the difference between the number of $\ell$-regular partitions of $n$ into an even number of parts and into an odd number of parts for all positive integers $n$ and $\ell>1$,…

组合数学 · 数学 2024-06-07 Ji-Cai Liu

Let $\mathbf{H}$ be the cartesian product of a family of finite abelian groups indexed by a finite set $\Omega$. A given poset (i.e., partially ordered set) $\mathbf{P}=(\Omega,\preccurlyeq_{\mathbf{P}})$ gives rise to a poset metric on…

信息论 · 计算机科学 2021-07-23 Yang Xu , Haibin Kan , Guangyue Han

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

组合数学 · 数学 2024-09-17 Amritanshu Prasad , Samrith Ram

We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…

组合数学 · 数学 2007-05-23 Tom Halverson , Tim Lewandowski

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

数论 · 数学 2025-06-11 Shishuo Fu , Dazhao Tang

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

综合数学 · 数学 2022-12-20 M. J. Kronenburg

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

数论 · 数学 2022-12-06 Scott Ahlgren , Olivia Beckwith , Martin Raum

Motivated by the Nekrasov-Okounkov formula on hook lengths, the first author conjectured that the Plancherel average of the $2k$-th power sum of hook lengths of partitions with size $n$ is always a polynomial of $n$ for any $k\in…

组合数学 · 数学 2018-01-22 Guo-Niu Han , Huan Xiong

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

组合数学 · 数学 2025-06-18 Gurinder Singh , Rupam Barman

The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was…

组合数学 · 数学 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

We compute the dimension $d_{n,r}(q) = \dim(\IR_q^r)$ of the defining module $\IR_q^r$ for the $q$-partition algebra. This module comes from $r$-iterations of Harish-Chandra restriction and induction on $\GL_n(\FF_q)$. This dimension is a…

组合数学 · 数学 2009-09-08 Tom Halverson , Nathaniel Thiem

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

计算复杂性 · 计算机科学 2009-05-05 Leslie Ann Goldberg , Martin Grohe , Mark Jerrum , Marc Thurley

Measuring the expectation value of the molecular electronic Hamiltonian is one of the challenging parts of the variational quantum eigensolver. A widely used strategy is to express the Hamiltonian as a sum of measurable fragments using…

量子物理 · 物理学 2023-01-04 Seonghoon Choi , Ignacio Loaiza , Artur F. Izmaylov

We compute the limit shapes of the Young diagrams of the minimal difference $p$ partitions and provide a simple physical interpretation for the limit shapes. We also calculate the asymptotic distribution of the largest part of the Young…

统计力学 · 物理学 2022-01-17 Alain Comtet , Satya N. Majumdar , Stephane Ouvry , Sanjib Sabhapandit

Let $T$ be a tree on $n$ vertices and let $L_q^T$ be the $q$-analogue of its Laplacian. For a partition $\lambda \vdash n$, let the normalized immanant of $L_q^T$ indexed by $\lambda$ be denoted as $d_{\lambda}(L_q^T)$. A string of…

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

计算复杂性 · 计算机科学 2010-04-08 Marc Thurley