Branko Dragovich
The summation formula $$ \sum^{n-1}_{i=0}ε^i i! (i^k+u_k) = v_k+ε^{n-1} n! A_{k-1}(n) $$ $(ε=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In particular, divisibility with respect to $n$ is investigated. Infinitely many equivalents to Kurepa's hypothesis on the left factorial are found.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A probabilistic proof of a recurrence relation for sums of values of degenerate falling factorials
本文研究退化下降阶乘值和的递推关系，给出其概率证明，该证明是整数幂和概率证明的退化版本。
We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions of various congruences with factorials. For example, we prove that the products of two factorials $n!m!$ with $\max\{n,m\}<p^{1/2+ε}$ are uniformly distributed modulo $p$, and that any residue class modulo $p$ is representable in the form $m!n!+n_1! + ... +n_{49}!$ with $\max \{m,n, n_1, >..., n_{49}\} < p^{8775/8794+ ε}$.
Elementary Bounds on Digital Sums of Powers, Factorials, and LCMs
本文通过初等数论方法，给出了数字幂、倍数、阶乘和最小公倍数的数字和的下界，并证明了Stewart定理。
Formulas for p-adic q-integrals including falling-rising factorials, combinatorial sums and special numbers
本文提出推导含Volkenborn积分、p进费米子积分的p进q积分公式的新方法，结合阶乘、二项式系数得到多类组合和与特殊数的恒等式，给出新组合和及新特殊数与多项式族的生成函数。
Sums of distinct divisors of factorials
本文证明阶乘的不同除数之和的覆盖数上界为(2log2+o(1))n/logn，通过结合递减贪心构造与更锐利的除数间隙估计，改进了先前结果。
A number of identities are proved by using Stirling transforms. These identities involve Stirling numbers of the first and second kinds, hyperharmonic and derangement numbers, Bernoulli and Euler numbers and polynomials, powers, power sums, and factorials.
We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p. In particular, we show that there exists a positive integer $n\ll p^{1/2+ε}, such that n! is a primitive root modulo p. We also show that every nonzero congruence class a \not \equiv 0 \pmod p can be represented as a product of 7 factorials, a \equiv n_1! ... n_7! \pmod p, where $\max \{n_i | i=1,... 7\}=O(p^{11/12+ε}), and we find the asymptotic formula for …
Generalizations of two hypergeometric sums related to conjectures of Guo
本研究在已有证明郭氏超同余猜想的超几何公式基础上，分别采用WZ方法与Zeilberger算法，对涉及升阶乘和的两类超几何公式进行了进一步推广。
In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.
A More Efficient Algorithm for Finding the Number of Permutations of $\mathbb{ZZ}/n\mathbb{ZZ}$ with Distinct Partial Sums
研究加法运算下模\(n\)整数具有不同部分和的排列数，提出改进算法计算模\(n\)整数的这些排列数，并通过双射将其与已知序列关联以计算新项。
Summation of a large class of the functional series, which terms contain factorials, is considered. We first investigated finite partial sums for integer arguments. These sums have the same values in real and all p-adic cases. The corresponding infinite functional series are divergent in the real case, but they are convergent and have p-adic invariant sums in p-adic cases. We found polynomials which generate all significant ingredients of these series and make connection between their real and p-adic properties. In particular, we found connection of one of our integer sequences with the Bell n…
On the finite factorial numbers
本文引入了有限阶乘（FF）和部分有限阶乘（PFF）两类超越数，证明了有理数不能是 FF 数，并研究了 FF 数集合的几何与拓扑性质。
Coincidence among sum formulas for zeta-like multiple values
本文研究了由平移分母嵌套和定义的multiple $ρ$-values与$η$-values，推导出显式阶乘公式并证明两者在等权互补深度下总和一致，揭示了统一的解析-组合结构。
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the degenerate Bernoulli polynomials and the degenerate Frobenius-Euler polynomials. Secondly, we consider the degenerate Eulerian polynomials and deduce the generating function and a recurrence relation for them.
We study the Diophantine equations obtained by equating a polynomial and the factorial function, and prove the finiteness of integer solutions under certain conditions. For example, we show that there exists only finitely many $l$ such that $l!$ is represented {by} $N_A(x)$, where $N_A$ is a norm form constructed from the field norm of a field extension $K/\mathbf Q$. We also deal with the equation $N_A(x)=l!_S$, where $l!_S$ is the Bhargava factorial. In this paper, we also show that the Oesterlé-Masser conjecture implies that for any infinite subset $S$ of $\mathbf Z$ and for any polynomial …
Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that the alternating sum of the reciprocal odd numbers is exactly $π/4$. This competition came to be known as the Basel Problem, and Euler's approximation probably spurred his spectacular solution in the same year. Subsequently he connected his summation formula to Bernoulli numbers, and applied it to many other topics, masterfully circumventing that it almost a…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order. We can show that these numbers are related to the well-known numbers and polynomials such as the Stirling numbers of the second kind and the central factorial numbers, the array polynomials, the rook numbers and polynomials, the Bernstein basis functions and others. In order to derive our new identities and relations for these numbers, we use a technique in…
Let $H$ be a transfer Krull monoid over a subset $G_0$ of an abelian group $G$ with finite exponent. Then every non-unit $a\in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L(a)$ of all possible factorization lengths $k$ is called the set of lengths of $a$, and $H$ is said to be half-factorial if $|\mathsf L(a)|=1$ for all $a\in H$. We show that, if $a \in H$ and $|\mathsf L(a^{\lfloor (3\exp(G) - 3)/2 \rfloor})| = 1$, then the smallest divisor-closed submonoid of $H$ containing $a$ is half-factorial. In addition, we prove that, if $G_0$ i…
Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive discriminant. In this paper, we consider the Diophantine equation $u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only finitely many effectively computable terms which can be expressed as a sum of factorials. Furthermore, we find the terms of the balancing sequences that can be written as a sum of two factorials.
We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a Krull monoid with finite cyclic class group, as well as the exact distribution of prime divisors over the ideal classes in these cases. Our results apply to various classical objects, including maximal orders and certain semi-groups of modules. In addition, we present applications to quantitative problems in factorization theory. More specifically, we deter…
$A_1$ - Coulomb branches over finite fields and Selberg Character sums
该研究受镜像对称启发，通过多项式高斯和实现塞尔伯格特征和的几何化，结合埃文斯的结果得到有限域上$A_1$库仑分支指数和的显式公式。
Some Diophantine equations involving arithmetic functions and Bhargava factorials
本文将 Luca 关于阶乘与 Euler 函数、除数和及除数计数函数的丢番图方程有限解结论，推广到多阶乘乘积和除数 k 次幂和函数，并扩展至 Bhargava 阶乘。
Cancellation profiles of Fibonacci-Lucas zeta sums
研究Fibonacci-Lucas zeta和的项量级分布，证明归一化绝对项和的指数展开及收敛性，并确定最大项索引与条件数增长。
Wilson's theorem modulo higher prime powers II: Bernoulli numbers and polynomials
该研究将作者此前用费马商幂和超同余描述威尔逊定理与威尔逊商的成果，转化为幂和与伯努利数的同余式，给出更简洁的证明，还算出了模p⁴的威尔逊商等结果并可推广到更高素数幂。
We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues of a series of recent results by various authors in finite fields and residue rings. Our results are based on recent advances in additive combinatorics in arbitrary finite field.
The alternating multiple harmonic sums are partial sums of the infinite series defining the Euler sums which are the alternating version of the multiple zeta value series. In this paper, we present some systematic structural results of the van Hamme type congruences of these sums, collected as finite Euler sums. Moreover, we relate this to the structure of the Euler sums, which generalizes the corresponding result of the multiple zeta values. We also provide a few conjectures with extensive numerical support.
In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special cases.
In this paper, we study the polynomial Gauss sums over finite fields, and present an analogue of Davenport-Hasse's theorem for the entire polynomial Gauss sums, which is a generalization of the previous result obtained by Hayes.
We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.
We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we obtain new results on incomplete multilinear Kloosterman sums in finite fields.
We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of the authors. Reciprocity theorems for certain trigonometric sums are also established.
In this paper, we derive an explicit combinatorial formula for the number of $k$-subset sums of quadratic residues over finite fields.
Two classes of finite trigonometric sums, each involving only $\sin$'s, are evaluated in closed form. The previous and original proofs arise from Ramanujan's theta functions and modular equations.
We state and prove three general formulas allowing to transform formal finite sums into formal continued fractions and apply them to generalize certain expansions in continued fractions given by Hone and Varona.
We define finite field $A$-hypergeometric functions and show that they are Fourier expansions of families of exponential sums on the torus. For an appropriate choice of $A$, our finite field $A$-hypergeometric function can be specialized to the finite field ${}_kF_{k-1}$-hypergeometric function defined by McCarthy.
We extend a result of I. J. Good and prove more symmetry properties of sums involving generalized Fibonacci numbers
We give a new bound on colinear triples in subgroups of prime finite fields and use it to give some new bounds on exponential sums with trinomials.
This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums of the reciprocal of the primes up to a fixed number and other finite sums and products are also given.
In this paper, we compute the $q$-adic slopes of the L-functions of an important class of exponential sums arising from analytic number theory. Our main tools include Adolphson-Sperber's work on toric exponential sums and Wan's decomposition theorems.
Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers are provided. As far as their applications are concerned, attention is focused in extending in various ways the classical formula for sums of powers on arithmetic progressions. Illustrations involving rising factorials, Bell polynomials, polylogarithms, and a certain class of Appell polynomials, in connection with appropriate random variables $Y$ in each cas…
We generalize Burgess' results on partial Gaussian sums to arbitrary finite fields. The main ingredients are the classical method of amplification, two deep results on multiplicative energy for subsets in finite fields which are obtained respectively by the tools from additive combinatorics and geometry of numbers, and a technique of Chamizo for treating the difficulty caused by additive character. Our results include the recent works on character sums in finite fields by M.-C. Chang and S. V. Konyagin.
We use an elementary argument to prove some finite sums involving expressions of the forms $(q)_n$ and $(a;q)_n$ along with inductive formulas for some sequences.
Character sums over elements of extensions of finite fields with restricted coordinates
本文研究了有限域扩张元素上具限制坐标的字符和问题，获得了乘性和加性特征和的非平凡界，并特别给出了Cantor集有限域类比上的非平凡估计。
In this paper, we completely determine the slopes and weights of the L-functions of an important class of exponential sums arising from analytic number theory. Our main tools include Adolphson-Sperber's work on toric exponential sums and Wan's decomposition theorems. One consequence of our main result is a sharp estimate of these exponential sums. Another consequence is to obtain an explicit counterexample of Adolphson-Sperber's conjecture on weights of toric exponential sums.
By using a variant of Kowalski's large sieve for Frobenius in compatible systems, we obtain zero-density estimates for arguments of $\ell$-adic trace functions over finite fields with values in some algebraic subsets of the cyclotomic integers, when the monodromy groups are known. This applies in particular to hyper-Kloosterman sums and general exponential sums considered by Katz.
We show that under certain general conditions, short sums of $\ell$-adic trace functions over finite fields follow a normal distribution asymptotically when the origin varies, generalizing results of Erdős-Davenport, Mak-Zaharescu and Lamzouri. In particular, this applies to exponential sums arising from Fourier transforms such as Kloosterman sums or Birch sums, as we can deduce from the works of Katz. By approximating the moments of traces of random matrices in monodromy groups, a quantitative version can be given as in Lamzouri's article, exhibiting a different phenomenon than the averaging …
The Newton series which interpolate finite multiple harmonic sums are useful in the study of multiple zeta values (MZV's). In this paper, we prove that these Newton series can be written as multiple series. As an application, we give a formula for MZV's which contains the duality.
Kloosterman sums over finite Frobenius rings
该研究在有限交换Frobenius环上推广Kloosterman和，证明了若干扭曲Kloosterman和的恒等式，主要贡献是围绕矩计算建立相关理论。
For non-negative integers $l_{1}, l_{2},\ldots, l_{n}$, we define character sums $φ_{(l_{1}, l_{2},\ldots, l_{n})}$ and $ψ_{(l_{1}, l_{2},\ldots, l_{n})}$ over a finite field which are generalizations of Jacobsthal and modified Jacobsthal sums, respectively. We express these character sums in terms of Greene's finite field hypergeometric series. We then express the number of points on the hyperelliptic curves $y^2=(x^m+a)(x^m+b)(x^m+c)$ and $y^2=x(x^m+a)(x^m+b)(x^m+c)$ over a finite field in terms of the character sums $φ_{(l_{1}, l_{2}, l_{3})}$ and $ψ_{(l_{1}, l_{2}, l_{3})}$, and finally ob…
Finite Sums and Products involving Special Functions
本文利用特殊函数建立了各种积与和的关系，这些关系源自受包含Hurwitz-Lerch zeta函数的有限和启发的公式。
We prove several old and new theorems about finite sums involving characters and trigonometric functions. These sums can be traced back to theta function identities from Ramanujan's notebooks and were systematically first studied by Berndt and Zaharescu; their proofs involved complex contour integration. We show how to prove most of Berndt-Zaharescu's and some new identities by elementary methods of discrete Fourier Analysis.
We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for zeros of such Kloosterman sums.
We prove several incidence theorems in vector spaces over finite fields using bounds for various classes of exponential sums and apply these to Erdos-Falconer type distance problems.
Evaluations and relations for finite trigonometric sums
该研究针对有限三角和的求值问题，建立三角和的互反及三个和式关系式，定义带互素条件的Ramanujan和类似物并求值，得到与黎曼假设相关的判别准则。
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_νx^{n_ν}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_ν$ and their differences. In particular, two new bounds for binomials are obtained, improving previous results in broad ranges of parameters.
We show that identities involving trigonometric sums recently proved by Harshitha, Vasuki and Yathirajsharma, using Ramanujan's theory of theta functions, were either already in the literature or can be proved easily by adapting results that can be found in the literature. Also we prove two conjectures given in that paper. After mentioning many other works dealing with identities for various trigonometric sums, we end this paper by describing an automated approach for proving such trigonometric identities.
Ohno's relation states that a certain sum, which we call an Ohno type sum, of multiple zeta values remains unchanged if we replace the base index by its dual index. In view of Oyama's theorem concerning Ohno type sums of finite and symmetric multiple zeta values, Kaneko looked at Ohno type sums of finite and symmetric multiple zeta-star values and made a conjecture on the generating function for a specific index of depth three. In this paper, we confirm this conjecture and further give a formula for arbitrary indices of depth three.
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical object of study of additive combinatorics.
We study the problem of tiling and packing in vector spaces over finite fields, its connections with zeroes of classical exponential sums, and with the Jacobian conjecture
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。