Related papers: Linear independence of trigonometric numbers

We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…

Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…

Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of…

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…

We propose a linear independence criterion, and outline an application of it. Down to its simplest case, it aims at solving this problem: given three real numbers, typically as special values of analytic functions, how to prove that the…

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…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Let $\mathfrak g$ be a complex semisimple Lie algebra. We define what it means for a finite dimensional representation of $\mathfrak g$ to be rectangular and completely classify faithful rectangular representations. As an application, we…

We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…

The paper determines all meromorphic functions with finitely many zeros in the plane having the property that a linear differential polynomial in the function, of order at least 3 and with rational functions as coefficients, also has…

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

We develope the framework of transitional conditional independence. For this we introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and unify previous notions of…

We introduce a notion of palindromicity of a natural number which is independent of the base. We study the existence and density of palindromic and multiple palindromic numbers, and we raise several related questions.

Let $R=\oplus_{m\geq 0}R_m$ be a standard graded equidimensional ring over a field $R_0$, and $I\subseteq J$ be two non-nilpotent graded ideals in $R$. Then we give a set of numerical characterizations of the integral dependence of $I$ and…

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

In this paper new criteria are established for the existence of positive radial solutions of a semilinear elliptic system depending on the gradient. These criteria are determined by some relationships between the upper and lower bounds on…

Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha"(G)$ respectively. This paper establishes a…

We prove that these Cantor sets are made up of transcendental numbers, apart from their endpoints $0$ and $1$, under some arithmetical assumptions on the data. To that purpose, we establish a criterion of linear independence over the field…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if they have equivalent independence polynomials. We extend…

A systematic study of the trigonometric equation A tan a + B sin b = C, where A, B and C^2 are rational numbers. The special case tan Pi/11 + 4 sin 3 Pi/11 = sqrt[11] appears in the classical literature.