English
Related papers

Related papers: Hook-content formula using excited Young diagrams

200 papers

Formal concepts and closed itemsets proved to be of big importance for knowledge discovery, both as a tool for concise representation of association rules and a tool for clustering and constructing domain taxonomies and ontologies.…

Artificial Intelligence · Computer Science 2017-04-21 Sergei O. Kuznetsov , Tatiana Makhalova

Motivated by suggested question generation in conversational news recommendation systems, we propose a model for generating question-answer pairs (QA pairs) with self-contained, summary-centric questions and length-constrained,…

Computation and Language · Computer Science 2021-09-13 Li Zhou , Kevin Small , Yong Zhang , Sandeep Atluri

Ropelength, L, is a parameter characterizing the minimum contour length of a knot or link. There exist upper and lower bounds on ropelength with respect to crossing number, C, including a universal lower bound constraining $L\geq\alpha_0…

Geometric Topology · Mathematics 2026-03-16 Alexander R. Klotz

We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…

Discrete Mathematics · Computer Science 2017-11-02 Alexander M. Romanov

We study the quantum K-theory ring $QK(X)$ of a Grassmannian $X$ and prove a manifestly positive formula for the product of an arbitrary class by a hook class. This generalizes the quantum K-theoretic Pieri rule, a prior result of Buch and…

Combinatorics · Mathematics 2026-01-14 Joy Hamlin

We consider $\beta$--Plancherel measures \cite{Ba.Ra.} on subsets of partitions -- and their asymptotics. These subsets are the Young diagrams contained in a $(k,\ell)$--hook, and we calculate the asymptotics of the expected shape of these…

Combinatorics · Mathematics 2007-05-23 Amitai Regev

Lattice-model simulations and experiments of some small proteins suggest that folding is essentially controlled by a few conserved contacts. Residues of these conserved contacts form the minimum set of native contacts needed to ensure…

Biomolecules · Quantitative Biology 2011-09-14 Wei-Mou Zheng , Hui Zeng , Dong-Bo Bu , Ming-Fu Shao , Ke-Song Liu , Chao Wang

We compute the dynamic structure factor for the Ising model with a purely relaxational dynamics (model A). We perform a perturbative calculation in the $\epsilon$ expansion, at two loops in the high-temperature phase and at one loop in the…

Statistical Mechanics · Physics 2009-11-10 P. Calabrese , V. Martin-Mayor , A. Pelissetto , E. Vicari

Utilizing elliptic weights, we construct an elliptic analogue of rook numbers for Ferrers boards. Our elliptic rook numbers generalize Garsia and Remmel's q-rook numbers by two additional independent parameters a and b, and a nome p. These…

Combinatorics · Mathematics 2019-02-22 Michael J. Schlosser , Meesue Yoo

We find two new hook length formulas for binary trees. The particularity of our formulas is that the hook length $h_v$ appears as an exponent.

Combinatorics · Mathematics 2008-04-24 Guo-Niu Han

We formulate a notion of "punctual gluing" of $t$-structures and weight structures. As our main application we show that the relative version of Ayoub's $1$-motivic $t$-structure restricts to compact motives. We also demonstrate the utility…

Algebraic Geometry · Mathematics 2017-05-03 Vaibhav Vaish

We introduce FigureQA, a visual reasoning corpus of over one million question-answer pairs grounded in over 100,000 images. The images are synthetic, scientific-style figures from five classes: line plots, dot-line plots, vertical and…

Computer Vision and Pattern Recognition · Computer Science 2018-02-26 Samira Ebrahimi Kahou , Vincent Michalski , Adam Atkinson , Akos Kadar , Adam Trischler , Yoshua Bengio

In this note, we propose a factorization formula for gauge-theory scattering amplitudes up to two loops in the high-energy boosted limit. Our formula extends existing results in the literature by incorporating the contributions from massive…

High Energy Physics - Phenomenology · Physics 2023-12-20 Guoxing Wang , Tianya Xia , Li Lin Yang , Xiaoping Ye

Large language models (LLMs) often generate hallucinations in knowledge-intensive QA due to parametric knowledge limitations. While existing methods like KG-CoT improve reliability by integrating knowledge graph (KG) paths, they suffer from…

Computation and Language · Computer Science 2025-12-18 Chao Zhang , Minghan Li , Tianrui Lv , Guodong Zhou

Using Monte Carlo simulations and advanced knot localization methods, we analyze the length and distribution of prime components in composite knots tied on Freely Jointed Rings (FJRs). For increasing contour length, we observe the…

Statistical Mechanics · Physics 2015-06-18 Luca Tubiana

Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the…

Quantum Physics · Physics 2020-10-09 Hector Miller-Bakewell

A hypothetical picture of massive excitations of 4-dimensional Yang-Mills quantum field theory as closed knotted fat strings is described.

High Energy Physics - Theory · Physics 2017-08-23 L. D. Faddeev

We show that, given any $n$ and $\alpha$, every embedding of any sufficiently large complete graph in $\mathbb{R}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such that for every $i\not =j$, $|\lk(Q_i,Q_j)|\geq\alpha$ and…

Geometric Topology · Mathematics 2009-01-18 Erica Flapan , Blake Mellor , Ramin Naimi

Explainable question answering (XQA) aims to answer a given question and provide an explanation why the answer is selected. Existing XQA methods focus on reasoning on a single knowledge source, e.g., structured knowledge bases, unstructured…

Computation and Language · Computer Science 2023-05-25 Jiajie Zhang , Shulin Cao , Tingjia Zhang , Xin Lv , Jiaxin Shi , Qi Tian , Juanzi Li , Lei Hou

We introduce succinct lossless representations of query results called covers. They are subsets of the query results that correspond to minimal edge covers in the hypergraphs of these results. We first study covers whose structures are…

Databases · Computer Science 2018-01-12 Ahmet Kara , Dan Olteanu