Related papers: Hook length biases and general linear partition in…

The hull of a linear code $C$ is the intersection of $C$ with its dual code. We present and analyze the number of linear $q$-ary codes of the same length and dimension but with different dimensions for their hulls. We prove that for given…

If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…

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…

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

Let $M_0(n)$ (resp. $M_1(n)$) denote the number of partitions of $n$ with even (reps. odd) crank. Choi, Kang and Lovejoy established an asymptotic formula for $M_0(n)-M_1(n)$. By utilizing this formula with the explicit bound, we show that…

The study of flattened partitions is an active area of current research. In this paper, our study unexpectedly leads us to the OEIS numbers A124324. We provide a new combinatorial interpretation of these numbers. A combinatorial bijection…

It is well-known that two conjugate partitions have the same hook multiset. But two different partitions with the same hook multiset may not be conjugate to each other. In $1977$, Herman and Chung proposed the following question: What are…

We prove that the number of 01-fillings of a given stack polyomino (a polyomino with justified rows whose lengths form a unimodal sequence) with at most one 1 per column which do not contain a fixed-size northeast chain and a fixed-size…

The apportionment problem constitutes a fundamental problem in democratic societies: How to distribute a fixed number of seats among a set of states in proportion to the states' populations? This--seemingly simple--task has led to a rich…

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

This article is part of an ongoing investigation of the combinatorics of $q,t$-Catalan numbers $\textrm{Cat}_n(q,t)$. We develop a structure theory for integer partitions based on the partition statistics dinv, deficit, and minimum triangle…

A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous…

As a generalization of random recursive trees and preferential attachment trees, we consider random recursive metric spaces. These spaces are constructed from random blocks, each a metric space equipped with a probability measure,…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

We proved recently (see \cite{lhgarasu}) the result on the title for odd prime divisors of such an $n.$ The result implies for many $n's$, more precisely, for an infinity of $n$'s with an arbitrary fixed number of prime divisors, the…

We prove a conjecture by Diaz-Lopez et al. that bounds the roots of descent polynomials. To do so, we prove an algebraic inequality, which we refer to as the "Slice and Push Inequality." This inequality compares expressions that come from…

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…

Using Littlewood's map, which decomposes a partition into its $r$-core and $r$-quotient, Han and Ji have shown that many well-known hook-length formulas admit modular analogues. In this paper we present a variant of the Han-Ji…

A conjecture on the monotonicity of t-core partitions in an article of Stanton [Open positivity conjectures for integer partitions, Trends Math., 2:19-25, 1999] has been the catalyst for much recent research on t-core partitions. We…

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…