English
Related papers

Related papers: Gowers norms for linearly recurrent numeration sys…

200 papers

Let $G$ be a finite group and let $N/E$ be a tamely ramified $G$-Galois extension of number fields. We show how Stickelberger's factorization of Gauss sums can be used to determine the stable isomorphism class of various arithmetic…

Number Theory · Mathematics 2014-02-18 Luca Caputo , Stéphane Vinatier

(This text is a survey written for the Bourbaki seminar on the work of F. Manners.) Gowers uniformity norms are the central objects of higher order Fourier analysis, one of the cornerstones of additive combinatorics, and play an important…

Combinatorics · Mathematics 2020-09-04 Thomas F. Bloom

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

Number Theory · Mathematics 2014-02-06 Yuri Bachilov

We define "splitting functions of level l" for any integer l>0. These functions generalize Dwork's splitting functions : they allow us to represent additive characters of order $p^l$. Then we use these functions to obtain a Stickleberger…

Number Theory · Mathematics 2007-05-23 Regis Blache

The generalized gamma convolutions class of distributions appeared in Thorin's work while looking for the infinite divisibility of the log-Normal and Pareto distributions. Although these distributions have been extensively studied in the…

Statistics Theory · Mathematics 2024-02-27 Oskar Laverny , Esterina Masiello , Véronique Maume-Deschamps , Didier Rullière

Let $(t_n)_{n\ge0}$ be the well konwn $\pm1$ Thue-Morse sequence $$+1,-1,-1,+1,-1,+1,+1,-1,\cdots.$$ Since the 1982-1983 work of Coquet and Dekking, it is known that $\sum_{k<n}t_ke^\frac{2k\pi i}{3}$ is strongly related to the famous Koch…

Dynamical Systems · Mathematics 2021-10-04 Yao-Qiang Li

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

This work builds on earlier work of the first three authors where a notion of congruence modules in higher codimension is introduced. The main new results are a criterion for detecting regularity of local rings in terms of congruence…

Number Theory · Mathematics 2024-04-25 Srikanth B. Iyengar , Chandrashekhar B. Khare , Jeffrey Manning , Eric Urban

Zeckendorf proved that every integer can be written uniquely as a sum of non-adjacent Fibonacci numbers $\{1,2,3,5,\dots\}$. This has been extended to many other recurrence relations $\{G_n\}$ (with their own notion of a legal…

Number Theory · Mathematics 2016-07-29 Ray Li , Steven J. Miller

In this article we will be dedicated some algorithms of addition, subtraction, multiplication and division of two positive integers using Zeckendorf form. Such results find application in coding theory.

Number Theory · Mathematics 2015-01-21 Rachid Chergui

Standard Gibbs sampling applied to a multivariate normal distribution with a specified precision matrix is equivalent in fundamental ways to the Gauss-Seidel iterative solution of linear equations in the precision matrix. Specifically, the…

Computation · Statistics 2015-05-14 Colin Fox , Albert Parker

A system of linear equations $L$ is said to be norming if a natural functional $t_L(\cdot)$ giving a weighted count for the set of solutions to the system can be used to define a norm on the space of real-valued functions on…

Combinatorics · Mathematics 2024-11-28 Seokjoon Cho , David Conlon , Joonkyung Lee , Jozef Skokan , Leo Versteegen

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

Analysis of PDEs · Mathematics 2025-01-23 Masato Hoshino

In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…

Probability · Mathematics 2012-02-09 Alexander Goldenshluger , Oleg Lepski

We introduce and study the universal norm distribution in this paper, which generalizes the concepts of universal ordinary distribution and the universal Euler system. We study the Anderson type resolution of the universal norm distribution…

Number Theory · Mathematics 2007-05-23 Yi Ouyang

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Combinatorics · Mathematics 2010-11-04 Balazs Szegedy

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

Number Theory · Mathematics 2025-04-07 Jean-François Biasse , Claus Fieker , Tommy Hofmann , Aurel Page

We show that if an essentially arbitrary sequence supported on an interval containing $x$ integers, is convolved with a tiny Siegel-Walfisz-type sequence supported on an interval containing $\exp((\log x)^{\varepsilon})$ integers then the…

Number Theory · Mathematics 2018-11-22 Étienne Fouvry , Maksym Radziwiłł

Zeckendorf proved that any integer can be decomposed uniquely as a sum of non-adjacent Fibonacci numbers, $F_n$. Using continued fractions, Lekkerkerker proved the average number of summands of an $m \in [F_n, F_{n+1})$ is essentially…

Combinatorics · Mathematics 2014-02-27 Amanda Bower , Rachel Insoft , Shiyu Li , Steven J. Miller , Philip Tosteson

We consider the generalized Thue-Morse sequences $(t_n^{(c)})_{n\ge 0}$ ($c \in [0,1)$ being a parameter) defined by $t_n^{(c)} = e^{2\pi i c s_2(n)}$, where $s_2(n)$ is the sum of digits of the binary expansion of $n$. For the polynomials…

Dynamical Systems · Mathematics 2022-12-27 Aihua Fan , Jörg Schmeling , Weixiao Shen