English
Related papers

Related papers: On the restricted $k$-multipartition function

200 papers

The recently introduced $\{k\}$-packing function problem is considered in this paper. Special relation between a case when $k=1$, $k\ge 2$ and linear programming relaxation is introduced with sufficient conditions for optimality. For…

Combinatorics · Mathematics 2018-03-09 Jozef J. Kratica , Aleksandar Lj. Savić , Zoran Lj. Maksimović

In this short note, we study the rank of a restricted Lie algebra $(\mathfrak{g},[p])$ and give some applications, which concerns the dimensions of non-trivial irreducible modules. We also compute the rank of the restricted contact algebra…

Rings and Algebras · Mathematics 2016-09-07 Hao Chang

Given two integers $k\geq 2$ and $a>1$, let $N_k(a)$ stand for the number of multinomial coefficients, with $k$ terms, equal to $a$. We study the behavior of $N_k(a)$ and show that its average and normal orders are equal to $k(k-1)$. We…

Number Theory · Mathematics 2021-07-21 Jean-Marie de Koninck , Nicolas Doyon , William Verreault

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…

Combinatorics · Mathematics 2019-06-27 Hemar Godinho , José Plínio O. Santos

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

Number Theory · Mathematics 2021-09-16 Riyajur Rahman , Nipen Saikia

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…

Number Theory · Mathematics 2019-08-15 Kostadinka Lapkova , Stanley Yao Xiao

We investigate the density of compactly supported smooth functions in the Sobolev space $W^{k,p}$ on complete Riemannian manifolds. In the first part of the paper, we extend to the full range $p\in [1,2]$ the most general results known in…

Differential Geometry · Mathematics 2024-10-15 Shouhei Honda , Luciano Mari , Michele Rimoldi , Giona Veronelli

We have primarily obtained three results on numbers of the form $p + 2^k$. Firstly, we have constructed many arithmetic progressions, each of which does not contain numbers of the form $p + 2^k$, disproving a conjecture by Erd\H{o}s as Chen…

Number Theory · Mathematics 2024-02-13 Yuda Chen , Xiangjun Dai , Huixi Li

We count the algebraic numbers of fixed degree by their $\mathbf{w}$-weighted $l_p$-norm which generalizes the na\"ive height, the length, the Euclidean and the Bombieri norms. For non-negative integers $k,l$ such that $k+2l\leq n$ and a…

Number Theory · Mathematics 2019-10-08 Friedrich Götze , Denis Koleda , Dmitry Zaporozhets

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

Number Theory · Mathematics 2025-10-10 Scott Ahlgren , Olivia Beckwith

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

Combinatorics · Mathematics 2018-05-22 Toufik Mansour , Madjid Mirzavaziri , Daniel Yaqubi

Let A be a finite subset of N^n and R[x]_A be the space of real polynomials whose monomial powers are from A. Let K be a compact basic semialgebraic set of R^n such that R[x]_A contains a polynomial that is positive on K. Denote by P_A(K)…

Optimization and Control · Mathematics 2014-07-18 Jiawang Nie

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

Number Theory · Mathematics 2018-04-11 Heng Huat Chan , Liuquan Wang

Let $m$, $k_1$, and $k_2$ be three integers with $m\ge 2$. For any set $A\subseteq \mathbb{Z}_m$ and $n\in \mathbb{Z}_m$, let $\hat{r}_{k_1,k_2}(A,n)$ denote the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In…

Number Theory · Mathematics 2014-09-16 Quan-Hui Yang , Yong-Gao Chen

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…

Number Theory · Mathematics 2026-01-21 Madhuparna Das , Nicolas Robles

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

We derive lower and upper bounds on possible growth rates of certain sets of positive integers $A_k=\{1= a_1 < a_2 < ... < a_{k}\}$ such that all integers $n\in \{0, 1, 2, ..., ka_{k}\}$ can be represented as a sum of no more than $k$…

Number Theory · Mathematics 2014-01-30 Hugh Thomas , Stephanie van Willigenburg

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

General Mathematics · Mathematics 2022-12-20 M. J. Kronenburg

A long-investigated problem in circuit complexity theory is to decompose an $n$-input or $n$-variable Majority Boolean function (call it $M_n$) using $k$-input ones ($M_k$), $k < n$, where the objective is to achieve the decomposition using…

Logic in Computer Science · Computer Science 2025-04-07 Anupam Chattopadhyay , Debjyoti Bhattacharjee , Subhamoy Maitra