Results 21 to 30 of about 52,800 (268)

Bounds for the Rate of Convergence in the Generalized Rényi Theorem

open access: yesMathematics, 2022
In the paper, an overview is presented of the results on the convergence rate bounds in limit theorems concerning geometric random sums and their generalizations to mixed Poisson random sums, including the case where the mixing law is itself a mixed ...
Victor Korolev
doaj   +1 more source

On predictors for band-limited and high-frequency time series [PDF]

open access: yes, 2012
Pathwise predictability and predictors for discrete time processes are studied in deterministic setting. It is suggested to approximate convolution sums over future times by convolution sums over past time. It is shown that all band-limited processes are
Dokuchaev   +10 more
core   +2 more sources

Factors of alternating convolution of the Gessel numbers [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
The Gessel number P(n,r) is the number of lattice paths in the plane with (1,0) and (0,1) steps from (0,0) to (n+r, n+r-1) that never touch any of the points from the set {(x,x)∈ℤ²:x≥r}. We show that there is a close relationship between Gessel numbers P(
Jovan Mikić
doaj   +1 more source

Arithmetic properties derived from coefficients of certain eta quotients

open access: yesJournal of Inequalities and Applications, 2020
For a positive integer k, let F ( q ) k : = ∏ n ≥ 1 ( 1 − q n ) 4 k ( 1 + q 2 n ) 2 k = ∑ n ≥ 0 a k ( n ) q n $$ F (q)^{k}:= \prod_{n \geq 1} \frac{(1-q^{n})^{4k}}{(1+q^{2n})^{2k}} = \sum_{n\geq 0} \frak{a}_{k} (n)q^{n} $$ be the eta quotients.
Jihyun Hwang, Yan Li, Daeyeoul Kim
doaj   +1 more source

Some Geometrical Results Associated with Secant Hyperbolic Functions

open access: yesMathematics, 2022
In this paper, we examine the differential subordination implication related with the Janowski and secant hyperbolic functions. Furthermore, we explore a few results, for example, the necessary and sufficient condition in light of the convolution concept,
Isra Al-Shbeil   +4 more
doaj   +1 more source

Estimation of sums of random variables: Examples and information bounds [PDF]

open access: yes, 2005
This paper concerns the estimation of sums of functions of observable and unobservable variables. Lower bounds for the asymptotic variance and a convolution theorem are derived in general finite- and infinite-dimensional models.
Zhang, Cun-Hui
core   +1 more source

Efficient Sum-Check Protocol for Convolution [PDF]

open access: yesIEEE Access, 2021
Many applications have recently adopted machine learning and deep learning techniques. Convolutional neural networks (CNNs) are made up of sequential operations including activation, pooling, convolution, and fully connected layer, and their computation cost is enormous, with convolution and fully connected layer dominating.
Chanyang Ju   +4 more
openaire   +2 more sources

Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements [PDF]

open access: yes, 2019
The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all non-zero sums ...
Funakoshi, Mitsuru, Pape-Lange, Julian
core   +2 more sources

Bernoulli Identities and Combinatoric Convolution Sums with Odd Divisor Functions

open access: yesAbstract and Applied Analysis, 2014
We study the combinatoric convolution sums involving odd divisor functions, their relations to Bernoulli numbers, and some interesting applications.
Daeyeoul Kim, Yoon Kyung Park
doaj   +1 more source

Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52

open access: yesOpen Mathematics, 2017
The convolution sum, ∑(l,m)∈N02αl+βm=nσ(l)σ(m), $ \begin{array}{} \sum\limits_{{(l\, ,m)\in \mathbb{N}_{0}^{2}}\atop{\alpha \,l+\beta\, m=n}} \sigma(l)\sigma(m), \end{array} $ where αβ = 22, 44, 52, is evaluated for all natural numbers n. Modular forms
Ntienjem Ebénézer
doaj   +1 more source

Home - About - Disclaimer - Privacy