Related papers: Linear independence of trigonometric numbers
We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.
Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obstruction, its independence number is at least n/(3-epsilon)…
We show that if any four distinct solutions of a rational difference equation are algebraically independent, then any number of distinct solutions to the equation are independent. A nontrivial variant of this result is given for autonomous…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove…
The independence number $\alpha(H)$ of a hypergraph $H$ is the maximum cardinality of a set of vertices of $H$ that does not contain an edge of $H$. Generalizing Shearer's classical lower bound on the independence number of triangle-free…
The randomization of a complete first order theory $T$ is the complete continuous theory $T^R$ with two sorts, a sort for random elements of models of $T$, and a sort for events in an underlying probability space. We study various notions…
The famous result of Lindemann and Weierstrass says that if $a_{1},a_{2},\ldots,a_{n}$ are distinct algebraic numbers, then $e^{a_{1}},e^{a_{2}},\ldots,e^{a_{n}}$ are linearly independent complex numbers over the field…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
Given a suitable collection of partitions of sets, there exists a connection to easy quantum groups via intertwiner maps. A sufficient condition for this correspondence to be one-to-one are particular linear independences on the level of…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
Let $X$ be a real algebraic convex 3-manifold whose real part is equipped with a $Pin^-$ structure. We show that every irreducible real rational curve with non-empty real part has a canonical spinor state belonging to $\{\pm 1\}$. The main…
We prove that for every $t\in \mathbb{N}$, there exists $\tau=\tau(t)\in \mathbb{N}$ such that every (theta, prism, $K_{1,t}$)-free graph has tree independence number at most $\tau$ (where we allow "prisms" to have one path of length zero).
We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical…
In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…
A set of edges $T$ in a graph $G$ is triangle-independent if $T$ contains at most one edge from each triangle in $G$. Let $\alpha_1(G)$ denote the maximum size of the triangle-independent set in $G$, and let $\tau_B(G)$ denote minimum size…
We provide an alternative proof that the finite rational linear combination of radicals, under certain constraint, are linearly independent over $\mathbb{Q}$.
The necessary and sufficient conditions for a function to be totally or partially separable are derived. It is shown that a function is totally separable if and only if each component of the gradient vector of depends only on the…