English
Related papers

Related papers: A rigorous computer aided estimation for Gelfond e…

200 papers

The classic Thue--Morse measure is a paradigmatic example of a purely singular continuous probability measure on the unit interval. Since it has a representation as an infinite Riesz product, many aspects of this measure have been studied…

Dynamical Systems · Mathematics 2020-06-11 Michael Baake , Philipp Gohlke , Marc Kesseböhmer , Tanja Schindler

A novel generalization of the Prouhet-Thue-Morse sequence to binary $\pm 1$-weight sequences is presented. Derived from Rademacher functions, these weight sequences are shown to satisfy interesting orthogonality and recurrence relations. In…

Number Theory · Mathematics 2014-05-28 Hieu D. Nguyen

We consider the approximation of a convolution of possibly different probability measures by (compound) Poisson distributions and also by related signed measures of higher order. We present new total variation bounds having a better…

Probability · Mathematics 2017-03-08 Bero Roos

A treatment of (generalized) Clemens-Schmid exact sequences from the perspective of weights.

Algebraic Geometry · Mathematics 2026-05-15 R. Virk

We give a simple formula for the exact exponent in the remainder term of the main Gelfond's digit theorem in the binary case.

Number Theory · Mathematics 2015-05-13 Vladimir Shevelev

We establish a new class of $L^2$-weighted elliptic estimates on smooth two-manifolds for a family of weights satisfying an equation with explicit constants. This family includes weights that are comparable to the product of positive powers…

Analysis of PDEs · Mathematics 2025-04-08 Aria Halavati

Frequency Estimation of a complex exponential is a problem relevant to a large number of fields. In this paper a computationally efficient and accurate frequency estimator is presented using the guaranteed stable Sliding DFT which gives…

Systems and Control · Computer Science 2012-02-21 Anit Kumar Sahu , Mrityunjoy Chakraborty

In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…

Formal Languages and Automata Theory · Computer Science 2024-04-23 J. -P. Allouche , J. -Y. Yao

In this note we obtain tight bounds on the space-complexity of computing the ergodic measure of a low-dimensional discrete-time dynamical system affected by Gaussian noise. If the scale of the noise is $\varepsilon$, and the function…

Computational Complexity · Computer Science 2015-08-24 Mark Braverman , Cristobal Rojas , Jon Schneider

We develop a powerful and general method to provide rigorous and accurate upper and lower bounds for Lyapunov exponents of stochastic flows. Our approach is based on computer-assisted tools, the adjoint method and established results on the…

Dynamical Systems · Mathematics 2025-06-02 Maxime Breden , Hugo Chu , Jeroen S. W. Lamb , Martin Rasmussen

We establish optimal Lebesgue estimates for a class of generalized Radon transforms defined by averaging functions along polynomial-like curves. The presence of an essentially optimal weight allows us to prove uniform estimates, wherein the…

Classical Analysis and ODEs · Mathematics 2019-10-02 Michael Christ , Spyridon Dendrinos , Betsy Stovall , Brian Street

Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex $C$, from which topological and geometrical informations…

Geometric Topology · Mathematics 2018-01-31 Joao Paixao , Joao Lagoas , Thomas Lewiner , Tiago Novello

For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.

Number Theory · Mathematics 2012-10-09 Vladimir Shevelev

We show that in the category of complex algebraic varieties, the Eilenberg--Moore spectral sequence can be endowed with a weight filtration. This implies that it degenerates if all involved spaces have pure cohomology. As application, we…

Algebraic Geometry · Mathematics 2007-05-23 Matthias Franz , Andrzej Weber

The frozen Gaussian approximation provides a highly efficient computational method for high frequency wave propagation. The derivation of the method is based on asymptotic analysis. In this paper, for general linear strictly hyperbolic…

Numerical Analysis · Mathematics 2010-12-23 Jianfeng Lu , Xu Yang

The Thue-Morse sequence is generalized to the $TM_m$ sequences and two equivalent definitions are given. This generalization leads to transcendental numbers and has Queff\'elec's theorem on Thue-Morse continued fractions as a special case.…

Number Theory · Mathematics 2013-02-11 Gerardo González Robert

We have written a computer program that implements Deligne's pullback and pushforward weight spectral sequences to compute the weight graded pieces of the rational cohomology of moduli spaces of pointed smooth curves (as well as curves of…

Algebraic Geometry · Mathematics 2026-03-31 Jonas Bergström , Thomas Wennink

This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here…

Algebraic Topology · Mathematics 2017-10-18 Gregory Henselman , Robert Ghrist

We prove norm estimates for multilinear fractional integrals acting on weighted and variable Hardy spaces. In the weighted case we develop ideas we used for multilinear singular integrals [7]. For the variable exponent case, a key element…

Classical Analysis and ODEs · Mathematics 2019-03-06 David Cruz-Uribe , Kabe Moen , Hanh Nguyen

Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and…

Formal Languages and Automata Theory · Computer Science 2022-03-22 Jeffrey Shallit