English
Related papers

Related papers: MC-finiteness of restricted set partition function…

200 papers

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

Number Theory · Mathematics 2020-04-16 S. S. Rout , N. K. Meher

We give necessary and sufficient conditions for a Fibonacci cycle to be residue complete (nondefective). In particular, the Lucas numbers modulo m is residue complete if and only if m = 2,4,6,7,14 or a power of 3.

Number Theory · Mathematics 2013-07-12 Cheng Lien Lang , Mong Lung Lang

Let $S$ be a finitely generated standard multigraded algebra over an Artinian local ring $A$; $M$ a finitely generated multigraded $S$-module. This paper answers to the question when mixed multiplicities of $M$ are positive and…

Commutative Algebra · Mathematics 2009-01-27 Nguyen Tien Manh , Duong Quoc Viet

In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…

Combinatorics · Mathematics 2022-05-25 Riccardo Aragona , Roberto Civino , Norberto Gavioli , Carlo Maria Scoppola

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

Number Theory · Mathematics 2022-12-01 Bartosz Sobolewski , Maciej Ulas

A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…

Number Theory · Mathematics 2007-05-23 Dohoon Choi , Soon-Yi Kang , Jeremy Lovejoy

If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vec{\lambda}=(\lambda_1,\lambda_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the…

Combinatorics · Mathematics 2012-03-13 Eric Schmutz , Caroline Shapcott

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

Combinatorics · Mathematics 2022-05-13 Damanvir Singh Binner

We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being…

Number Theory · Mathematics 2015-09-29 Alexandre Laugier , Manjil Saikia

In this paper we study $b_5(n)$, the $5$-regular partitions of $n$. Using the theory of modular forms, we prove several theorems on the divisibility and distribution properties of $b_5(n)$ modulo prime $m\geq5$. In particular, we prove that…

Number Theory · Mathematics 2022-08-04 Qi-Yang Zheng

We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…

Combinatorics · Mathematics 2019-11-13 William J. Keith

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Group Theory · Mathematics 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

In this article we prove that all completely multiplicative automatic sequences $(a_n)_{n \in \mathbf{N}}$ defined on $\mathbf{C}$, vanishing or not, can be written in the form $a_n=b_n\chi_n$ where $(b_n)_{n \in \mathbf{N}}$ is an almost…

Combinatorics · Mathematics 2019-11-28 Shuo Li

A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…

Number Theory · Mathematics 2017-06-22 Julian Rosen

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

Combinatorics · Mathematics 2022-05-24 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

It is consistent for every (1 <= n< omega) that (2^omega = omega_n) and there is a function (F:[omega_n]^{< omega}-> omega) such that every finite set can be written at most (2^n-1) ways as the union of two distinct monocolored sets. If GCH…

Logic · Mathematics 2016-09-06 Peter Komjath , Saharon Shelah

Let $(R, \mathfrak{m})$ be a noetherian local ring, $M$ a separated $R$-module (i.e. $\bigcap\limits_{n\geq 1}\mathfrak{m}^n M = 0$) and $\widehat{M} = \lim\limits_{\leftarrow} M/\mathfrak{m}^n M$ its completion. Generally, $M$ is not pure…

Commutative Algebra · Mathematics 2015-04-02 Helmut Zöschinger

A theorem of A. and C. R\'enyi on periodic entire functions states that an entire function $f(z) $ must be periodic if $ P(f(z)) $ is periodic, where $ P(z) $ is a non-constant polynomial. By extending this theorem, we can answer some open…

Complex Variables · Mathematics 2022-07-20 Zinelaabidine Latreuch , Amine Zemirni

Following Boros--Moll, a sequence $(a_n)$ is $m$-log-concave if $\mathcal{L}^j (a_n) \geq 0$ for all $j = 0, 1, \ldots, m$. Here, $\mathcal{L}$ is the operator defined by $\mathcal{L} (a_n) = a_n^2 - a_{n - 1} a_{n + 1}$. By a criterion of…

Combinatorics · Mathematics 2014-05-09 Luis A. Medina , Armin Straub

For any real sequence {c(n)} tending to infinity as n tends to infinity, this constructs a function f which is continuous and integrable, and such that for every nonzero x, limsup c(n) f(n x) is infinite.

Classical Analysis and ODEs · Mathematics 2011-01-21 George W. Batten