VLDB 2026 Research / reviewers in the wild / expert
Máté L. Telek
dblp:298/1247
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0001-9237-3776ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Viro's patchworking and the signed reduced A-discriminantabstractComputing the isotopy type of a hypersurface, defined as the positive real zero set of a multivariate polynomial, is a challenging problem in real algebraic geometry. We focus on the case where the defining polynomial has combinatorially restricted exponent vectors and fixed coefficient signs, enabling faster computation of the isotopy type. In particular, Viro's patchworking provides a polyhedral complex that has the same isotopy type as the hypersurface, for certain choices of the coefficients. So we present properties of the signed support, focusing mainly on the case of n-variate (n+3)-nomials, that ensure all possible isotopy types can be obtained via patchworking. To prove this, we study the signed reduced A-discriminant and show that it has a simple structure if the signed support satisfies some combinatorial conditions. Weixun Deng, J. Maurice Rojas, Máté L. Telek |
J. Symb. Comput. | 3 |
| 2026 | Computing positive tropical varieties and lower bounds on the number of positive roots
Kemal Rose, Máté L. Telek |
J. Symb. Comput. | 2 |
| 2023 | Topological descriptors of the parameter region of multistationarity: Deciding upon connectivityabstractSwitch-like responses arising from bistability have been linked to cell signaling processes and memory. Revealing the shape and properties of the set of parameters that lead to bistability is necessary to understand the underlying biological mechanisms, but is a complex mathematical problem. We present an efficient approach to address a basic topological property of the parameter region of multistationary, namely whether it is connected. The connectivity of this region can be interpreted in terms of the biological mechanisms underlying bistability and the switch-like patterns that the system can create. We provide an algorithm to assert that the parameter region of multistationarity is connected, targeting reaction networks with mass-action kinetics. We show that this is the case for numerous relevant cell signaling motifs, previously described to exhibit bistability. The method relies on linear programming and bypasses the expensive computational cost of direct and generic approaches to study parametric polynomial systems. This characteristic makes it suitable for mass-screening of reaction networks. Although the algorithm can only be used to certify connectivity, we illustrate that the ideas behind the algorithm can be adapted on a case-by-case basis to also decide that the region is not connected. In particular, we show that for a motif displaying a phosphorylation cycle with allosteric enzyme regulation, the region of multistationarity has two distinct connected components, corresponding to two different, but symmetric, biological mechanisms. Máté L. Telek, Elisenda Feliu |
PLoS Comput. Biol. | 1 |