Results 21 to 30 of about 21,735,665 (352)
Generalized polynomial exponential sums and their fourth power mean
Electronic Research Archive, 2023 The study of the power mean of the generalized polynomial exponential sums plays a very important role in analytic number theory, and many classical number theory problems are closely related to it.
Li Wang, Yuanyuan Meng
doaj +1 more source
Samples of geometric random variables with multiplicity constraints [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We investigate the probability that a sample $\Gamma=(\Gamma_1,\Gamma_2,\ldots,\Gamma_n)$ of independent, identically distributed random variables with a geometric distribution has no elements occurring exactly $j$ times, where $j$ belongs to a specified
Margaret Archibald, Arnold Knopfmacher
doaj +1 more source
Almost primes in generalized Piatetski-Shapiro sequences
AIMS Mathematics, 2022 We consider a generalization of Piatetski-Shapiro sequences in the sense of Beatty sequences, which is of the form $\left( \left\lfloor{\alpha n^c + \beta}\right\rfloor \right)_{n = 1}^{\infty} $ with real numbers $ \alpha {\geqslant} 1, c > 1 $ and $
Jinyun Qi , Zhefeng Xu
doaj +1 more source
The first ascent of size $d$ or more in compositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A composition of a positive integer $n$ is a finite sequence of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+ \cdots +a_k=n$. Let $d$ be a fixed nonnegative integer.
Charlotte Brennan, Arnold Knopfmacher
doaj +1 more source
Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences
Electronic Research Archive, 2023 Sequences with optimal autocorrelation properties play an important role in wireless communication, radar and cryptography. Interleaving is a very important method in constructing the optimal autocorrelation sequence.
Yixin Ren , Chenyu Hou, Huaning Liu
doaj +1 more source
On the high-th mean of one special character sums modulo a prime
AIMS Mathematics, 2023 Using the elementary method of the classical Gauss sums and the properties of character sums, we study a linear recurrence formula about the form $ G\left(n\right) = 1+\sum_{a = 1}^{p-1}\left(\frac{a^2+n\bar{a}^2}{p}\right) $ and about the mean value of $
Yan Ma, Di Han
doaj +1 more source
Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language [PDF]
International Symposium on Symbolic and Algebraic Computation, 2017 We introduce two new packages, Nemo and Hecke, written in the Julia programming language for computer algebra and number theory. We demonstrate that high performance generic algorithms can be implemented in Julia, without the need to resort to a low ...
C. Fieker +3 more
semanticscholar +1 more source
On the fourth power mean of one special two-term exponential sums
AIMS Mathematics, 2023 The main purpose of this paper is using the elementary methods and the number of the solutions of some congruence equations to study the calculating problem of the fourth power mean of one special two-term exponential sums, and give an exact calculating ...
Wenpeng Zhang, Yuanyuan Meng
doaj +1 more source
On the K-th power mean of one kind generalized cubic Gauss sums
AIMS Mathematics, 2023 The main purpose of this paper is using the elementary methods and properties of the recurrence sequence to study the calculating problem of the $ k $-th power mean of one kind generalized cubic Gauss sums, and give an exact calculating formula for it.
Xiaoge Liu, Yuanyuan Meng
doaj +1 more source
Binary sequences and lattices constructed by discrete logarithms
AIMS Mathematics, 2022 In 1997, Mauduit and Sárközy first introduced the measures of pseudorandomness for binary sequences. Since then, many pseudorandom binary sequences have been constructed and studied. In particular, Gyarmati presented a large family of pseudorandom binary
Yuchan Qi, Huaning Liu
doaj +1 more source