English
Related papers

Related papers: The Additive Structure of Integers with the Lower …

200 papers

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

Dynamical Systems · Mathematics 2012-09-27 Bernard Host , Bryna Kra

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

Number Theory · Mathematics 2019-05-10 Reynold Fregoli

We present an easily defined countable family of permutations of the natural numbers for which explicit rearrangements (i.e., the sums induced by the permutations) can be computed. The digamma function proves to be the key tool for the…

Number Theory · Mathematics 2021-07-06 Maxim Gilula

Let $\mathfrak{C}$ be a class of finite combinatorial structures. The \textit{profile} of $\mathfrak{C}$ is the function $\varphi_{\mathfrak{C}}$ which counts, for every integer $n$, the number $\varphi_{\mathfrak{C}}(n)$ of members of…

Combinatorics · Mathematics 2014-09-04 Djamila Oudrar , Maurice Pouzet

An arithmetic function $f$ is Leibniz-additive if there is a completely multiplicative function $h_f$, i.e., $h_f(1)=1$ and $h_f(mn)=h_f(m)h_f(n)$ for all positive integers $m$ and $n$, satisfying $$ f(mn)=f(m)h_f(n)+f(n)h_f(m) $$ for all…

Number Theory · Mathematics 2018-03-20 Pentti Haukkanen , Jorma K. Merikoski , Timo Tossavainen

Sidorov and Vershik showed that in base $G=\frac{\sqrt{5}+1}{2}$ and with the digits $0,1$ the numbers $x=nG ~(\text {mod} 1)$ have $\aleph_{0}$ expansions for any $n\in\mathbb{Z}$, while the other elements of $(0, \frac{1}{G-1})$ have…

Number Theory · Mathematics 2015-04-08 Yuehua Ge , Bo Tan

The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension…

Logic in Computer Science · Computer Science 2023-10-20 Denis Cousineau , Gilles Dowek

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

General Mathematics · Mathematics 2007-05-23 Max S. C. Woon

If $f\!:\![a,b]\to\R$ such that $f^{(n)}$ is integrable then integration by parts gives the formula \begin{align*} &\intab f(x)\,dx = &\frac{(-1)^n}{n!}\sum_{k=0}^{n-1}(-1)^{n-k-1}\left[ \phi_n^{(n-k-1)}(a)f^{(k)}(a)-…

Classical Analysis and ODEs · Mathematics 2016-05-02 Erik Talvila

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

Operator Algebras · Mathematics 2007-05-23 Jack Spielberg

In this article, we prove under some hypothesis of non ramification, a conjecture of Kottwitz and Rapoport giving the existence of crystals with additional structures.

Number Theory · Mathematics 2007-05-23 Jean-Pierre Wintenberger

We comment on past and more recent efforts to derive a formula yielding the fine structure constant in terms of integers and transcendent numbers. We analyse these "exoteric" attitudes and describe the myths regarding {\alpha}, which seems…

General Physics · Physics 2010-09-10 Giuseppe Dattoli

We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely many solution pairs (a,b), where $\phi$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Sergei Konyagin

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

Let $\Sigma$ be a (reduced) root system. Let $\mathsf{k}$ be an algebraically closed field of zero characteristic, and consider the corresponding semisimple Lie algebra $\mathfrak{g}_{\mathsf{k}, \Sigma}$. Then there is a first-order…

Rings and Algebras · Mathematics 2024-12-03 Hugo Luiz Mariano , João Schwarz

Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…

Logic · Mathematics 2019-06-27 Dominic J. D. Hughes

Fibonacci connection between non-decreasing sequences of positive integers producing maximum height Huffman trees and the Wythoff array has been proved.

Discrete Mathematics · Computer Science 2009-09-29 Alex Vinokur

Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…

Classical Analysis and ODEs · Mathematics 2020-02-05 T. Pailas , P. A. Terzis , T. Christodoulakis

A reduction $\varphi$ of an ordered group $(G,P)$ to another ordered group is an order homomorphism which maps each interval $[1,p]$ bijectively onto $[1, \varphi(p)]$. We show that if $(G,P)$ is weakly quasi-lattice ordered and reduces to…

Group Theory · Mathematics 2021-03-17 Robert Huben