English
Related papers

Related papers: On the growth of restricted integer partition func…

200 papers

Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…

Rings and Algebras · Mathematics 2012-04-17 Eli Aljadeff , Antonio Giambruno

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

Combinatorics · Mathematics 2007-05-23 William M. Y. Goh , Pawel Hitczenko , Ali Shokoufandeh

We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply…

Number Theory · Mathematics 2018-12-17 Jaroslav Hančl

A set $X\subseteq\mathbb N$ is S-recognizable for an abstract numeration system S if the set $\rep_S(X)$ of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable set is always either…

Formal Languages and Automata Theory · Computer Science 2011-01-04 Emilie Charlier , Narad Rampersad

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

Number Theory · Mathematics 2017-10-06 Xiang-Zi Meng , Zhi-Wei Sun

We study $\nu_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $\nu_2$ and $\nu_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $\nu_2(An+B) \equiv 0…

Combinatorics · Mathematics 2016-05-05 William J. Keith

We continue the study of the $(a,b,m)$-copartition function $\mathrm{cp}_{a,b,m}(n)$, which arose as a combinatorial generalization of Andrews' partitions with even parts below odd parts. The generating function of $\mathrm{cp}_{a,b,m}(n)$…

Number Theory · Mathematics 2022-01-13 Hannah E. Burson , Dennis Eichhorn

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

Combinatorics · Mathematics 2009-06-12 E. Rodney Canfield , Brendan D. McKay

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-10-22 Adam Gowty , Daniel Horsley

Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse , Kálmán Győry

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

Number Theory · Mathematics 2024-12-04 Koustav Banerjee , Peter Paule , Cristian-Silviu Radu , Carsten Schneider

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

Number Theory · Mathematics 2021-07-01 Rinchin Drema , Nipen Saikia

We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…

Group Theory · Mathematics 2007-05-23 Michael Larsen , Alexander Lubotzky

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

Combinatorics · Mathematics 2023-12-14 Sarah Peluse

Let $M=(m_{i})_{i=0}^{\infty}$ be a sequence of integers such that $m_{0}=1$ and $m_{i}\geq 2$ for $i\geq 1$. In this paper we study $M$-ary partition polynomials $(p_{M}(n,t))_{n=0}^{\infty}$ defined as the coefficient in the following…

Combinatorics · Mathematics 2024-03-13 Błażej Żmija

Given two closed oriented manifolds $M,N$ of the same dimension, we denote the set of degrees of maps from $M$ to $N$ by $D(M,N)$. The set $D(M,N)$ always contains zero. We show the following (non-)realisability results: (i) There exists an…

Geometric Topology · Mathematics 2025-08-15 Christoforos Neofytidis , Shicheng Wang , Zhongzi Wang

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

Statistical Mechanics · Physics 2009-11-10 Ville Mustonen , R. Rajesh

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…

Algebraic Geometry · Mathematics 2016-06-16 Christian Urech

Suppose $(M^{n},g)$ is a Riemannian manifold with nonnegative Ricci curvature, and let $h_{d}(M)$ be the dimension of the space of harmonic functions with polynomial growth of growth order at most $d$. Colding and Minicozzi proved that…

Differential Geometry · Mathematics 2017-05-16 Xian-Tao Huang

Let $p_{r,s}(n)$ denote the number of partitions of a positive integer $n$ into parts containing no multiples of $r$ or $s$, where $r>1$ and $s>1$ are square-free, relatively prime integers. We use classical methods to derive a…

Number Theory · Mathematics 2019-01-17 James Mc Laughlin , Scott Parsell
‹ Prev 1 3 4 5 6 7 10 Next ›