Related papers: Notes On U(1) Instanton Counting On $A_{l-1}$ ALE …
We initiate the study of simultaneous core multipartitions, generalising simultaneous core partitions, which have been studied extensively in the recent literature. Given a multipartition datum (s|c), which consists of a non-negative…
The speed of computations is investigated by means of the orthogonality speed for a charged qubit interacting with a single cavity field prepared initially in a Fock state or Binomial state. We observe that the rate of the computational…
We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) =…
There are two schools of "measurement-only quantum computation". The first ([11]) using prepared entanglement (cluster states) and the second ([4]) using collections of anyons, which according to how they were produced, also have an…
If $s$ and $t$ are relatively prime J. Olsson proved in 2008 that the $s$-core of a $t$-core partition is again a $t$-core partition, and that the $s$-bar-core of a $t$-bar-core partition is again a $t$-bar-core partition. Here generalized…
Recently, Merca and Schmidt found some decompositions for the partition function $p(n)$ in terms of the classical M\"{o}bius function as well as Euler's totient. In this paper, we define a counting function $T_k^r(m)$ on the set of…
We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…
For a semi-simple simply connected algebraic group G we introduce certain parabolic analogues of the Nekrasov partition function (introduced by Nekrasov and studied recently by Nekrasov-Okounkov and Nakajima-Yoshioka for G=SL(n)). These…
We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…
Motivated by Amdeberhan's conjecture on $(t,t+1)$-core partitions with distinct parts, various results on the numbers, the largest sizes and the average sizes of simultaneous core partitions with distinct parts were obtained by many…
We compute the instanton partition functions of $\mathcal{N}=1$ SCFTs in class $\mathcal{S}_k$. We obtain this result via orbifolding Dp/D(p-4) brane systems and calculating the partition function of the supersymmetric gauge theory on the…
Effective field theories in type I and II superstring theories for D-branes located at points in the orbifold C^2/Z_n are supersymmetric gauge theories whose field content is conveniently summarized by a `quiver diagram,' and whose…
In the previous paper [7], we introduced a notion of pairs of adelic R-Cartier divisors and R-base conditions. The purpose of this paper is to propose an extended notion of adelic R-Cartier divisors that we call an l1-adelic R-Cartier…
Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…
The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…
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…
We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a…
We present an algorithm for computing instanton numbers of curve singularities. A comparison is made between these and some other invariants of curve singularities. The algorithm has been implemented in the symbolic computer algebra program…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.