English
Related papers

Related papers: On the construction of absolutely normal numbers

200 papers

A new short clear proof of the asymptotics for the number $c_n$ of real roots of the Bernoulli polynomials $B_n(x)$, as well as for the maximal root $y_n$: $$y_n=\frac{n}{2\pi e}+\frac{\ln(n)}{4\pi e}+O(1)\quad\text{and}\quad…

Number Theory · Mathematics 2025-02-07 A. Efimov

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…

Number Theory · Mathematics 2020-05-15 Daniele Mastrostefano

Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never…

Information Theory · Computer Science 2010-01-23 Masahito Hayashi

We study the extreme $L_p$ discrepancy of infinite sequences in the $d$-dimensional unit cube, which uses arbitrary sub-intervals of the unit cube as test sets. This is in contrast to the classical star $L_p$ discrepancy, which uses…

Number Theory · Mathematics 2021-09-15 Ralph Kritzinger , Friedrich Pillichshammer

An integer $n\ge 1$ is said to be practical if every natural number $ m \le n$ can be expressed as a sum of distinct positive divisors of $n$. The number of practical numbers up to $x$ is asymptotic to $c x/\log x$, where $c$ is a constant.…

Number Theory · Mathematics 2019-08-30 Andreas Weingartner

We treat a random number generation from an i.i.d. probability distribution of $P$ to that of $Q$. When $Q$ or $P$ is a uniform distribution, the problems have been well-known as the uniform random number generation and the resolvability…

Information Theory · Computer Science 2013-03-05 Wataru Kumagai , Masahito Hayashi

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

Number Theory · Mathematics 2024-08-27 Jerzy Grunwald , Grzegorz Serafin

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

Information Theory · Computer Science 2018-12-07 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

Combinatorics · Mathematics 2014-04-08 Neil I. Gillespie

Let $F$ be a non-degenerate quadratic form on an $n$-dimensional vector space $V$ over the rational numbers. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size…

Number Theory · Mathematics 2019-11-01 Thomas Huong Tran

A real number is called simply normal to base $b$ if every digit $0,1,\ldots ,b-1$ should appear in its $b$-adic expansion with the same frequency $1/b$. A real number is called normal to base $b$ if it is simply normal to every base $b,…

Number Theory · Mathematics 2024-12-18 Yuya Kanado , Kota Saito

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

Combinatorics · Mathematics 2012-12-18 Vera Koponen

Let $f(n)$ be the largest integer such that every poset on $n$ elements has a $2$-dimensional subposet on $f(n)$ elements. What is the asymptotics of $f(n)$? It is easy to see that $f(n)\geqslant n^{1/2}$. We improve the best known upper…

Combinatorics · Mathematics 2017-11-28 Grzegorz Guśpiel , Piotr Micek , Adam Polak

Let $x=a+ib$ be a complex number, so we have the following inequality $$(1/\sqrt{2})|a+b|\leq |x|\leq |a|+|b|$$ We give an operator version of above inequality. Also we obtain some results for normal operators.

Functional Analysis · Mathematics 2015-12-08 Ali Taghavi , Vahid Darvish

For a pair of random Gaussian integers chosen uniformly and independently from the set of Gaussian integers of norm $x$ or less as $x$ goes to infinity, we find asymptotics for the average norm of their greatest common divisor, with…

Number Theory · Mathematics 2020-12-10 Tai-Danae Bradley , Yin Choi Cheng , Yan Fei Luo

After a short review of the historical milestones on normal numbers, we introduce the Borel numbers as the reals admitting a probability function on their different bases representations. In this setting, we provide two probabilistic…

Number Theory · Mathematics 2022-01-14 Nicolò Cangiotti , Daniele Taufer

A recent asymptotic expansion for the positive zeros $x=j_{\nu,m}$ ($m=1,2,3,\ldots$) of the Bessel function of the first kind $J_{\nu}(x)$ is studied, where the order $\nu$ is positive. Unlike previous well-known expansions in the…

Classical Analysis and ODEs · Mathematics 2025-02-17 T. M. Dunster

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

Combinatorics · Mathematics 2010-03-04 Greg Martin , Kevin O'Bryant

We prove that |{1<=y<=x: y is odd and not of the form p+2^a+2^b}|>>x^{1-\epsilon} for any \epsilon>0, where the implied constant only depends on \epsilon.

Number Theory · Mathematics 2009-07-07 Hao Pan
‹ Prev 1 3 4 5 6 7 10 Next ›