VLDB 2026 Research / reviewers in the wild / expert
Robert Krone
dblp:146/0485
· DBLP profile ↗
5ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-9779-5476ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 2 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Noetherian operators and primary decomposition
Marc Härkönen, Robert Krone, Anton Leykin |
J. Symb. Comput. | 3 |
| 2019 | The Tropical Cayley-Menger VarietyabstractThe Cayley--Menger variety is the Zariski closure of the set of vectors specifying the pairwise squared distances between $n$ points in $\mathbb{R}^d$. This variety is fundamental to algebraic approaches in rigidity theory. We study the tropicalization of the Cayley--Menger variety. In particular, when $d = 2$, we show that it is the Minkowski sum of the set of ultrametrics on $n$ leaves with itself, and we describe its polyhedral structure. We then give a new, tropical, proof of Laman's theorem. Daniel Irving Bernstein, Robert Krone |
SIAM J. Discret. Math. | 2 |
| 2017 | Numerical algorithms for detecting embedded components
Robert Krone, Anton Leykin |
J. Symb. Comput. | 1 |
| 2016 | Equivariant Gröbner Bases of Symmetric Toric IdealsabstractIt has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have finite Gröbner bases up to symmetry for certain monomial orders. An algorithm is presented for computing equivariant Gröbner bases that terminates whenever a finite basis exists, improving on previous algorithms that only guaranteed termination in rings Noetherian up to symmetry. This algorithm can be used to compute equivariant Gröbner bases of the above toric ideals, given the monomial map. Robert Krone |
ISSAC | 1 |
| 2014 | Equivariant lattice generators and Markov basesabstractIt has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by a single monomial. Considering the corresponding lattice map, we explicitly construct an equivariant lattice generating set, whose width (the number of variables necessary to write it down) depends linearly on the width of the map. This result is sharp and improves dramatically the previously known upper bound as it does not depend on the degree of the image monomial. In the case of of width two, we construct an explicit finite set of binomials generating the toric ideal up to symmetry. Both width and degree of this generating set are sharply bounded by linear functions in the exponents of the monomial. Thomas Kahle, Robert Krone, Anton Leykin |
ISSAC | 2 |