scholarly journals PRIME SOLUTIONS TO POLYNOMIAL EQUATIONS IN MANY VARIABLES AND DIFFERING DEGREES

2018 ◽  
Vol 6 ◽  
Author(s):  
SHUNTARO YAMAGISHI
Keyword(s):  
Diophantine Equations ◽  
Circle Method ◽  
Sufficient Conditions ◽  
Polynomial Equations ◽  
Integer Coefficients ◽  
Global Type ◽  
Systems Of Polynomial Equations ◽  
Logarithmic Weight ◽  
Type Statement ◽  
Invent Math

Let $\mathbf{f}=(f_{1},\ldots ,f_{R})$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_{j}(x_{1},\ldots ,x_{n})=0~(1\leqslant j\leqslant R)$ satisfies a general local to global type statement, and has a solution where each coordinate is prime. In fact we obtain the asymptotic formula for number of such solutions, counted with a logarithmic weight, under these conditions. We prove the statement via the Hardy–Littlewood circle method. This is a generalization of the work of Cook and Magyar [‘Diophantine equations in the primes’, Invent. Math.198 (2014), 701–737], where they obtained the result when the polynomials of $\mathbf{f}$ all have the same degree. Hitherto, results of this type for systems of polynomial equations involving different degrees have been restricted to the diagonal case.

Construction of systems of polynomial equations with exact p-Divisibility via the covering method

2014 ◽  
Vol 13 (06) ◽  
pp. 1450013 ◽  
Author(s):  
Francis N. Castro ◽  
Ivelisse M. Rubio
Keyword(s):  
Exponential Sums ◽  
Polynomial Equations ◽  
Prime Field ◽  
Elementary Method ◽  
Covering Method ◽  
Systems Of Polynomial Equations

We present an elementary method to compute the exact p-divisibility of exponential sums of systems of polynomial equations over the prime field. Our results extend results by Carlitz and provide concrete and simple conditions to construct families of polynomial equations that are solvable over the prime field.

scholarly journals Linear Network Codes and Systems of Polynomial Equations

2008 ◽  
Vol 54 (5) ◽  
pp. 2303-2316 ◽  
Author(s):  
Randall Dougherty ◽  
Chris Freiling ◽  
Kenneth Zeger
Keyword(s):  
Polynomial Equations ◽  
Linear Network ◽  
Network Codes ◽  
Systems Of Polynomial Equations

scholarly journals Bivariate systems of polynomial equations with roots of high multiplicity

2021 ◽  
Author(s):  
I. Nikitin
Keyword(s):  
High Multiplicity ◽  
Polynomial Equations ◽  
Support Sets ◽  
Multiplicity Formula ◽  
System Of Polynomial Equations ◽  
Systems Of Polynomial Equations

Given a bivariate system of polynomial equations with fixed support sets [Formula: see text] it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity [Formula: see text] for all [Formula: see text] in the range [Formula: see text], where [Formula: see text] is the set of all integral vectors that shift B to a subset of [Formula: see text]. As an application, we classify all pairs [Formula: see text] such that the system supported at [Formula: see text] does not have a solution of multiplicity higher than [Formula: see text].

scholarly journals Galois theory for general systems of polynomial equations

2019 ◽  
Vol 155 (2) ◽  
pp. 229-245 ◽  
Author(s):  
A. Esterov
Keyword(s):  
Galois Theory ◽  
General System ◽  
Mixed Volume ◽  
Polynomial Equations ◽  
Systems Of Equations ◽  
Change Of Variables ◽  
General Polynomial ◽  
General Systems ◽  
Systems Of Polynomial Equations

We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because arbitrary systems split into reduced irreducible ones upon monomial changes of variables. In particular, our result proves the multivariate version of the Abel–Ruffini theorem: the classification of general systems of equations solvable by radicals reduces to the classification of lattice polytopes of mixed volume 4 (which we prove to be finite in every dimension). We also notice that the monodromy of every general system of equations is either symmetric or imprimitive. The proof is based on a new result of independent importance regarding dual defectiveness of systems of equations: the discriminant of a reduced irreducible square system of general polynomial equations is a hypersurface unless the system is linear up to a monomial change of variables.

Solving Polynomial Systems for the Kinematic Analysis and Synthesis of Mechanisms and Robot Manipulators

1995 ◽  
Vol 117 (B) ◽  
pp. 71-79 ◽  
Author(s):  
M. Raghavan ◽  
B. Roth
Keyword(s):  
Kinematic Analysis ◽  
State Of The Art ◽  
Polynomial Systems ◽  
The State ◽  
Polynomial Equations ◽  
Systems Of Equations ◽  
Synthesis Of Mechanisms ◽  
Analysis And Synthesis ◽  
Systems Of Polynomial Equations ◽  
And Robotics

Problems in mechanisms analysis and synthesis and robotics lead naturally to systems of polynomial equations. This paper reviews the state of the art in the solution of such systems of equations. Three well-known methods for solving systems of polynomial equations, viz., Dialytic Elimination, Polynomial Continuation, and Grobner bases are reviewed. The methods are illustrated by means of simple examples. We also review important kinematic analysis and synthesis problems and their solutions using these mathematical procedures.

Sign in / Sign up

Export Citation Format

Share Document