Related papers: Non-Existence of Linear-Quartic Factorization for …

In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…

Suppose that f has continuous derivatives thru order r+1 for x>0, and let P_{c} denote the Taylor polynomial to f of order r at x=c,c>0. In a previous paper of the author, it was shown that if r is an odd whole number and the (r+1)st…

An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…

We extend the explicit quadratic Chabauty methods developed in previous work by the first two authors to the case of non-hyperelliptic curves. This results in an algorithm to compute the rational points on a curve of genus $g \ge 2$ over…

We study in details how and when the radical $\sqrt[3]{a+b\sqrt p}$ with rational numbers $a,b$ and $p$ positive can be simplified, providing a complete answer to the problem; furthermore, a program that computes the result is also made…

In this contribution we consider sequences of monic polynomials orthogonal with respect to the standard Freud-like inner product involving a quartic potential $\left\langle…

This note provides the complete factorization of the Misiurewicz-Thurston polynomial $q_{\ell,n}=p_{\ell+n}(z) - p_\ell(z)$ over $\mathbb{C}$, which plays a central role in the study of the Mandelbrot set, where \[ p_0(z) = 0, \qquad…

In this work we demonstrate that the q-numbers and their two-parameter generalization, the q,p-numbers, can be used to obtain some polynomial invariants for torus knots and links. First, we show that the q-numbers, which are closely…

The main result of this paper is a recursive description of all decompositions \[ \Delta^+ = \Phi_1 \sqcup \Phi_2 \sqcup \dots \sqcup \Phi_k \] of the positive roots $\Delta^+$ of an arbitrary root system $\Delta$ into a disjoint union of…

Let $\mathcal{F}_g$ be the family of monic odd-degree hyperelliptic curves of genus $g$ over $\mathbb{Q}$. Poonen and Stoll have shown that for every $g \geq 3$, a positive proportion of curves in $\mathcal{F}_g$ have no rational points…

We study the Diophantine equation $a^5+b^5=c^5+d^5$ under the linear slicing constraint $(c+d)-(a+b)=h$. We first prove the necessary congruence $30\mid h$. After symmetrization, the associated discriminant equation defines, for each fixed…

We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…

In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $\mathbb{F}\{x_1,x_2,\ldots,x_n\}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson,…

We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…

Let $\Psi(\textbf{z},\textbf{a},q)$ a the fundamental solution matrix of the quantum difference equation of a Nakajima variety $X$. In this work, we prove that the operator $$ \Psi(\textbf{z},\textbf{a},q)…

We describe a non-commutative generalization of the complex Fourier-Mellin transform to Clifford algebra valued signal functions over the domain $\R^{p,q}$ taking values in Cl(p,q), p+q=2. Keywords: algebra, Fourier transforms; Logic, set…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

Given a field K, a quadratic extension field L is an extension of K that can be generated from K by adding a root of a quadratic polynomial with coefficients in K. This paper shows how ACL2(r) can be used to reason about chains of quadratic…

Artin solved Hilbert's $17^{th}$ problem by showing that every positive semidefinite polynomial can be realized as a sum of squares of rational functions. Pfister gave a bound on the number of squares of rational functions: if $p$ is a…