Related papers: The Radical Solution and Computational Complexity
The P versus NP problem asks whether every language verifiable in polynomial time can also be decided in deterministic polynomial time. In this paper, we present a constructive proof that P = NP by introducing a universal, graph-based…
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…
We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…
There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/0209112) and by Rudolph (quant-ph/0206068). Gudkov et al.…
We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classical problem in computational…
We introduce tropical Newton-Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton-Puiseux polynomial. A polynomial complexity algorithm for resolubility of a…
There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…
The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…
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…
In the recent paper arXiv:0710.4085 was shown that any solution of "the polynomial moment problem", which asks to describe polynomials Q orthogonal to all powers of a given polynomial P on a segment, may be obtained as a sum of some…
Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $\Gamma_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\psi(G)$, asks for all such possible sets. In this…
We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…
Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…