English
Related papers

Related papers: The Nekrasov-Okounkov hook length formula: refinem…

200 papers

In this paper, we derive by using elementary methods some continued fractions, certain identities involving derivatives of tanx, several expressions for log coshx and an identity for {\pi}2, from a series expansion of tan x, which gives the…

Number Theory · Mathematics 2024-07-30 Taekyun Kim , Dae San Kim

Using the exact computation of a large number of moments of the distribution function of the end-to-end distance $G(r,N)$ of the worm-like chain, we have established the analytical form of the coefficients in Taylor expansions of the…

Soft Condensed Matter · Physics 2009-11-10 Semjon Stepanow

Recently, there has been a lot of work on combinatorial inequalities related to hook-lengths in $t$-regular partitions. In this short note, we give a proof using generating functions for a result proved by Singh and Barman (2026) using…

Combinatorics · Mathematics 2026-01-12 Manjil P. Saikia , Prabal Talukdar

Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…

Logic in Computer Science · Computer Science 2024-07-19 Oskar Fiuk , Emanuel Kieronski , Vincent Michielini

We consider the half-genus expansion of the resolvent function in the $\beta$-deformed matrix model with three-Penner potential under the AGT conjecture and the $0d-4d$ dictionary. The partition function of the model, after the…

High Energy Physics - Theory · Physics 2011-11-28 Hiroshi Itoyama , Nobuhiro Yonezawa

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…

Combinatorics · Mathematics 2009-04-10 Richard P. Stanley

In this work, we present a comprehensive study of the relationship among uniform Lyapunov exponents, the Liouville trace formula, and adapted metrics for cocycles in Hilbert spaces. First, we prove that uniform Lyapunov exponents can be…

Dynamical Systems · Mathematics 2026-05-05 Mikhail Anikushin

The quark (gluon)-hadron duality constitutes a basis for the theoretical treatment of a wide range of inclusive processes -- from hadronic \tau decays and R_{e^+e^-}, to semileptonic and nonleptonic decay rates of heavy flavor hadrons. A…

High Energy Physics - Phenomenology · Physics 2009-10-28 Boris Chibisov , R. David Dikeman , M. Shifman , N. G. Uraltsev

In this paper we study the local linearization of the Hellinger--Kantorovich distance via its Riemannian structure. We give explicit expressions for the logarithmic and exponential map and identify a suitable notion of a Riemannian inner…

Optimization and Control · Mathematics 2021-09-27 Tianji Cai , Junyi Cheng , Bernhard Schmitzer , Matthew Thorpe

The well-known Baker-Campbell-Hausdorff theorem in Lie theory says that the logarithm of a noncommutative product e X e Y can be expressed in terms of iterated commutators of X and Y. This paper provides a gentle introduction t{\'o}…

Rings and Algebras · Mathematics 2018-05-03 Shanzhong Sun , Yong Li , David Sauzin

We study a generalized notion of a homogeneous skew-product extension of a probability-preserving system in which the homogeneous space fibres are allowed to vary over the ergodic decomposition of the base. The construction of such…

Dynamical Systems · Mathematics 2009-11-11 Tim Austin

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

Computational Complexity · Computer Science 2025-12-09 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

Combinatorics · Mathematics 2023-02-15 Seung Jin Lee , Jaeseong Oh , Brendon Rhoades

Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux;…

Combinatorics · Mathematics 2010-06-24 Matjaz Konvalinka

An appropriate rational approximation to the eigenfunction of the Schr\"{o}dinger equation for anharmonic oscillators enables one to obtain the eigenvalue accurately as the limit of a sequence of roots of Hankel determinants. The…

Mathematical Physics · Physics 2009-11-13 P. Amore , F. M. Fernandez

Recently Han obtained a general formula for the weight function corresponding to the expansion of a generating function in terms of hook lengths of binary trees. In this paper, we present formulas for k-ary trees, plane trees, plane…

Combinatorics · Mathematics 2009-03-20 William Y. C. Chen , Oliver X. Q. Gao , Peter L. Guo

The main goal of this article is to construct "arithmetic Okounkov bodies" for an arbitrary pseudo-effective (1,1)-class $\alpha$ on a K\"ahler manifold. Firstly, using Boucksom's divisorial Zariski decompositions for pseudo-effective…

Algebraic Geometry · Mathematics 2015-03-03 Ya Deng

The classical hook length formula of enumerative combinatorics expresses the number of standard Young tableaux of a given partition shape as a single fraction. In recent years, two generalizations of this formula have emerged: one by Pak…

Combinatorics · Mathematics 2023-10-30 Darij Grinberg , Nazar Korniichuk , Kostiantyn Molokanov , Severyn Khomych

Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…

Combinatorics · Mathematics 2016-04-15 Shishuo Fu , Dazhao Tang

Touchard-Riordan-like formulas are some expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove these kind of formulas, related with integer…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès , Jang Soo Kim