Related papers: A Complex Primitive $N$th Root Of Unity: A Very El…

Let F(z) be a rational function in Q(z) of degree at least 2 with F(0) = 0 and such that F does not vanish to order d at 0. Let b be a rational number having infinite orbit under iteration of F, and write F^n(b) = A_n/B_n as a fraction in…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Properly specializing the parameters in ``Schnizer modules'', for type A,B,C and D, we get its unique primitive vector. Then we show that the module generated by the primitive vector is an irreducible highest weight module of finite…

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$ and recall that an element of $G$ is a derangement if it has no fixed points. Derangements always exist by a classical theorem of Jordan, but there are so-called…

According to the Abel-Ruffini theorem [1] and Galois theory [2], there is no solution in finite radicals to the general quintic equation. This article takes a different approach and proposes a new method to solve the quintic by iteration of…

An example is given of a simple, unital C*-algebra which contains an infinite and a non-zero finite projection. This C*-algebra is also an example of an infinite simple C*-algebra which is not purely infinite. A corner of this C*-algebra is…

Let $\Omega$ be a matrix with entries $a_{i,j}=\omega^{ij},$ $1\leq i,j \leq n,$ where $\omega=e^{2\pi \sqrt{-1}/n},$ $n\in \mathbb N.$ The Chebotarev theorem states that if $n$ is a prime then any minor of $\Omega$ is non-zero. In this…

The search for a closed-form expression of the $n$-th prime number, $p_n$, has long oscillated between the rigid determinism of analytic functions and the apparent randomness of local distributions. This paper explores three different…

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

Given a rooted tree $T$ with leaves $v_1,v_2,\ldots,v_n$, we define the ancestral matrix $C(T)$ of $T$ to be the $n \times n$ matrix for which the entry in the $i$-th row, $j$-th column is the level (distance from the root) of the first…

This article provides a simple trigonometric method for determining how many roots of a quintic equation are real and how many are complex, without solving the equation. The approach transforms a depressed quintic $t^5 + mt^3 + nt^2 + pt +…

We introduce the notion of primitive elements in arbitrary truncated $p$-divisible groups. By design, the scheme of primitive elements is finite and locally free over the base. Primitive elements generalize the "points of exact order $N$,"…

In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…

In earlier work we gave a characterisation of pregeometries which are `basic' (that is, admit no `non-degenerate' quotients) relative to two different kinds of quotient operations, namely imprimitive quotients and normal quotients. Each…

Let $G$ be a transitive permutation group of degree $n$ with point stabiliser $H$ and let $r$ be a prime divisor of $n$. We say that $G$ is $r$-elusive if it does not contain a derangement of order $r$. The problem of determining the…

This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…

Rooted trees are essential for describing numerical schemes via the so-called B-series. They have also been used extensively in rough analysis for expanding solutions of singular Stochastic Partial Differential Equations (SPDEs). When one…

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I,…