Related papers: Partition genericity and pigeonhole basis theorems

Core partitions have attracted much attention since Anderson's work (2002) on the number of $(s,t)$-core partitions for coprime $s,t$. Recently, there has been a growing interest in studying the limiting distributions of the sizes of random…

The "quantum duality principle" states that a quantisation of a Lie bialgebra provides also a quantisation of the dual formal Poisson group and, conversely, a quantisation of a formal Poisson group yields a quantisation of the dual Lie…

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…

We review versions of the Generalized Uncertainty Principle (GUP) obtained in string theory and in gedanken experiments carried out in Quantum Gravity. We show how a GUP can be derived from a measure gedanken experiment involving…

In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…

Within context of quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

We study some combinatorial properties of higher-dimensional partitions which generalize plane partitions. We present a natural bijection between $d$-dimensional partitions and $d$-dimensional arrays of nonnegative integers. This bijection…

We study the universal scaling limit of random partitions obeying the Schur measure. Extending our previous analysis [arXiv:2012.06424], we obtain the higher-order Pearcey kernel describing the multi-critical behavior in the cusp scaling…

We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

For a random partition, one of the most basic questions is: what can one expect about the parts which arise? For example, what is the distribution of the parts of random partitions modulo $N$? Since most partitions contain a $1$, and indeed…

In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…

We introduce a bivariant version of the Cuntz semigroup as equivalence classes of order zero maps generalizing the ordinary Cuntz semigroup. The theory has many properties formally analogous to KK-theory including a composition product. We…

In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a…