Related papers: The solutions to single-variable polynomials, impl…
We explore families of pairs of quadratic polynomials $f(x)=x^2+c\in \mathbb{Q}$ and $a\in \mathbb{Q}$ with $a$ being a strictly preperiodic point of $f$ to provide infinitely many new examples for which the associated arboreal Galois…
We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly MQA (also…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
Proof assistants enable users to develop machine-checked proofs regarding software-related properties. Unfortunately, the interactive nature of these proof assistants imposes most of the proof burden on the user, making formal verification…
We have proved in this paper that numbers can be expressed in algebraic form using one variable and two real rational quantities and thus sum of three cubes can also be expressed in algebraic form as a cubic polynomial. Using skeletal or…
Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
The large sieve is used to estimate the density of integral quadratic polynomials $Q$, such that there exists an odd degree integral polynomial which has resultant $\pm 1$ with $Q$. Given a monic integral polynomial $R$ of odd degree, this…
This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations. The derivation is computationally light and conceptually natural, and has the…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…
We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…
In this paper we give a preliminary formalization of the p-adic numbers, in the context of the second author's univalent foundations program. We also provide the corresponding code verifying the construction in the proof assistant Coq.…
Proof assistants are getting more widespread use in research and industry to provide certified and independently checkable guarantees about theories, designs, systems and implementations. However, proof assistant implementations themselves…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
In this paper, we propose a new construction of quadratic bent functions in polynomial forms. Right Euclid algorithm in skew-polynomial rings over finite fields of characteristic 2 is applied in the proof.