Concept
Divergent series
Related publications (32)
On the Use of the Generalized Littlewood Theorem Concerning Integrals of the Logarithm of Analytical Functions for the Calculation of Infinite Sums and the Analysis of Zeroes of Analytical Functions
Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of an analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is applied to calcul ...
MDPI2023Fractal Analysis and Time Series Application in ZY-4 SEM Micro Fractographies Evaluation
SEM microfractographies of Zircaloy-4 are studied by fractal analysis and the time-series method. We first develop a computer application that associates the fractal dimension and lacunarity to each SEM micrograph picture, and produce a nonlinear analysis ...
MDPI2022Continuation Methods For Riemannian Optimization
Daniel Kressner, Axel Elie Joseph Séguin
Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemann ...
SIAM PUBLICATIONS2022The fourth moment of individual Dirichlet L-functions on the critical line
We prove an asymptotic formula for the second moment of a product of two Dirichlet L-functions on the critical line, which has a power saving in the error term and which is uniform with respect to the involved Dirichlet characters. As special cases we give ...
2020Loops in AdS: from the spectral representation to position space
We compute a family of scalar loop diagrams in AdS. We use the spectral representation to derive various bulk vertex/propagator identities, and these identities enable to reduce certain loop bubble diagrams to lower loop diagrams, and often to tree- level ...
2020Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2020