中文
相关论文

相关论文: Combinatorial congruences and Stirling numbers

200 篇论文

We study an integer sequence associated with Cantor's division polynomials of a genus 2 curve having an integral point. We show that the reduction modulo $p$ of such a sequence is periodic for all but finitely many primes $p$, and describe…

We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…

组合数学 · 数学 2017-10-10 Tanay Wakhare

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

组合数学 · 数学 2017-09-22 Moa Apagodu

In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$…

数论 · 数学 2019-01-28 Guo-Shuai Mao , Hao Pan

We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…

组合数学 · 数学 2026-03-10 Jean-Christophe Pain

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

数论 · 数学 2011-08-25 Zhi-Hong Sun

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

综合数学 · 数学 2021-09-10 Roudy El Haddad

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

数论 · 数学 2021-05-18 Arne Winterhof , Zibi Xiao

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

交换代数 · 数学 2007-06-13 R. J. Shank , D. L. Wehlau

The purpose of this note is to obtain some congruences modulo a power of a prime $p$ involving the truncated hypergeometric series $$\sum_{k=1}^{p-1} {(x)_k(1-x)_k\over (1)_k^2}\cdot{1\over k^a}$$ for $a=1$ and $a=2$. In the last section,…

数论 · 数学 2011-05-24 Roberto Tauraso

We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…

组合数学 · 数学 2018-12-03 Beáta Bényi , Miguel Méndez , José L. Ramírez , Tanay Wakhare

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

数论 · 数学 2020-05-19 Arne Winterhof , Zibi Xiao

This paper introduces a novel generalization of Stirling and Lah numbers, termed ``heterogeneous Stirling numbers," which smoothly interpolate between these classical combinatorial sequences. Specifically, we define heterogeneous Stirling…

综合数学 · 数学 2025-04-01 Taekyun Kim , Dae San Kim

In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both…

组合数学 · 数学 2008-06-17 Milan Janjic

In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\\i+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th…

数论 · 数学 2021-10-20 Shane Chern

In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are…

组合数学 · 数学 2021-09-29 Matthew Just

We introduce a new conjecture on products of two distinct primes that would provide a partial answer to a conjecture of McIntosh. Also, $\binom{2p-1}{p-1}-1$ is written in terms of a polynomial in prime $p$ over the integers and we discuss…

数论 · 数学 2019-07-18 Saud Hussein

We explore a combinatorial bijection between two seemingly unrelated topics: the roots of irreducible polynomials of degree $m$ over a finite field $F_p$ for a prime number $p$ and the number of points that are periodic of order $m$ for a…

组合数学 · 数学 2023-05-24 Emerson León , Julián Pulido

We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…

组合数学 · 数学 2017-03-31 Maxie D. Schmidt

We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…

数论 · 数学 2026-04-22 Benoit Cloitre