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

Acceptor-bound holes in oxides often localize asymmetrically at one out of several equivalent oxygen ligands. Whereas Hartree-Fock (HF) theory overly favors such symmetry-broken polaronic hole-localization in oxides, standard local density…

We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…

Topological Data Analysis (TDA) refers to an approach that uses concepts from algebraic topology to study the "shapes" of datasets. The main focus of this paper is persistent homology, a ubiquitous tool in TDA. Basing our study on this, we…

The recently discussed tendency of holes to generate nontrivial spin environments in the extended two-dimensional t-J model (G. Martins, R. Eder, and E. Dagotto, Phys. Rev. B{\bf 60}, R3716 (1999)) is here investigated using computational…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

PED partitions are partitions with even parts distinct while odd parts are unrestricted. Similarly, POD partitions have distinct odd parts while even parts are unrestricted. Merca proved several recurrence relations analytically for the…

We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

In the 1970s, Gy\H{o}ri and Lov\'{a}sz showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1, \dots, t_k$ and natural numbers $n_1, \dots, n_k$ satisfying $\sum_{i=1}^{k} n_i = n$, a connected vertex…

The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…

The $k$-measure of an integer partition was recently introduced by Andrews, Bhattacharjee and Dastidar. In this paper, we establish trivariate generating function identities counting both the length and the $k$-measure for partitions and…

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.

Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…

A set partition of $[n] := \{1, 2, \dots, n \}$ is called {\em $r$-Stirling} if the numbers $1, 2, \dots, r$ belong to distinct blocks. Haglund, Rhoades, and Shimozono constructed graded ring $R_{n,k}$ depending on two positive integers $k…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

We introduce the idea of (s,t)-closure and delta-sets and show that (s,t)-closed beta-sets which are contained set-wise in (s,t)-closed delta-sets are also contained partition-wise. This implies the maximal (s,t)-core partition theorem of…

Given a thin torus $T_K$ around a knot $K\subset \mathbb{R}^3$, we construct Morse models of cord algebra $Cord(T_K)$ with $\mathbb{Z}$ and loop space coefficients. Using the Multiple time scale dynamics we identify $Cord(T_K; \mathbb{Z})$…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…