scholarly journals Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations

2005 ◽  
pp. 397-406 ◽  
Author(s):  
H. Bekker ◽  
E. P. Braad ◽  
B. Goldengorin
Keyword(s):  
Polynomial Equations ◽  
System Of Polynomial Equations

scholarly journals A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations

2009 ◽  
Vol 47 (5) ◽  
pp. 3608-3623 ◽  
Author(s):  
Daniel J. Bates ◽  
Jonathan D. Hauenstein ◽  
Chris Peterson ◽  
Andrew J. Sommese
Keyword(s):  
Solution Set ◽  
Polynomial Equations ◽  
Local Dimension ◽  
System 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].

Analysis of secret sharing schemes based on Nielsen transformations

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Matvei Kotov ◽  
Dmitry Panteleev ◽  
Alexander Ushakov
Keyword(s):  
Computer Algebra ◽  
Secret Sharing ◽  
Computer Algebra System ◽  
Cryptographic Protocols ◽  
Secret Sharing Schemes ◽  
Polynomial Equations ◽  
Polynomial Size ◽  
Security Properties ◽  
System Of Polynomial Equations

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.

Use of Resultants and the Bernshtein Formula in the Dimensional Synthesis of Linkage Components

1994 ◽  
Vol 116 (4) ◽  
pp. 1171-1172 ◽  
Author(s):  
Chuen-Sen Lin ◽  
Bao-Ping Jia
Keyword(s):  
Closed Form ◽  
Closed Form Solution ◽  
Form Solution ◽  
Polynomial Equations ◽  
Dimensional Synthesis ◽  
Fourth Degree ◽  
Finite Precision ◽  
Closed Form Solutions ◽  
System Of Polynomial Equations ◽  
Resultant Theory

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.

scholarly journals Advances in Polynomial Continuation for Solving Problems in Kinematics

2004 ◽  
Vol 126 (2) ◽  
pp. 262-268 ◽  
Author(s):  
Andrew J. Sommese ◽  
Jan Verschelde ◽  
Charles W. Wampler
Keyword(s):  
Mechanical Systems ◽  
Robotic Manipulators ◽  
Degree Of Freedom ◽  
Polynomial Equations ◽  
Dimensional Solution ◽  
Solution Sets ◽  
The Past ◽  
Higher Dimensional ◽  
Isolated Roots ◽  
System Of Polynomial Equations

For many mechanical systems, including nearly all robotic manipulators, the set of possible configurations that the links may assume can be described by a system of polynomial equations. Thus, solving such systems is central to many problems in analyzing the motion of a mechanism or in designing a mechanism to achieve a desired motion. This paper describes techniques, based on polynomial continuation, for numerically solving such systems. Whereas in the past, these techniques were focused on finding isolated roots, we now address the treatment of systems having higher-dimensional solution sets. Special attention is given to cases of exceptional mechanisms, which have a higher degree of freedom of motion than predicted by their mobility. In fact, such mechanisms often have several disjoint assembly modes, and the degree of freedom of motion is not necessarily the same in each mode. Our algorithms identify all such assembly modes, determine their dimension and degree, and give sample points on each.

scholarly journals Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products

2021 ◽  
Vol 28 (2) ◽  
Author(s):  
A. Esterov ◽  
L. Lang
Keyword(s):  
Galois Group ◽  
Wreath Product ◽  
Galois Theory ◽  
General System ◽  
Wreath Products ◽  
Galois Groups ◽  
Complex Polynomial ◽  
Polynomial Equations ◽  
Sparse Polynomial ◽  
System Of Polynomial Equations

AbstractWe introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geometry. As a model example, consider the problem of permuting the roots of a complex polynomial $$f(x) = c_0 + c_1 x^{d_1} + \cdots + c_k x^{d_k}$$ f ( x ) = c 0 + c 1 x d 1 + ⋯ + c k x d k by varying its coefficients. If the GCD of the exponents is d, then the polynomial admits the change of variable $$y=x^d$$ y = x d , and its roots split into necklaces of length d. At best we can expect to permute these necklaces, i.e. the Galois group of f equals the wreath product of the symmetric group over $$d_k/d$$ d k / d elements and $${\mathbb {Z}}/d{\mathbb {Z}}$$ Z / d Z . We study the multidimensional generalization of this equality: the Galois group of a general system of polynomial equations equals the expected wreath product for a large class of systems, but in general this expected equality fails, making the problem of describing such Galois groups unexpectedly rich.

scholarly journals On the moments of torsion points modulo primes and their applications

2020 ◽  
pp. 1-17
Author(s):  
Amir Akbary ◽  
Peng-Jie Wong
Keyword(s):  
Algebraic Group ◽  
Algebraic Groups ◽  
Residue Field ◽  
Density Theorem ◽  
Polynomial Equations ◽  
Absolute Galois Group ◽  
Torsion Points ◽  
Chebotarev Density Theorem ◽  
System Of Polynomial Equations ◽  
Dimension One

Let [Formula: see text] be the group of [Formula: see text]-torsion points of a commutative algebraic group [Formula: see text] defined over a number field [Formula: see text]. For a prime [Formula: see text] of [Formula: see text], we let [Formula: see text] be the number of [Formula: see text]-solutions of the system of polynomial equations defining [Formula: see text] when reduced modulo [Formula: see text]. Here, [Formula: see text] is the residue field at [Formula: see text]. Let [Formula: see text] denote the number of primes [Formula: see text] of [Formula: see text] such that [Formula: see text]. We then, for algebraic groups of dimension one, compute the [Formula: see text]th moment limit [Formula: see text] by appealing to the Chebotarev density theorem. We further interpret this limit as the number of orbits of the action of the absolute Galois group of [Formula: see text] on [Formula: see text] copies of [Formula: see text] by an application of Burnside’s Lemma. These concrete examples suggest a possible approach for determining the number of orbits of a group acting on [Formula: see text] copies of a set.

scholarly journals Positive Polynomials and Boundary Interpolation with Finite Blaschke Products

2021 ◽  
Author(s):  
Sergei Kalmykov ◽  
Béla Nagy
Keyword(s):  
Unit Circle ◽  
Specific Form ◽  
The Other ◽  
Geometric Representation ◽  
Polynomial Equations ◽  
Blaschke Products ◽  
Positive Polynomials ◽  
Boundary Interpolation ◽  
Finite Blaschke Products ◽  
System Of Polynomial Equations

AbstractThe famous Jones–Ruscheweyh theorem states that n distinct points on the unit circle can be mapped to n arbitrary points on the unit circle by a Blaschke product of degree at most $$n-1$$ n - 1 . In this paper, we provide a new proof using real algebraic techniques. First, the interpolation conditions are rewritten into complex equations. These complex equations are transformed into a system of polynomial equations with real coefficients. This step leads to a “geometric representation” of Blaschke products. Then another set of transformations is applied to reveal some structure of the equations. Finally, the following two fundamental tools are used: a Positivstellensatz by Prestel and Delzell describing positive polynomials on compact semialgebraic sets using Archimedean module of length N. The other tool is a representation of positive polynomials in a specific form due to Berr and Wörmann. This, combined with a careful calculation of leading terms of occurring polynomials finishes the proof.

Sign in / Sign up

Export Citation Format

Share Document