Related papers: Linear Independence Of Some Irrational Numbers
Let $P(t),Q(t)\in \mathbb{Q}(t)$ be rational functions such that $P(t),Q(t)$ and the constant function $1$ are linearly independent over $\mathbb{Q}$, we prove an asymptotic formula for the number of the corner configurations…
We present simple, self-contained proofs of correctness for algorithms for linearity testing and program checking of linear functions on finite subsets of integers represented as n-bit numbers. In addition we explore a generalization of…
When a linear model is adjusted to control for additional explanatory variables the sign of a fitted coefficient may reverse. Here these reversals are studied using coefficients of determination. The resulting theory can be used to…
We consider nonlinear, or "event-dependent", sampling, i.e. such that the sampling instances {tk} depend on the function being sampled. The use of such sampling in the construction of Lebesgue's integral sums is noted and discussed as…
It is known that, for each real number x such that 1,x,x^2 are linearly independent over Q, the uniform exponent of simultaneous approximation to (1,x,x^2) by rational numbers is at most (sqrt{5}-1)/2 (approximately 0.618) and that this…
Incorrectness Separation Logic (ISL) is a proof system designed to automate verification and detect bugs in programs manipulating heap memories. In this study, we extend ISL to support variable-length array predicates and pointer…
Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from a smaller class. We discuss the separation problem for regular languages. We give a Ptime algorithm to…
We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…
Let $p/q$ ($p, q \in \mathbb{N}^*$) be a positive rational number such that $p > q^2$. We show that for any $\epsilon > 0$, there exists a set $A(\epsilon) \subset [0, 1[$, with finite border and with Lebesgue measure $< \epsilon$, for…
In this paper, we establish the foundations of a novel logical framework for the {\pi}-calculus, based on the deduction-as-computation paradigm. Following the standard proof-theoretic interpretation of logic programming, we represent…
We show how the theory of linear forms in two logarithms allows one to get effective irrationality measures for $n$-th roots of rational numbers ${a \over b}$, when $a$ is very close to $b$. We give a $p$-adic analogue of this result under…
When data contains measurement errors, it is necessary to make assumptions relating the observed, erroneous data to the unobserved true phenomena of interest. These assumptions should be justifiable on substantive grounds, but are often…
In this article, we consider the problem of testing the independence between two random variables. Our primary objective is to develop tests that are highly effective at detecting associations arising from explicit or implicit functional…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
The grouplike elements of a coalgebra over a field are known to be linearly independent over said field. Here we prove three variants of this result. One is a generalization to coalgebras over a commutative ring (in which case the linear…
Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…
In this article, we derive better results concerning powered numbers in short intervals, both unconditionally and conditionally on the $abc$-conjecture. We make use of sieve method, a polynomial identity, and a recent breakthrough result on…
These lecture notes show that linear probing takes expected constant time if the hash function is 5-independent. This result was first proved by Pagh et al. [STOC'07,SICOMP'09]. The simple proof here is essentially taken from [Patrascu and…
The traditional Pi-theorem tells us that for any dimensionally invariant relation there exists a full set of independent dimensionless "Pi groups" which can be used to nondimensionalise the relation. In this paper, we seek to understand…
As a consequence of the Integral Test we find a triple inequality which bounds up and down both a series with respect to its corresponding improper integral, and reciprocally an improper integral with respect to its corresponding series.