Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1604.02896

Linear and algebraic independence of Generalized Euler-Briggs constants

Sanoli Gun·V. Kumar Murty·Ekata Saha
View original source ↗Read source document ↗Export metadata ↓

Abstract

Possible transcendental nature of Euler's constant $γ$ has been the focus of study for sometime now. One possible approach is to consider $γ$ not in isolation, but as an element of the infinite family of generalised Euler-Briggs constants. In a recent work \cite{GSS}, it is shown that the infinite list of generalized Euler-Briggs constants can have at most one algebraic number. In this paper, we study the dimension of spaces generated by these generalized Euler-Briggs constants over number fields. More precisely, we obtain non-trivial lower bounds (see \thmref{pre} and \thmref{linear-ind}) on the dimension of these spaces and consequently establish the infinite dimensionality of the space spanned. Further, we study linear and algebraic independence of these constants over the field of all algebraic numbers.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sanoli Gun, V. Kumar Murty, Ekata Saha. 2016-04-11. Linear and algebraic independence of Generalized Euler-Briggs constants. https://doi.org/10.1016/j.jnt.2016.02.004

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗