Results 71 to 80 of about 1,483,300 (312)
Exponential sums involving the divisor function over arithmetic progressions
Let $ \phi(x) $ be a smooth function supported on $ [1, 2] $ with derivatives bounded by $ \phi^{(j)}(x)\ll 1 $ and $ d_3(n) $ be the number of ways to write $ n $ as a product of three factors. We get the asymptotic formula for the nonlinear exponential
Rui Zhang , Yang Li, Xiaofei Yan
doaj +1 more source
Private Decayed Sum Estimation under Continual Observation
In monitoring applications, recent data is more important than distant data. How does this affect privacy of data analysis? We study a general class of data analyses - computing predicate sums - with privacy.
Bolot, Jean +4 more
core +1 more source
Kloosterman paths and the shape of exponential sums [PDF]
We consider the distribution of the polygonal paths joining partial sums of classical Kloosterman sums $\text{Kl}_{p}(a)$ , as $a$ varies over $\mathbf{F}_{p}^{\times }$ and as $p$ tends to infinity.
E. Kowalski, W. Sawin
semanticscholar +1 more source
The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
Extended Wang sum and associated products.
The Wang sum involving the exponential sums of Lerch's Zeta functions is extended to the finite sum of the Huwitz-Lerch Zeta function to derive sums and products involving cosine and tangent trigonometric functions.
Robert Reynolds, Allan Stauffer
doaj +1 more source
Moment estimates for exponential sums over k-free numbers [PDF]
We investigate the size of L^p-integrals for exponential sums over k-free numbers and prove essentially tight bounds.
E. Keil
semanticscholar +1 more source
Tree codes and a conjecture on exponential sums [PDF]
We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes.
Cristopher Moore, L. Schulman
semanticscholar +1 more source
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Binary sequences and lattices constructed by discrete logarithms
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
Multiple Exponential and Character Sums with Monomials
We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which previously known ...
Shparlinski, Igor
core +1 more source

