Related papers: Hook length and symplectic content in partitions

Extending recent work on the Euclidean hull, we derive closed-form ratio decompositions for the number of linear codes with prescribed Hermitian and symplectic hull dimension. The Hermitian ratio admits a uniform lower bound of at least…

The main result of this paper is the construction of a bijection of the set of words in so-called standard order of length $n$ formed by four different letters and the set $\mathbb{N}^n$ of all subspaces of a fixed $n$-dimensional maximal…

By rewriting the famous hook-content formula it easily follows that there are $\prod\limits_{1 \le i < j \le n} \frac{k_j - k_i + j -i}{j-i}$ semistandard tableaux of shape $(k_n,k_{n-1},...,k_1)$ with entries in $\{1,2,...,n\}$ or,…

Graph partitioning schedules parallel calculations like sparse matrix-vector multiply (SpMV). We consider contiguous partitions, where the $m$ rows (or columns) of a sparse matrix with $N$ nonzeros are split into $K$ parts without…

It is conjectured that the symplectic structure of space-time is superior to the metric one. Instead of the commonly adopted pseudo-orthogonal groups SO(1,d-1), d\ge4, the complex symplectic ones Sp(2l,C), l\ge1 are proposed as the local…

We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

In Part 1 of this paper we construct a spectral sequence converging to the relative Lie algebra cohomology associated to the action of any subgroup $G$ of the symplectic group on the polynomial Fock model of the Weil representation, see…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux.…

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…

We classify the finite type (in the sense of E. Cartan theory of prolongations) subalgebras $\mathfrak{h}\subset\mathfrak{sp}(V)$, where $V$ is the symplectic 4-dimensional space, and show that they satisfy $\mathfrak{h}^{(k)}=0$ for all…

In this paper, we present, given a odd integer $d$, a decomposition of the multiset of bar lengths of a bar partition $\lambda$ as the union of two multisets, one consisting of the bar lengths in its $\bar{d}$-core partition…

Let $X$ be a projective irreducible holomorphic symplectic manifold. We associate with any big $\mathbf{R}$-divisor $D$ on $X$ a convex polygon $\Delta_E^{\mathrm{num}}(D)$ of dimension 2, whose Euclidean volume is…

Let G be a finite group acting on a symplectic complex vector space V. Assume that the quotient V/G has a holomorphic symplectic resolution. We prove that G is generated by "symplectic reflectionsd"', i.e. symplectomorphisms with fixed…

Partitions, the partition function $p(n)$, and the hook lengths of their Ferrers-Young diagrams are important objects in combinatorics, number theory and representation theory. For positive integers $n$ and $t$, we study $p_t^e(n)$ (resp.…

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…

We use categorical annular evaluation to give a uniform construction of both $\mathfrak{sl}_n$ and HOMFLYPT Khovanov-Rozansky link homology, as well as annular versions of these theories. Variations on our construction yield…

We use intermediate symplectic characters to give a proof and variations of Hopkins' conjecture, now proved by Hopkins and Lai, on the number of shifted plane partitions of shifted double staircase shape with bounded entries. In fact, we…