English
Related papers

Related papers: Hook Length Biases in $t$-Core Partitions

200 papers

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

Combinatorics · Mathematics 2008-06-23 William Y. C. Chen

This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…

Optimization and Control · Mathematics 2025-10-14 Marius Roland , Nagisa Sugishita , Alexandre Forel , Youssouf Emine , Ricardo Fukasawa , Thibaut Vidal

Matrices over a finite field having fixed rank and restricted support are a natural $q$-analogue of rook placements on a board. We develop this $q$-rook theory by defining a corresponding analogue of the hit numbers. Using tools from coding…

Combinatorics · Mathematics 2021-03-30 Joel Brewster Lewis , Alejandro H. Morales

We extend recent results by G. E. Andrews and G. Simay on the $m$th largest and $m$th smallest parts of a partition to the more general context of skew plane partitions. In order to do this, we introduce new objects called skew plane…

Number Theory · Mathematics 2016-09-19 Robson da Silva , Almir Neto , Kelvin Souza

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…

We evaluate the success of linear tidal-torque theory (TTT) in predicting galactic-halo spin using a cosmological N-body simulation with thousands of well-resolved haloes. The proto-haloes are identified by tracing today's haloes back to…

Astrophysics · Physics 2009-11-06 Cristiano Porciani , Avishai Dekel , Yehuda Hoffman

Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…

Disordered Systems and Neural Networks · Physics 2007-05-23 Thierry Huillet

We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending…

Data Structures and Algorithms · Computer Science 2011-10-14 Philip Bille , Inge Li Goertz , Hjalte Wedel Vildhøj , David Kofoed Wind

The Radial Acceleration Relation (RAR) connects the total gravitational acceleration of a galaxy at a given radius, $a_{\rm tot}(r)$, with that accounted for by baryons at the same radius, $a_{\rm bar}(r)$. The shape and tightness of the…

We provide large deviations estimates for the upper tail of the number of triangles in scale-free inhomogeneous random graphs where the degrees have power law tails with index $-\alpha, \alpha \in (1,2)$. We show that upper tail…

Probability · Mathematics 2024-03-25 Clara Stegehuis , Bert Zwart

We consider axial (or odd-parity) perturbations of non-spinning hairy black holes (BH) in shift-symmetric DHOST (Degenerate Higher-Order Scalar-Tensor) theories, including terms quartic and cubic in second derivatives of the scalar field.…

General Relativity and Quantum Cosmology · Physics 2023-12-12 Karim Noui , Hugo Roussille , David Langlois

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

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Combinatorics · Mathematics 2018-10-09 Jane Y. X. Yang

Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P…

Computational Geometry · Computer Science 2012-02-03 Wolfgang Mulzer , Daniel Werner

Simultaneous bar-cores, core shifted Young diagrams (or CSYDs), and doubled distinct cores have been studied since Morris and Yaseen introduced the concept of bar-cores. In this paper, our goal is to give a formula for the number of these…

Combinatorics · Mathematics 2022-05-05 Hyunsoo Cho , JiSun Huh , Hayan Nam , Jaebum Sohn

Although real-world text datasets, such as DNA sequences, are far from being uniformly random, average-case string searching algorithms perform significantly better than worst-case ones in most applications of interest. In this paper, we…

Data Structures and Algorithms · Computer Science 2018-01-16 Lorraine A. K. Ayad , Panagiotis Charalampopoulos , Costas S. Iliopoulos , Solon P. Pissis

A recent paper by Hanusa and Nath states many conjectures in the study of self-conjugate core partitions. We prove all but two of these conjectures asymptotically by number-theoretic means. We also obtain exact formulas for the number of…

Combinatorics · Mathematics 2014-03-05 Levent Alpoge

We study the distribution of several statistics of large non-crossing partitions. First, we prove the Gaussian limit theorem for the number of blocks of a given fixed size. In contrast to the properties of usual set partitions, we show that…

Probability · Mathematics 2019-07-02 Vladislav Kargin

Amdeberhan conjectured that the number of $(t,t+1, t+2)$-core partitions is $\sum_{0\leq k\leq [\frac{t}{2}]}\frac{1}{k+1}\binom{t}{2k}\binom{2k}{k}$. In this paper, we obtain the generating function of the numbers $f_t$ of $(t, t + 1, ...,…

Combinatorics · Mathematics 2014-10-14 Huan Xiong

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

Combinatorics · Mathematics 2016-12-12 Anthony Zaleski , Doron Zeilberger