English
Related papers

Related papers: Inequalities between overpartition ranks for all m…

200 papers

Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Recently, Fortin-Jacob-Mathieu and Hirschhorn-Sellers independently obtained 2-, 3- and 4-dissections of the generating function for $\overline{p}(n)$ and derived a number of…

Combinatorics · Mathematics 2014-08-08 William Y. C. Chen , Qing-Hu Hou , Lisa H. Sun , Li Zhang

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

Number Theory · Mathematics 2026-05-21 M. P. Thejitha , S. N. Fathima

We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…

Number Theory · Mathematics 2022-04-07 Michael Hanson , Jeremiah Smith

To better understand the overlapping modular organization of large networks with respect to flow, here we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between…

Physics and Society · Physics 2012-02-03 Alcides Viamontes Esquivel , Martin Rosvall

Recently the author introduced two new integer partition quadruple functions, which satisfy Ramanujan-type congruences modulo $3$, $5$, $7$, and $13$. Here we reprove the congruences modulo $3$, $5$, and $7$ by defining a rank-type…

Number Theory · Mathematics 2016-03-02 Chris Jennings-Shaffer

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

We compute an asymptotic estimate for odd balanced unimodal sequences for ranks congruent to $a \pmod{c}$ for $c\neq 1$ odd. We find the interesting result that the odd balanced unimodal sequences are asymptotically related to the…

Number Theory · Mathematics 2022-02-07 Taylor Garnowski

A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…

Number Theory · Mathematics 2025-07-08 Judy Ann Donato

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Combinatorics · Mathematics 2018-11-21 Kedar Karhadkar

We describe new relations among conformal block divisors in $\operatorname{Pic}(\bar{\operatorname{M}}_{0,n})$. These relations appear from various rank-level dualities of conformal blocks on $\mathbb{P}^1$ with $n$ marked points. We also…

Algebraic Geometry · Mathematics 2015-11-24 Swarnava Mukhopadhyay

We prove that the generating function of overpartition $M2$-rank differences is, up to coefficient signs, a component of the vector-valued mock Eisenstein series attached to a certain quadratic form. We use this to compute analogs of the…

Number Theory · Mathematics 2018-09-26 Brandon Williams

In this paper, we generalize Andrews' partitions separated by parity to overpartitions in two ways. We investigate the generating functions for 16 overpartition families whose parts are separated by parity, and we prove various $q$-series…

Number Theory · Mathematics 2026-01-14 Kathrin Bringmann , Catherine Cossaboom , William Craig

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

Geometric Topology · Mathematics 2017-05-11 Jun Ge , Slavik Jablan , Louis H. Kauffman , Pedro Lopes

Comparing the internal representations of neural networks is a central goal in both neuroscience and machine learning. Standard alignment metrics operate on raw neural activations, implicitly assuming that similar representations produce…

Machine Learning · Computer Science 2026-04-02 Sunny Liu , Habon Issa , André Longon , Liv Gorton , Meenakshi Khosla , David Klindt

We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.

Combinatorics · Mathematics 2013-03-11 Yaroslav Shitov

In 2007, Andrews studied the odd Durfee symbols and their odd ranks. Let $N^0(m,k,n)$ denote the number of odd Durfee symbols of $n$ with odd rank congruent to $m$ modulo $k$. Motivated by Andrews' work, many authors obtained generating…

Combinatorics · Mathematics 2024-08-20 Renrong Mao , Zhiqian Zhou

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

Number Theory · Mathematics 2024-05-30 James A. Sellers

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

Combinatorics · Mathematics 2017-04-05 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to…

Information Theory · Computer Science 2022-11-18 Olga Polverino , Paolo Santonastaso , John Sheekey , Ferdinando Zullo

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

Combinatorics · Mathematics 2026-03-16 D. S. Gireesh , B. Hemanthkumar
‹ Prev 1 3 4 5 6 7 10 Next ›