Related papers: Linear Independence Of Some Irrational Numbers

We establish new measures of linear independence of logarithms on commutative algebraic groups in the so-called \emph{rational case}. More precisely, let k be a number field and v_{0} be an arbitrary place of k. Let G be a commutative…

This paper provides the first criteria for the linear independence of multiple polylogarithm values over algebraic number fields. In particular, we derive novel results regarding the linear independence of products of polylogarithms at…

The decimal digits of $\pi$ are widely believed to behave like as statistically independent random variables taking the values $0, 1, 2, 3, 4, 5$, $6, 7, 8, 9$ with equal probabilities $1/10$. In this article, first, another similar…

In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…

The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime…

Linear forms in logarithms over connected commutative algebraic groups over the algebraic numbers field have been studied widely. However, the theory of linear forms in logarithms over noncommutative algebraic groups have not been developed…

We prove a weighted analogue of the Khintchine-Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over…

Let $f$ be an $E$-function (in Siegel's sense) not of the form $e^{\beta z}$, $\beta \in \overline{\mathbb{Q}}$, and let $\log$ denote any fixed determination of the complex logarithm. We first prove that there exists a finite set $S(f)$…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

Separation logic is successful for software verification of heap-manipulating programs. Numbers are necessary to be added to separation logic for verification of practical software where numbers are important. However, properties of the…

An elementary proof of an identity by Lyons, Paule and Riese is given. It is simpler than all the 3 published proofs.

Let $r,m$ be positive integers. Let $0\le x <1$ be a rational number. Let $\Phi_s(x,z)$ be the $s$-th Lerch function $\sum_{k=0}^{\infty}\tfrac{z^{k+1}}{(k+x+1)^s}$ with $s=1,2,\ldots ,r$. When $x=0$, this is the polylogarithmic function.…

Let $G=\{e^{tA}:t\in\mathbb{R}\}$ be a closed one-parameter subgroup of the general linear group of matrices of order $n$ acting on $\mathbb{R}^{n}$ by matrix-vector multiplications. We assume that all eigenvalues of $A$ are rationally…

This paper introduces the notion of pseudo-independence on the sublinear expectation space $(\Omega,\mathcal{F},\mathcal{P})$ via the classical conditional expectation, and the relations between pseudo-independence and Peng's independence…

This note considers the finite linear independence of coherent systems associated to discrete subgroups. We show by simple arguments that such coherent systems of amenable groups are linearly independent whenever the associated twisted…

In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this…

We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…

A procedure and theoretical results are presented for the problem of determining a minimal robust positively invariant (RPI) set for a linear discrete-time system subject to unknown, bounded disturbances. The procedure computes, via the…

For a given rational number $x$ and an integer $s\geq 1$, let us consider a generalized polylogarithmic function, often called the Lerch function, defined by $$\Phi_{s}(x,z)= \sum_{k=0}^{\infty}\frac{z^{k+1}}{(k+x+1)^s}\enspace.$$ We prove…

We show, for any $q\ge 3$ and distinct reduced residues $a,b \pmod q$, the existence of certain hypothetical sets of zeros of Dirichlet $L$-functions lying off the critical line implies that $\pi(x;q,a)<\pi(x;q,b)$ for a set of real $x$ of…