相关论文: The Nekrasov-Okounkov hook length formula: refinem…

Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized…

Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…

Noam Elkies and Everett Howe independently noticed a certain elegant product formula for the multiple integral \int_R \prod_{1 \le i < j \le k} (x_j-x_i) dx_1 \cdots dx_k, where the region $R$ is the set of $k$-tuples satisfying $0 < x_1 <…

Using terminologies of information geometry, we derive upper and lower bounds of the tail probability of the sample mean. Employing these bounds, we obtain upper and lower bounds of the minimum error probability of the 2nd kind of error…

We present the singular Euler--Maclaurin expansion, a new method for the efficient computation of large singular sums that appear in long-range interacting systems in condensed matter and quantum physics. In contrast to the traditional…

To any solution of a linear system of differential equations, we associate a kernel, correlators satisfying a set of loop equations, and in presence of isomonodromic parameters, a Tau function. We then study their semiclassical expansion…

For a hermitian line bundle over an arithmetic variety, we construct a convex continuous function on the Okounkov body associated to the generic fibre of the line bundle. The integration of the continuous function gives the growth of the…

We provide new simple proofs of the Kolmogorov extension theorem and Prokhorovs' theorem. The proof of the Kolmogorov extension theorem is based on the simple observation that $\mathbb{R}$ and the product measurable space…

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…

The purpose of this note is to prove an Euler-type formula for partitions of the M\"obius strip. This formula was introduced in our joint paper with R.~Kiwan, "Courant-sharp property for Dirichlet eigenfunctions on the M\"obius strip"…

Recently, Borodin and Okounkov established a remarkable identity for Toeplitz determinants. Two other proofs of this identity were subsequently found by Basor and Widom, who also extended the formula to the block case. We here give one more…

In this paper, we study the nonexpansive properties of metric resolvent, and present a convergence rate analysis for the associated fixed-point iterations (Banach-Picard and Krasnosel'skii-Mann types). Equipped with a variable metric, we…

We study three kinds of compactness in some variants of G\"odel logic: compactness, entailment compactness, and approximate entailment compactness. For countable first-order underlying language we use the Henkin construction to prove the…

We study the combination of two o-minimal extensions of the theory of real closed fields: one by a T-convex subring and the other by a T-derivation. Let T be a complete, model complete o-minimal extension of RCF. We show that the combined…

In 2007, Andrews and Paule published the eleventh paper in their series on MacMahon's partition analysis, with a particular focus on broken $k$-diamond partitions. On the way to broken $k$-diamond partitions, Andrews and Paule introduced…

Let H[a_0,n] be the class of functions p(z)=a_0+a_nz^n+... which are analytic in the open unit disk U. For p(z)in H[1,2], M. Nunokawa, S. Owa, N. Uyanik and H. Shiraishi (Math. Comput. Modelling. 55 (2012), 1245-1250) have shown some…

In probability theory, the Chernoff bound gives exponentially decreasing bounds on tail distributions for sums of independent random variables and such bound is applied at different fields in science and engineering. In this work, we…

The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux.…

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on $n$-provability give rise to a $\Pi_{n+1}$ proof-theoretic ordinal. As such, to each theory $U$ we can…

In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…