Related papers: A four parameter generalization of Gollnitz's (BIG…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

In our previous paper math.QA/0412192 the Cayley-Hamilton identity for the GL(m|n) type quantum matrix algebra was obtained. Here we continue investigation of that identity. We derive it in three alternative forms and, most importantly, we…

Difficult it is to formulate achievable sensitivity bounds for quantum multiparameter estimation. Consider a special case, one parameter from many: many parameters of a process are unknown; estimate a specific linear combination of these…

Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…

The four-parameter weight of partitions played an important role in the theory of integer partitions, for its connection with various statistics, including the alternating sum and the BG-rank. In 2022, Andrews introduced the SIP classes, by…

We show that within classical statistical mechanics without taking the thermodynamic limit, the most general Boltzmann factor for the canonical ensemble is a q-exponential function. The only assumption here is that microcanonical…

We use the method of generating functions to find the limit of a $q$-continued fraction, with 4 parameters, as a ratio of certain $q$-series. We then use this result to give new proofs of several known continued fraction identities,…

The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…

Many real-world processes and phenomena are modeled using systems of ordinary differential equations with parameters. Given such a system, we say that a parameter is globally identifiable if it can be uniquely recovered from input and…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

By using Liu's $q$-partial differential equations theory, we prove that if an analytic function in several variables satisfies a system of $q$-partial differential equations, if and only if it can be expanded in terms of homogeneous…

A unified scheme for treating generalized superselection sectors is proposed on the basis of the notion of selection criteria to characterize states of relevance to each specific domain in quantum physics, ranging from the relativistic…

A three-parameter family of integrable quadratic Hamiltonians on $e(3)$ and $so(4)$ is presented. When one of the parameters vanishes, the Hamiltonian coincides with the Kowalevski Hamiltonian with the girostatic term. If the other two…

The Parameter Continuation Theorem is the theoretical foundation for polynomial homotopy continuation, which is one of the main tools in computational algebraic geometry. In this note, we give a short proof using Gr\"obner bases. Our…

We construct solution operators to the $\overline{\partial}$-equation that depend continuously on the domain. This is applied to derive a parameter version of Forstneri\v{c}'s splitting lemma: If both the maps and the domains they are…

We propose an extended quantum theory, in which the number K of parameters necessary to characterize a quantum state behaves as fourth power of the number N of distinguishable states. As the simplex of classical N-point probability…

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…

Here, we establish a polynomial identity in three variables $a, b, c$, and with the degree of the polynomial given in terms of two integers $L, M$. By letting $L$ and $M$ tend to infinity, we get the 1993 Alladi-Gordon $q$-hypergeometric…

In 1967, Andrews found a combinatorial generalization of the G\"ollnitz-Gordon theorem, which can be called the Andrews-G\"ollnitz-Gordon theorem. In 1980, Bressoud derived a multisum Rogers-Ramanujan-type identity, which can be considered…