English
Related papers

Related papers: Hook-content formula using excited Young diagrams

200 papers

We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from…

Logic in Computer Science · Computer Science 2011-02-15 Sandra Alves , Maribel Fernández , Ian Mackie

In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.

Combinatorics · Mathematics 2010-04-13 Markus Kuba

We prove a conjecture of Okada giving an exact formula for a certain statistic for hook-lengths of partitions: \frac{1}{n!} \sum_{\lambda \vdash n} f_{\lambda}^2 \sum_{u \in \lambda} \prod_{i=1}^{r}(h_u^2 - i^2) = \frac{1}{2(r+1)^2}…

Combinatorics · Mathematics 2012-01-17 Greta Panova

We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.

Combinatorics · Mathematics 2015-04-07 Fedor Petrov

Recently, a new weighted generalization of the branching rule for the hook lengths, equivalent to the hook formula, was proved. In this paper, we generalize the complementary branching rule, which can be used to prove Burnside's formula. We…

Combinatorics · Mathematics 2010-06-10 Matjaz Konvalinka

The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…

Combinatorics · Mathematics 2023-09-19 Alejandro H. Morales , Daniel G. Zhu

The increasing availability of structured datasets, from Web tables and open-data portals to enterprise data, opens up opportunities~to enrich analytics and improve machine learning models through relational data augmentation. In this…

Databases · Computer Science 2025-03-06 Aécio Santos , Aline Bessa , Fernando Chirigati , Christopher Musco , Juliana Freire

We develop new methods for computing the Hochschild (co)homology of monoids which can be presented as the structure monoids of idempotent set-theoretic solutions to the Yang--Baxter equation. These include free and symmetric monoids;…

Algebraic Topology · Mathematics 2016-07-28 Victoria Lebed

We use Kostant and Kumar's twisted group ring and its dual to formulate and prove a generalization of Nakada's colored hook formula for any Coxeter groups. For dominant minuscule elements of the Weyl group of a Kac--Moody algebra, this…

Representation Theory · Mathematics 2025-03-25 Leonardo C. Mihalcea , Hiroshi Naruse , Changjian Su

Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by…

Combinatorics · Mathematics 2007-05-23 Mathias Lederer

Seq2seq learning has produced promising results on summarization. However, in many cases, system summaries still struggle to keep the meaning of the original intact. They may miss out important words or relations that play critical roles in…

Computation and Language · Computer Science 2018-06-26 Kaiqiang Song , Lin Zhao , Fei Liu

We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…

Combinatorics · Mathematics 2025-08-12 Lucas Teyssier

In this paper, we present a direct bijective proof of the hook-length formula for standard immaculate tableaux, which arose in the study of non-commutative symmetric functions. Our proof is along the spirit of Novelli, Pak and…

Combinatorics · Mathematics 2015-03-17 Emma L. L. Gao , Arthur L. B. Yang

I describe an implementation of the overlap action, which is built from an action which is itself an approximate overlap action. It appears to be about a factor of 15-20 less expensive to use, than the usual overlap action with the Wilson…

High Energy Physics - Lattice · Physics 2008-11-26 Thomas DeGrand

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…

Combinatorics · Mathematics 2008-06-12 Bruce E. Sagan

This paper is concerned with the task of multi-hop open-domain Question Answering (QA). This task is particularly challenging since it requires the simultaneous performance of textual reasoning and efficient searching. We present a method…

Computation and Language · Computer Science 2019-06-18 Yair Feldman , Ran El-Yaniv

We present preliminary results on the axial form factor $G_A(Q^2)$ and the induced pseudoscalar form factor $G_P(Q^2)$ of the nucleon. A systematic analysis of the excited-state contributions to form factors is performed on the CLS ensemble…

High Energy Physics - Lattice · Physics 2014-11-24 P. M. Junnarkar , S. Capitani , D. Djukanovic , G. von Hippel , J. Hua , B. Jäger , H. B. Meyer , T. D. Rae , H. Wittig

In this note we give a new proof of a closed formula for the multivariable generating series of diagonally colored Young diagrams. This series also describes the Euler characteristics of certain Nakajima quiver varieties. Our proof is a…

Combinatorics · Mathematics 2016-07-14 Ádám Gyenge

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…

Information Theory · Computer Science 2017-07-25 Ziling Heng , Qin Yue

Query sensitive summarization aims at providing the users with the summary of the contents of single or multiple web pages based on the search query. This paper proposes a novel idea of generating a comparative summary from a set of URLs…

Information Retrieval · Computer Science 2012-01-12 P. Chitra , R. Baskaran , K. Sarukesi