English
Related papers

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

200 papers

It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 7/3. More…

Combinatorics · Mathematics 2007-05-23 Juhani Karhumaki , Jeffrey Shallit

We obtain polynomial decay rates for $C_{0}$-semigroups, assuming that the resolvent grows polynomially at infinity in the complex right half-plane. Our results do not require the semigroup to be uniformly bounded, and for unbounded…

Functional Analysis · Mathematics 2026-05-20 Chenxi Deng , Jan Rozendaal , Mark Veraar

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Algebraic Geometry · Mathematics 2010-09-21 Ha Nguyen , Victoria Powers

We study the Dyson rank function $N(r,3;n)$, the number of partitions of $n$ with rank $\equiv r \pmod 3$. We investigate the convexity of these functions. We extend $N(r,3;n)$ multiplicatively to the set of partitions, and we determine the…

Number Theory · Mathematics 2016-07-14 Elaine Hou , Meena Jagadeesan

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Algebraic Geometry · Mathematics 2012-05-10 Aleksandr Pukhlikov

A recent paper examined the global structure of integer partitions sequences and, via combinatorial analysis using modular arithmetic, derived a closed form expression for a map from (N, M) to the set of all partitions of a positive integer…

Mathematical Physics · Physics 2007-05-23 N. M. Chase

A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from…

Combinatorics · Mathematics 2023-07-04 Yuval Filmus , Eldar Fischer , Johann A. Makowsky , Vsevolod Rakita

We study the restricted growth function associated with set partitions, and obtain exact formulas for the number of strong records with height one, the total of record heights over set of partitions, and the number of partitions with a…

Combinatorics · Mathematics 2019-08-05 Toufik Mansour , Reza Rastegar , Alexander Roitershtein

We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…

Combinatorics · Mathematics 2018-03-20 P. A. García-Sánchez , D. Marín-Aragón , A. M. Robles-Pérez

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

Number Theory · Mathematics 2024-02-14 Noah Lebowitz-Lockard , Joseph Vandehey

Given a subset $S=\{s_0, s_1\}$ of the complex plane with two points and an infinite subset ${\mathscr S}$ of $S\times {\mathbb N}$, where ${\mathbb N}=\{0,1,2,\dots\}$ is the set of nonnegative integers, we ask for a lower bound for the…

Number Theory · Mathematics 2019-12-03 Michel Waldschmidt

A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…

Number Theory · Mathematics 2020-04-22 Melvyn B. Nathanson

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

Classical Analysis and ODEs · Mathematics 2020-01-01 R. M. Trigub

We introduce the {\it growth partition function} $Z_{\Gamma,G}(t)$ associate with any cancellative infinite monoid $\Gamma$ with a finite generator system $G$. It is a power series in $t$ whose coefficients lie in integral Lie-like space…

Group Theory · Mathematics 2010-10-08 Kyoji Saito

Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…

Number Theory · Mathematics 2022-02-10 Andrew O'Desky

Let $A$ be an artin algebra. The aim of this work is to describe the enlargements of an indecomposable complex in $\mathbf{C}_{n}(\mbox{proj} \,A)$, and to study the irreducible morphisms between them. Precisely, we prove that any…

Representation Theory · Mathematics 2025-09-17 Claudia Chaio , Alfredo Gonzalez Chaio , Pamela Suarez

Let $pod_{\ell}(n)$ be the number of $\ell$-regular partitions of $n$ with distinct odd parts. In this article, prove that for any positive integer $k$, the set of non-negative integers $n$ for which $pod_{\ell}(n)\equiv 0 \pmod{p^{k}}$ has…

Number Theory · Mathematics 2021-09-22 Chiranjit Ray

For primes $\ell$ and nonnegative integers $a$, we study the partition functions $$p_\ell(a;n):= \#\{\lambda \vdash n : \text{ord}_\ell(H(\lambda))=a\},$$ where $H(\lambda)$ denotes the product of hook lengths of a partition $\lambda$.…

Number Theory · Mathematics 2023-06-05 Annemily G. Hoganson , Thomas Jaklitsch

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

Number Theory · Mathematics 2024-05-07 Anton Shakov