相关论文: Dyson's crank and unimodal compositions

Let $p$ be an odd prime. The bar partitions with sign and $p$-bar-core partitions with sign respectively label the spin characters and $p$-defect zero spin characters of the double cover of the symmetric group, and by restriction, those of…

This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

The self-consistent cranking method is tested by comparing the cranking calculations in the interacting boson model with the exact results obtained from the SU(3) and O(6) dynamical symmetries and from numerical diagonalization. The method…

We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…

Dyson-Schwinger equations furnish a Poincare' covariant framework within which to study hadrons. A particular feature is the existence of a nonperturbative, symmetry preserving truncation that enables the proof of exact results. The gap…

This paper proves a generalization of a conjecture of Guoniu Han, inspired originally by an identity of Nekrasov and Okounkov. The main result states that certain sums over partitions p of n, involving symmetric functions of the squares of…

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…

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

In a paper published in 2023, Wagner introduced and studied Jacobi forms with complex multiplication, and gave several applications. One such application was in constructing a new doubly-infinite family of partition-theoretic objects,…

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…

In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…

Recently the author introduced two new integer partition quadruple functions, which satisfy Ramanujan-type congruences modulo $3$, $5$, $7$, and $13$. Here we reprove the congruences modulo $3$, $5$, and $7$ by defining a rank-type…

The connection between spin and symmetry was established by Wigner in his 1939 paper on the Poincar\'e group. For a massive particle at rest, the little group is O(3) from which the concept of spin emerges. The little group for a massless…

We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…

For any integer $k\geq2$, we prove combinatorially the following Euler (binomial) transformation identity $$ \NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t), $$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the sum of…

An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…

The Dirac equation is one of the most fundamental equations of modern physics. It is a spinor equation, but some tensor equivalents of the equation were proposed previously. Those equivalents were either nonlinear or involved several…