English
Related papers

Related papers: On bar lengths in partitions

200 papers

When $p$ and $q$ are coprime odd integers no less than 3, Olsson proved that the $q$-bar-core of a $p$-bar-core is again a $p$-bar-core. We establish a generalisation of this theorem: that the $p$-bar-weight of the $q$-bar-core of a bar…

Combinatorics · Mathematics 2021-07-12 Dean Yates

We present a study of the connection between the galactic spin parameter $\lambda_{d}$ and the bar fraction in a volume-limited sample of 10,674 disk galaxies drawn from the Sloan Digital Sky Survey Data Release 7. The galaxies in our…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-15 Bernardo Cervantes-Sodi , Cheng Li , Changbom Park , Lixin Wang

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

We consider a type of divided symmetrization $\overrightarrow{D}_{\lambda,G}$ where $\lambda$ is a nonincreasing partition on $n$ and where $G$ is a graph. We discover that in the case where $\lambda$ is a hook shape partition with first…

Combinatorics · Mathematics 2019-08-27 Nate Ince

Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…

Combinatorics · Mathematics 2007-05-23 Timothy Y. Chow , C. Kenneth Fan , Michel X. Goemans , Jan Vondrak

Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…

Combinatorics · Mathematics 2007-05-23 Peter Clifford

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

Combinatorics · Mathematics 2026-04-29 Nathan Kaplan , Kaylee Kim , Cole McGeorge , Fabian Ramirez , Deepesh Singhal

We prove new formulas for $p_d(n)$, the number of $d$-ary partitions of $n$, and, also, for its polynomial part. Given a partition $\lambda=(\lambda_1,\ldots,\lambda_{\ell})$, its associated $j$-th symmetric elementary partition,…

Combinatorics · Mathematics 2026-01-15 Mircea Cimpoeas , Roxana Tanase

In this paper, we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the…

Combinatorics · Mathematics 2013-01-09 Christine Bessenrodt , Jorn B. Olsson , Jean-Baptiste Gramain

We prove that the v-decomposition number $d_{\lambda\mu}(v)$ is an even or odd polynomial according to whether the partitions $\lambda$ and $\mu$ have the same relative sign (or parity) or not. We then use this result to verify Martin's…

Representation Theory · Mathematics 2007-05-23 Kai Meng Tan

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…

Combinatorics · Mathematics 2024-06-27 Catherine Cossaboom

We show that the shifted rank, or srank, of any partition $\lambda$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_{\lambda}$ function in terms of power sum symmetric functions. This gives…

Combinatorics · Mathematics 2008-05-20 William Y. C. Chen , Donna Q. J. Dou , Robert L. Tang , Arthur L. B. Yang

We give new lower bounds for $M(n,d)$, for various positive integers $n$ and $d$ with $n>d$, where $M(n,d)$ is the largest number of permutations on $n$ symbols with pairwise Hamming distance at least $d$. Large sets of permutations on $n$…

Information Theory · Computer Science 2019-07-24 Sergey Bereg , Luis Gerardo Mojica , Linda Morales , Hal Sudborough

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

Combinatorics · Mathematics 2008-09-12 Ivan Feshchenko , Danylo Radchenko , Lev Radzivilovsky , Maksym Tantsiura

Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length $2$,…

Combinatorics · Mathematics 2023-08-30 Cristina Ballantine , Hannah Burson , William Craig , Amanda Folsom , Boya Wen

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

Combinatorics · Mathematics 2007-05-23 K. Alladi , A. Berkovich

It is a classical result that configuration spaces of labelled particles in $\mathbb{R}^d$ are free $E_d$-algebras and that their $d$-fold bar construction is equivalent to the $d$-fold suspension of the labelling space. In this paper, we…

Algebraic Topology · Mathematics 2024-05-31 Florian Kranhold

Using only a symmetric p-core partition and p-quotient, we give an explicit formula for the set of diagonal hook lengths of the associated symmetric partition.

Combinatorics · Mathematics 2009-03-17 Rishi Nath

Let $1<d<e$ be two coprime integers and let $m_e$ denote the Mullineux map, which for $e$ prime describes tensor products of the irreducible modules of symmetric groups with the sign in characteristic $e$. We prove that if $\lambda$ is an…

Combinatorics · Mathematics 2025-04-08 Pavel Turek

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

Combinatorics · Mathematics 2008-07-14 Guo-Niu Han
‹ Prev 1 2 3 10 Next ›