Related papers: A Tripos Surd
In 1977, Adleman, Manders and Miller had briefly described how to extend their square root extraction method to the general $r$th root extraction over finite fields, but not shown enough details. Actually, there is a dramatic difference…
The notions of special and extraspecial pairs of roots were introduced by Carter for calculating structure constants, [Ca72]. Let $\{r, s\}$ be a special pair of roots for which the structure constant $N(r,s)$ is sought, and let $\{r_1,…
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…
We prove an estimate for the number of lattice points lying in certain non-convex Euclidean domains of interest in Diophantine approximation. As an application, we generalise a result of Kruse (1964) concerning the almost sure order of…
In 2008, Dan Romik studied in this journal Primitive Pythagorean Triples, or PPTs. In order to do so, he introduced a modified slow (subtractive) Euclidean algorithm, and showed that the underlying dynamical system of this Euclidean…
The Erd\H{o}s-Straus conjecture is a renowned problem which describes that for every natural number $n~(\ge 2)$, $\frac{4}{n}$ can be represented as the sum of three unit fractions. The main purpose of this study is to show that the…
We compute the precise logarithmic corrections to mean-field scaling for various quantities describing the uniform spanning tree of the four-dimensional hypercubic lattice $\mathbb{Z}^4$. We are particularly interested in the distribution…
We list some explicit calculations related to a theorem of Clausen originally published in 1828, more commonly known as the result that describes the linear third order differential equation satisfied by the squares and the product of any…
The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate…
We provide a direct computation of the $F$-pure threshold of degree four homogeneous polynomial in two variables and, more generally, of certain homogeneous polynomials with four distinct roots. The computation depends on whether the cross…
Work in progress concerning alternative formalizations of arithmetic.
In this note we extend a theorem from [13] about uniform circle random coverings
In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients…
We continue the work of [4, 2, 3], in which we discuss published assertions that are incorrect or incorrectly proven; that are severely limited or reduce to triviality; or that we improve upon.
We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four…
In a recent paper A.Beardon and I.Short proposed to use chains of tangent horocycles as an extended tool describing continued fractions. We review the origin of such construction from the Moebius transformations point of view. Related…
A novel type of approximants is introduced, being based on the ideas of self-similar approximation theory. The method is illustrated by the examples possessing the structure typical of many problems in applied mathematics. Good numerical…
One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…
We review some probabilistic properties of the sum-of-digits function of random integers. New asymptotic approximations to the total variation distance and its refinements are also derived. Four different approaches are used: a classical…
In this paper we prove by induction on $n$ that any positive real number has $n$th root.