中文
相关论文

相关论文: Exponential Sums and Congruences with Factorials

200 篇论文

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

组合数学 · 数学 2025-02-03 Michael J. Schlosser , Nian Hong Zhou

Two distinct systems of commutative complex numbers in n dimensions are described, of polar and planar types. Exponential forms of n-complex numbers are given in each case, which depend on geometric variables. Azimuthal angles, which are…

算子代数 · 数学 2007-05-23 Silviu Olariu

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

Let $f(x) \in \mathbb{Z}[x]$. Set $f_{0}(x) = x$ and, for $n \geq 1$, define $f_{n}(x)$ $=$ $f(f_{n-1}(x))$. We describe several infinite families of polynomials for which the infinite product \prod_{n=0}^{\infty} (1 + \frac{1}{f_{n}(x)})…

数论 · 数学 2019-01-04 James Mc Laughlin

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

数论 · 数学 2010-01-21 Xavier Taixes i Ventosa , Gabor Wiese

Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{\nu \geq 1} \left\{\frac{n}{p^\nu}\right\} > 1 \quad \iff \quad p \mid…

数论 · 数学 2017-08-24 Bernd C. Kellner

We propose a conjecture for exponential sums which generalizes both a conjecture by Igusa and a local variant by Denef and Sperber, in particular, it is without the homogeneity condition on the polynomial in the phase, and with new…

数论 · 数学 2014-06-04 Raf Cluckers , Willem Veys

In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…

数论 · 数学 2023-12-08 Parham Zarghami

Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…

数论 · 数学 2014-02-26 Werner Georg Nowak , László Tóth

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a non-empty subset of $\mathbb{F}_p.$ In this paper we give an explicit version of the sum-product estimate of Bourgain, Katz, Tao and Bourgain,…

数论 · 数学 2007-05-23 M. Z. Garaev

Let $t(N)$ denote the largest number such that $N!$ can be expressed as the product of $N$ integers greater than or equal to $t(N)$. The bound $t(N)/N = 1/e-o(1)$ was apparently established in unpublished work of Erd\H{o}s, Selfridge, and…

We prove that a certain family of sums of products of three binomials has alternating behavior modulo a prime $p$. To accomplish this we rewrite these sums as signed sums of products of three binomials, the better to handle $p$, and we give…

组合数学 · 数学 2022-03-03 Michael J. J. Barry

The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at…

数论 · 数学 2008-06-10 Aicardi Francesca

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

组合数学 · 数学 2018-05-24 Dazhao Tang

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…

组合数学 · 数学 2020-12-16 Simon Macourt , Giorgis Petridis , Ilya D. Shkredov , Igor E. Shparlinski

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…

数论 · 数学 2021-09-16 Riyajur Rahman , Nipen Saikia

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

数论 · 数学 2007-05-23 I. E. Shparlinski , J. F. Voloch

It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…

数论 · 数学 2020-09-15 Max Alekseyev , Jose Maria Grau , Amtonio Oller-Marcen

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

最优化与控制 · 数学 2014-01-13 Bogdan Dumitrescu , Bogdan C. Sicleru , Florin Avram

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng