Anton Leykin

According to our database, Anton Leykin authored at least 45 papers between 2001 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Local dual spaces and primary decomposition.

Justin Chen, Marc Härkönen, Anton Leykin

J. Symb. Comput., 2025

2024

PL₁P: Point-Line Minimal Problems under Partial Visibility in Three Views.

Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla

Int. J. Comput. Vis., August, 2024

u-generation: solving systems of polynomials equation-by-equation.

Timothy Duff, Anton Leykin, Jose Israel Rodriguez

Numer. Algorithms, February, 2024

PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility.

Timothy Duff, Kathlén Kohn, Anton Leykin, Tomás Pajdla

IEEE Trans. Pattern Anal. Mach. Intell., January, 2024

Discrete Shortest Paths in Optimal Power Flow Feasible Regions.

Daniel Turizo, Diego Cifuentes, Anton Leykin, Daniel K. Molzahn

CoRR, 2024

2023

Trifocal Relative Pose From Lines at Points.

Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret H. Regan, David da Costa de Pinho, Elias P. Tsigaridas, Charles W. Wampler, Jonathan D. Hauenstein, Peter J. Giblin, Benjamin B. Kimia, Anton Leykin, Tomás Pajdla

IEEE Trans. Pattern Anal. Mach. Intell., June, 2023

Foreword.

Anton Leykin, Pierre Lairez

J. Symb. Comput., 2023

Numerical Nonlinear Algebra.

Daniel J. Bates, Paul Breiding, Tianran Chen, Jonathan D. Hauenstein, Anton Leykin, Frank Sottile

CoRR, 2023

Isolating clusters of zeros of analytic systems using arbitrary-degree inflation.

Michael A. Burr, Kisun Lee, Anton Leykin

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022

Noetherian operators and primary decomposition.

Justin Chen, Marc Härkönen, Robert Krone, Anton Leykin

J. Symb. Comput., 2022

Learning to Solve Hard Minimal Problems.

Petr Hruby, Timothy Duff, Anton Leykin, Tomás Pajdla

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021

Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm.

Anton Leykin, Abraham Martín del Campo, Frank Sottile, Ravi Vakil, Jan Verschelde

Math. Comput., 2021

A numerical toolkit for multiprojective varieties.

Jonathan D. Hauenstein, Anton Leykin, Jose Israel Rodriguez, Frank Sottile

Math. Comput., 2021

2020

Inflation of poorly conditioned zeros of systems of analytic functions.

Michael A. Burr, Anton Leykin

CoRR, 2020

TRPLP - Trifocal Relative Pose From Lines at Points.

Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret H. Regan, David da Costa de Pinho, Elias P. Tsigaridas, Charles W. Wampler, Jonathan D. Hauenstein, Peter J. Giblin, Benjamin B. Kimia, Anton Leykin, Tomás Pajdla

Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

2019

Beyond polyhedral homotopies.

Anton Leykin, Josephine Yu

J. Symb. Comput., 2019

Trifocal Relative Pose from Lines at Points and its Efficient Solution.

Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret H. Regan, David da Costa de Pinho, Elias P. Tsigaridas, Charles Wrampler, Jonathan D. Hauenstein, Benjamin B. Kimia, Anton Leykin, Tomás Pajdla

CoRR, 2019

Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions.

Michael A. Burr, Kisun Lee, Anton Leykin

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Monodromy Solver: Sequential and Parallel.

Nathan Bliss, Timothy Duff, Anton Leykin, Jeff Sommars

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Homotopy Continuation in Macaulay2.

Anton Leykin

Proceedings of the Mathematical Software - ICMS 2018, 2018

2017

Determinantal representations of hyperbolic curves via polynomial homotopy continuation.

Anton Leykin, Daniel Plaumann

Math. Comput., 2017

Numerical algorithms for detecting embedded components.

Robert Krone, Anton Leykin

J. Symb. Comput., 2017

2016

Computing Tropical Curves via Homotopy Continuation.

Anders Nedergaard Jensen, Anton Leykin, Josephine Yu

Exp. Math., 2016

Solving polynomial systems via homotopy continuation and monodromy.

Timothy Duff, Cvetelina Hill, Anders Nedergaard Jensen, Kisun Lee, Anton Leykin, Jeff Sommars

CoRR, 2016

Polynomial homotopy continuation in Macaulay2.

Anton Leykin

ACM Commun. Comput. Algebra, 2016

2014

Equivariant lattice generators and Markov bases.

Thomas Kahle, Robert Krone, Anton Leykin

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

Robust Certified Numerical Homotopy Tracking.

Carlos Beltrán, Anton Leykin

Found. Comput. Math., 2013

Bertini for Macaulay2.

Daniel J. Bates, Elizabeth Gross, Anton Leykin, Jose Israel Rodriguez

CoRR, 2013

2012

Certified Numerical Homotopy Tracking.

Carlos Beltrán, Anton Leykin

Exp. Math., 2012

2011

A search for an optimal start system for numerical homotopy continuation

Anton Leykin

CoRR, 2011

2010

Abstract only: Certified numerical solving of systems of polynomial equations.

Anton Leykin

ACM Commun. Comput. Algebra, 2010

Algorithms for Bernstein-Sato polynomials and multiplier ideals.

Christine Berkesch, Anton Leykin

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

Galois groups of Schubert problems via homotopy computation.

Anton Leykin, Frank Sottile

Math. Comput., 2009

Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm.

Anton Leykin, Jan Verschelde

Int. J. Comput. Sci. Eng., 2009

Numerical Algebraic Geometry for Macaulay2

Anton Leykin

CoRR, 2009

2008

Numerical primary decomposition.

Anton Leykin

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

Computing monodromy via parallel homotopy continuation.

Anton Leykin, Frank Sottile

Proceedings of the Parallel Symbolic Computation, 2007

2006

Newton's method with deflation for isolated singularities of polynomial systems.

Anton Leykin, Jan Verschelde, Ailing Zhao

Theor. Comput. Sci., 2006

Computing the support of local cohomology modules.

Josep Àlvarez Montaner, Anton Leykin

J. Symb. Comput., 2006

Parallel Homotopy Algorithms to Solve Polynomial Systems.

Anton Leykin, Jan Verschelde, Yan Zhuang

Proceedings of the Mathematical Software, 2006

Interfacing with the Numerical Homotopy Algorithms in <i>PHCpack</i>.

Anton Leykin, Jan Verschelde

Proceedings of the Mathematical Software, 2006

2005

Factoring Solution Sets of Polynomial Systems in Parallel.

Anton Leykin, Jan Verschelde

Proceedings of the 34th International Conference on Parallel Processing Workshops (ICPP 2005 Workshops), 2005

2004

Algorithmic proofs of two theorems of Stafford.

Anton Leykin

J. Symb. Comput., 2004

On Parallel Computation of Gröbner Bases.

Anton Leykin

Proceedings of the 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 2004

2001

Constructibility of the Set of Polynomials with a Fixed Bernstein-Sato Polynomial: an Algorithmic Approach.

Anton Leykin

J. Symb. Comput., 2001