English
Related papers

Related papers: Compositions inside a rectangle and unimodality

200 papers

A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…

Number Theory · Mathematics 2016-05-10 Matthias Beck , Neville Robbins

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

Combinatorics · Mathematics 2012-02-08 Martin E. Malandro

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

For integers $n,k,s$, we give a formula for the number $T(n,k,s)$ of order $k$ subsets of the ring $\mathbb{Z}/n\mathbb{Z}$ whose sum of elements is $s$ modulo $n$. To do so, we describe explicitly a sequence of matrices $M(k)$, for…

Number Theory · Mathematics 2025-03-21 David Broadhurst , Xavier Roulleau

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

In this paper, we examine the unimodality and strict unimodality of certain formal bivariate Laurent series with non-negative coefficients. We show that the sets of these formal bivariate Laurent series form commutative semirings under the…

Combinatorics · Mathematics 2025-04-28 Nian Hong Zhou

For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…

Combinatorics · Mathematics 2021-07-26 Henri Mühle , Philippe Nadeau , Nathan Williams

We show that cylindric partitions are in one-to-one correspondence with a pair which has an ordinary partition and a colored partition into distinct parts. Then, we show the general form of the generating function for cylindric partitions…

Combinatorics · Mathematics 2023-09-01 Kağan Kurşungöz , Halime Ömrüuzun Seyrek

Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…

Combinatorics · Mathematics 2007-05-23 Miklos Bona , Bruce Sagan , Vincent Vatter

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

Combinatorics · Mathematics 2014-03-13 Igor Pak , Greta Panova

For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…

Combinatorics · Mathematics 2023-10-31 Darlison Nyirenda , Molatelo Rapudi

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Number Theory · Mathematics 2018-09-05 Marie Jameson , Maggie Wieczorek

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

Combinatorics · Mathematics 2023-05-11 Faye Jackson , Misheel Otgonbayar

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using theta function identities due to Ramanujan, we establish some new infinite…

Number Theory · Mathematics 2019-07-23 S. Abinash , T. Kathiravan , K. Srilakshmi

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

A $k$-regular partition into distinct parts is a partition into distinct parts with no part divisible by $k$. In this paper, we provide a general method to establish the unimodality of $k$-regular partition into distinct parts where the…

Combinatorics · Mathematics 2023-06-13 Janet J. W. Dong , Kathy Q. Ji

For all positive integers $k,l,n$, the Little Glaisher theorem states that the number of partitions of $n$ into parts not divisible by $k$ and occurring less than $l$ times is equal to the number of partitions of $n$ into parts not…

Combinatorics · Mathematics 2022-07-26 Isaac Konan

The connected components of $\mathcal{M}_{0,n}(\mathbb{R})$ are in bijection with the $(n-1)!/2$ dihedral orderings of $[n]$. They are all isomorphic. We construct monomial maps between them, and use these maps to prove a conjecture of…

Combinatorics · Mathematics 2025-09-05 Veronica Calvo Cortes , Hannah Tillmann-Morris

We prove that the Cuntz-Pimsner algebra O(E) of a vector bundle E over a compact metrizable space X is determined up to an isomorphism of C(X)-algebras by the ideal (1-[E])K(X) of the K-theory ring K(X). Moreover, if E and F are vector…

Operator Algebras · Mathematics 2010-04-27 Marius Dadarlat

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Combinatorics · Mathematics 2009-11-18 Bruce Sagan , Carla Savage