Related papers: Linear independence of trigonometric numbers
We prove, in a quantitative form, linear independence results for values of a certain class of q-series, which generalize classical q-hypergeometric series. These results refine our recent estimates.
Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…
Let $(i,j)\in \mathbb{N}\times \mathbb{N}_{\geq2}$ and $S_{i,j}$ be an infinite subset of positive integers including all prime numbers in some arithmetic progression. In this paper, we prove the linear independence over $\mathbb{Q}$ of the…
Algebraic independence is an advanced notion in commutative algebra that generalizes independence of linear polynomials to higher degree. Polynomials {f_1, ..., f_m} \subset \F[x_1, ..., x_n] are called algebraically independent if there is…
An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…
We show that two distinct singular moduli $j(\tau),j(\tau')$, such that for some positive integers $m, n$ the numbers $1,j(\tau)^m$ and $j(\tau')^n$ are linearly dependent over $\mathbb{Q}$ generate the same number field of degree at most…
Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides…
Positive bases, which play a key role in understanding derivative free optimization methods that use a direct search framework, are positive spanning sets that are positively linearly independent. The cardinality of a positive basis in…
We give conditions on sequences of positive algebraic numbers $\{a_{n,j}\}_{n=1}^\infty$, $j=1,\dots ,M$ and number field $\mathbb K$ to ensure that the numbers defined by the continued fractions $[0;a_{1,j},a_{2,j},\dots ]$, $j=1,\dots ,M$…
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…
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…
Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We show that all n-vertex planar triangle-free graphs except for…
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…
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…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
Let $\mathcal{R}$ be a family of axis-parallel rectangles in the plane. The transversal number $\tau(\mathcal{R})$ is the minimum number of points needed to pierce all the rectangles. The independence number $\nu(\mathcal{R})$ is the…
We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.
A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…