Kemal Rose
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kemal Rose has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Enis Kaya
KU Leuven, Department of Mathematics, Celestijnenlaan 200B, Leuven, B-3001, Belgium
2 shared publications - Paul Breiding
University of Osnabrück, Osnabrück, Germany
2 shared publications - Rida Ait El Manssour
MPI MiS, Leipzig, Germany
2 shared publications - Sascha Timme
Technische Universität Berlin, Berlin, Germany
2 shared publications - Yassine El Maazouz
Department of Mathematics, California Institute of Technology, Pasadena, USA
2 shared publications - Bernd Sturmfels
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
1 shared publication
Latest Publications
- 16 September 2023
- Published by Springer Nature in Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
- Vol. 93 (2) , 149-162
Lines on p-adic and real cubic surfaces
- 16 September 2023
- Published by Springer Nature in Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
- Vol. 93 (2) , 149-162
Lines on p-adic and real cubic surfaces
- Open Access
Lines on $p$-adic and real cubic surfaces
We study lines on smooth cubic surfaces over the field of $p$-adic numbers, from a theoretical and computational point of view. Segre showed that the possible counts of such lines are $0,1,2,3,5,7,9,15$ or $27$. We show that each of these counts is achieved. Probabilistic aspects are also investigated by sampling both $p$-adic and real cubic surfaces from different distributions and estimating the probability of each count. We link this to recent results on probabilistic enumerative geometry. Some experimental results on the Galois groups attached to $p$-adic cubic surfaces are also discussed.Open AccessLines on $p$-adic and real cubic surfaces
We study lines on smooth cubic surfaces over the field of $p$-adic numbers, from a theoretical and computational point of view. Segre showed that the possible counts of such lines are $0,1,2,3,5,7,9,15$ or $27$. We show that each of these counts is achieved. Probabilistic aspects are also investigated by sampling both $p$-adic and real cubic surfaces from different distributions and estimating the probability of each count. We link this to recent results on probabilistic enumerative geometry. Some experimental results on the Galois groups attached to $p$-adic cubic surfaces are also discussed. - Open Access
Tropical Implicitization Revisited
Tropical implicitization means computing the tropicalization of a unirational variety from its parametrization. In the case of a hypersurface, this amounts to finding the Newton polytope of the implicit equation, without computing its coefficients. We present a new implementation of this procedure in Oscar.jl. It solves challenging instances, and can be used for classical implicitization as well. We also develop implicitization in higher codimension via Chow forms, and we pose several open questions.
Open AccessTropical Implicitization Revisited
Tropical implicitization means computing the tropicalization of a unirational variety from its parametrization. In the case of a hypersurface, this amounts to finding the Newton polytope of the implicit equation, without computing its coefficients. We present a new implementation of this procedure in Oscar.jl. It solves challenging instances, and can be used for classical implicitization as well. We also develop implicitization in higher codimension via Chow forms, and we pose several open questions.
- Open Access
- 21 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 49 (1) , 1-14
Certifying Zeros of Polynomial Systems Using Interval Arithmetic
We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify , which proves the correctness of an isolated nonsingular solution to a square system of polynomial equations. The implementation rests on Krawczyk’s method. We demonstrate that it dramatically outperforms earlier approaches to certification. We see this contribution as a powerful new tool in numerical algebraic geometry, which can make certification the default and not just an option.
- 21 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 49 (1) , 1-14
Open AccessCertifying Zeros of Polynomial Systems Using Interval Arithmetic
We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify , which proves the correctness of an isolated nonsingular solution to a square system of polynomial equations. The implementation rests on Krawczyk’s method. We demonstrate that it dramatically outperforms earlier approaches to certification. We see this contribution as a powerful new tool in numerical algebraic geometry, which can make certification the default and not just an option.
- Open Access
Algebraic optimization of sequential decision problems
We study the optimization of the expected long-term reward in finite partially observable Markov decision processes over the set of stationary stochastic policies. In the case of deterministic observations, also known as state aggregation, the problem is equivalent to optimizing a linear objective subject to quadratic constraints. We characterize the feasible set of this problem as the intersection of a product of affine varieties of rank one matrices and a polytope. Based on this description, we obtain bounds on the number of critical points of the optimization problem. Finally, we conduct experiments in which we solve the KKT equations or the Lagrange equations over different boundary components of the feasible set, and compare the result to the theoretical bounds and to other constrained optimization methods.
Open AccessAlgebraic optimization of sequential decision problems
We study the optimization of the expected long-term reward in finite partially observable Markov decision processes over the set of stationary stochastic policies. In the case of deterministic observations, also known as state aggregation, the problem is equivalent to optimizing a linear objective subject to quadratic constraints. We characterize the feasible set of this problem as the intersection of a product of affine varieties of rank one matrices and a polytope. Based on this description, we obtain bounds on the number of critical points of the optimization problem. Finally, we conduct experiments in which we solve the KKT equations or the Lagrange equations over different boundary components of the feasible set, and compare the result to the theoretical bounds and to other constrained optimization methods.
- Open Access
Certifying zeros of polynomial systems using interval arithmetic
We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify, which proves the correctness of an isolated nonsingular solution to a square system of polynomial equations. The implementation rests on Krawczyk's method. We demonstrate that it dramatically outperforms earlier approaches to certification. We see this contribution as powerful new tool in numerical algebraic geometry, that can make certification the default and not just an option.
Open AccessCertifying zeros of polynomial systems using interval arithmetic
We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify, which proves the correctness of an isolated nonsingular solution to a square system of polynomial equations. The implementation rests on Krawczyk's method. We demonstrate that it dramatically outperforms earlier approaches to certification. We see this contribution as powerful new tool in numerical algebraic geometry, that can make certification the default and not just an option.