scholarly journals Validating the Completeness of the Real Solution Set of a System of Polynomial Equations

Author(s):  
Daniel A. Brake ◽  
Jonathan D. Hauenstein ◽  
Alan C. Liddell
2009 ◽  
Vol 47 (5) ◽  
pp. 3608-3623 ◽  
Author(s):  
Daniel J. Bates ◽  
Jonathan D. Hauenstein ◽  
Chris Peterson ◽  
Andrew J. Sommese

Author(s):  
I. Nikitin

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].


2002 ◽  
Vol 16 (03) ◽  
pp. 453-461 ◽  
Author(s):  
GRZEGORZ LITAK

The effect of nonmagnetic disorder on the pairing amplitude is studied by means of a perturbation method. Using an extended one band Hubbard model with an intersite attraction we analyze various solutions of p-wave pairing symmetry and discuss their instability calculating fluctuations of order parameter. The model is applied to describe the effect of disorder in Sr2RuO4. The results shows that the real solution with line nodes can be favoured by disorder.


2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Matvei Kotov ◽  
Dmitry Panteleev ◽  
Alexander Ushakov

Abstract We investigate security properties of two secret-sharing protocols proposed by Fine, Moldenhauer, and Rosenberger in Sections 4 and 5 of [B. Fine, A. Moldenhauer and G. Rosenberger, Cryptographic protocols based on Nielsen transformations, J. Comput. Comm. 4 2016, 63–107] (Protocols I and II resp.). For both protocols, we consider a one missing share challenge. We show that Protocol I can be reduced to a system of polynomial equations and (for most randomly generated instances) solved by the computer algebra system Singular. Protocol II is approached using the technique of Stallings’ graphs. We show that knowledge of {m-1} shares reduces the space of possible values of a secret to a set of polynomial size.


1986 ◽  
Vol 79 (9) ◽  
pp. 732-737
Author(s):  
Jillian C. F. Sullivan

Although solving polynomial equations is important in mathematics, most high school students can solve only linear and quadratic equations. This is because the methods for solving cubic and quartic equations are difficult, and no general methods of solution are available for equations of degree higher than four. However, numerical methods can be used to approximate the real solutions of polynomial equations of any degree. Because they involve a great deal of computation they have not traditionally been taught in the schools. Now that most students have access to calculators and computers, this computational difficulty is easily overcome.


1994 ◽  
Vol 116 (4) ◽  
pp. 1171-1172 ◽  
Author(s):  
Chuen-Sen Lin ◽  
Bao-Ping Jia

The applications of resultants and the Bernshtein formula for the dimensional synthesis of linkage components for finite precision positions are discussed. The closed-form solutions, which are derived from systems of polynomials in multiple unknowns by applying resultant theory, are in forms of polynomial equations of a single unknown. For the case of two compatibility equations, the closed form solution is a sixth degree solution polynomial. For the case of three compatibility equations, the solution is a fifty-fourth degree solution polynomial. For each case, the Bernshtein formula is applied to calculate the number of solutions of the system of polynomial equations. The calculated numbers of solutions match the degrees of the solution polynomials for both cases.


Sign in / Sign up

Export Citation Format

Share Document