English
Related papers

Related papers: Multi-cores, posets, and lattice paths

200 papers

This note is concerned with the set of integral solutions of the equation $x^2+3y^2=12n+4$, where $n$ is a positive integer. We will describe a parametrization of this set using the 3-core partitions of n. In particular we construct a crank…

Number Theory · Mathematics 2021-01-06 Olivier Brunat , Rishi Nath

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

Combinatorics · Mathematics 2023-05-08 Delia Garijo , Andrew Goodall , Lluís Vena

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

Combinatorics · Mathematics 2020-06-02 Colin Defant , Michael Engen , Jordan A. Miller

In this paper, we are mainly concerned with the enumeration of $(2k+1, 2k+3)$-core partitions with distinct parts. We derive the number and the largest size of such partitions, confirming two conjectures posed by Straub.

Combinatorics · Mathematics 2016-04-14 Sherry H. F. Yan , Guizhi Qin , Zemin Jin , Robin D. P. Zhou

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)$. Recently, both authors…

Number Theory · Mathematics 2023-02-24 Nabin Kumar Meher , Ankita Jindal

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Combinatorics · Mathematics 2025-07-08 Bruce E Sagan , Sheila Sundaram

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…

Combinatorics · Mathematics 2007-06-18 Alexander E. Holroyd

New identities on traces of representations of the Hecke algebra on the spaces of paths on graphs are presented. These identities are relevant in the computation of partition functions with fixed boundary conditions and of two-point…

q-alg · Mathematics 2009-10-30 S. Loesch , Y-K Zhou , J-B Zuber

In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections…

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

There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove that the total size of a random partition of this kind…

Combinatorics · Mathematics 2021-09-14 Chaim Even-Zohar

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a,b)$-core partition is $(a+b+1)(a-1)(b-1)/24$. He used various coordinate changes and one-to-one correspondences that are useful for counting…

Combinatorics · Mathematics 2017-11-07 Jineon Baek , Hayan Nam , Myungjun Yu

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 $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

Combinatorics · Mathematics 2025-06-18 Gurinder Singh , Rupam Barman

In 2007, Olsson and Stanton gave an explicit form for the largest $(a, b)$-core partition, for any relatively prime positive integers $a$ and $b$, and asked whether there exists an $(a, b)$-core that contains all other $(a, b)$-cores as…

Combinatorics · Mathematics 2014-11-27 Amol Aggarwal

We study a natural generalization of the notion of cores for l-partitions attached with a multi-charge s $\in$ Z^l : the (e, s)-cores. We rely them both to the combinatorics and the notion of weight defined by Fayers. Next we study…

Combinatorics · Mathematics 2020-01-14 Nicolas Jacon , Cédric Lecouvey

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…

Combinatorics · Mathematics 2021-01-22 Matthieu Latapy

The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be defined on an arbitrary finite graph G, or more generally on an arbitrary matroid M, and encodes much important combinatorial information…

Combinatorics · Mathematics 2021-01-01 Alan D. Sokal

In this paper we derive an explicit formula for the number of representations of an integer by the sextenary form x^2+y^2+z^2+ 7s^2+7t^2+ 7u^2. We establish the following intriguing inequalities 2b(n)>=a_7(n)>=b(n) for n not equal to…

Number Theory · Mathematics 2008-04-15 Alexander Berkovich , Hamza Yesilyurt

We extend the edge-coloring notion of core (subgraph induced by the vertices of maximum degree) to $t$-core (subgraph induced by the vertices $v$ with $d(v)+\mu(v)> \Delta+t$), and find a sufficient condition for $(\Delta+t)$-edge-coloring.…

Combinatorics · Mathematics 2018-08-01 Jessica McDonald , Gregory J. Puleo

We consider the $t$-core of an $s$-core partition, when $s$ and $t$ are coprime positive integers. Olsson has shown that the $t$-core of an $s$-core is again an $s$-core, and we examine certain actions of the affine symmetric group on…

Combinatorics · Mathematics 2012-02-20 Matthew Fayers