Using monodromy to statistically estimate the number of solutions

04/24/2020
by   Jonathan D. Hauenstein, et al.
0

Synthesis problems for linkages in kinematics often yield large structured parameterized polynomial systems which generically have far fewer solutions than traditional upper bounds would suggest. This paper describes statistical models for estimating the generic number of solutions of such parameterized polynomial systems. The new approach extends previous work on success ratios of parameter homotopies to using monodromy loops as well as the addition of a trace test that provides a stopping criterion for validating that all solutions have been found. Several examples are presented demonstrating the method including Watt I six-bar motion generation problems.

READ FULL TEXT
research
08/04/2023

Kernelization of Counting Problems

We introduce a new framework for the analysis of preprocessing routines ...
research
09/07/2020

New Upper Bounds for Trace Reconstruction

We improve the upper bound on trace reconstruction to (O(n^1/5))....
research
01/11/2021

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst...
research
11/11/2022

A parameterized halting problem, Δ_0 truth and the MRDP theorem

We study the parameterized complexity of the problem to decide whether a...
research
10/14/2019

Graph Clustering in All Parameter Regimes

Resolution parameters in graph clustering represent a size and quality t...
research
10/14/2022

Parallel solutions for ordinal scheduling with a small number of machines

We study ordinal makespan scheduling on small numbers of identical machi...

Please sign up or login with your details

Forgot password? Click here to reset