English
Related papers

Related papers: Line configurations and r-Stirling partitions

200 papers

We construct an action of the Hecke algebra $H_n(q)$ on a quotient of the polynomial ring $F[x_1, \dots, x_n]$, where $F = \mathbb{Q}(q)$. The dimension of our quotient ring is the number of $k$-block ordered set partitions of $\{1, 2,…

Combinatorics · Mathematics 2019-02-26 Jia Huang , Brendon Rhoades , Travis Scrimshaw

Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…

Combinatorics · Mathematics 2026-01-23 M. P. Thejitha , James A. Sellers , S. N. Fathima

We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…

Dynamical Systems · Mathematics 2012-12-07 Artur Siemaszko , Maciej P. Wojtkowski

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

Representation Theory · Mathematics 2023-11-09 Steven Benzel , Scott Conner , Nham Ngo , Khang Pham

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Susan Y. J. Wu , Catherine Yan

We show that the combinatorial types of the links of the vertices in the edgewise triangulation $T_{k,q}$ of a $(k-1)$-simplex are encoded by the partitions of $k$. Each of these complexes is isomorphic to a subcomplex of the barycentric…

Combinatorics · Mathematics 2025-11-25 Duško Jojić , Ognjen Papaz

Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…

Combinatorics · Mathematics 2025-05-20 Yashas N. , C. Shivashankar , S. Chandankumar

Let $r$ and $n$ be positive integers, let $G_n$ be the complex reflection group of $n \times n$ monomial matrices whose entries are $r^{\textrm{th}}$ roots of unity and let $0 \leq k \leq n$ be an integer. Recently, Haglund, Rhoades and…

Combinatorics · Mathematics 2019-06-25 Daniël Kroes

Let $p_t(a,b;n)$ denote the number of partitions of $n$ such that the number of $t$ hooks is congruent to $a \bmod{b}$. For $t\in \{2, 3\}$, arithmetic progressions $r_1 \bmod{m_1}$ and $r_2 \bmod{m_2}$ on which $p_t(r_1,m_1; m_2 n + r_2)$…

Number Theory · Mathematics 2022-06-22 Eleanor Mcspirit , Kristen Scheckelhoff

If $a_1, a_2, ..., a_k$ and $n$ are positive integers such that $n = a_1 + a_2 + ... + a_k$, then the sum $a_1 + a_2 + ... + a_k$ is said to be a \emph{partition of $n$} of \emph{length $k$}, and $a_1, a_2, ..., a_k$ are said to be the…

Combinatorics · Mathematics 2013-04-25 Peter Borg

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

Number Theory · Mathematics 2022-06-14 Madeline Locus Dawsey , Tyler Russell , Dannie Urban

Let $K_n^{(k)}$ be the complete $k$-graph on $n$ vertices. A $k$-uniform tight cycle is a $k$-graph with its vertices cyclically ordered so that every $k$ consecutive vertices form an edge and any two consecutive edges share exactly $k-1$…

Combinatorics · Mathematics 2025-02-18 Debmalya Bandyopadhyay , Allan Lo

The symmetric group $\mathfrak{S}_n$ acts on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The invariant ideal $I_n$ is the ideal generated by all $\mathfrak{S}_n$-invariant…

Combinatorics · Mathematics 2019-04-04 James Haglund , Brendon Rhoades , Mark Shimozono

In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…

Combinatorics · Mathematics 2007-11-15 Emma Y. Jin , Jing Qin , Christian M. Reidys

We study M(n,k,r), the number of orbits of {(a_1,...,a_k)\in Z_n^k | a_1+...+a_k = r (mod n)} under the action of S_k. Equivalently, M(n,k,r) sums the partition numbers of an arithmetic sequence: M(n,k,r) = sum_{t \geq 0} p(n-1,k,r+nt),…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Alex J. Feingold , Michael D. Weiner

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

Combinatorics · Mathematics 2022-05-30 Bruce E. Sagan , Joshua P. Swanson

Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…

Combinatorics · Mathematics 2023-11-29 Adam Buck , Jennifer Elder , Azia A. Figueroa , Pamela E. Harris , Kimberly Harry , Anthony Simpson

A partial $(n,k,t)_\lambda$-system is a pair $(X,\mathcal{B})$ where $X$ is an $n$-set of vertices and $\mathcal{B}$ is a collection of $k$-subsets of $X$ called blocks such that each $t$-set of vertices is a subset of at most $\lambda$…

Combinatorics · Mathematics 2023-11-23 Daniel Horsley , Padraig Ó Catháin

A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…

Combinatorics · Mathematics 2012-06-28 Connor Ahlbach , Jeremy Usatine , Nicholas Pippenger

A $(k,\ell)$-partition is a set partition which has $\ell$ blocks each of size $k$. Two uniform set partitions $P$ and $Q$ are said to be partially $t$-intersecting if there exist blocks $P_{i}$ in $P$ and $Q_{j}$ in $Q$ such that $\left|…

Combinatorics · Mathematics 2021-08-18 Karen Meagher , Mahsa N. Shirazi , Brett Stevens