Pablo Solernó
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Pablo Solernó has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Gabriela Jeronimo
Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
14 shared publications - Lisi D'Alfonso
Departamento de Matematica, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Ciudad Universitaria, Buenos Aires, Argentina
6 shared publications - Guillermo Matera
National Council of Science and Technology (CONICET), Buenos Aires, Argentina
5 shared publications - Lisi D'Alfonso
Univ Buenos Aires, Ciclo Basico Comun, Dept Ciencias Exactas, Area Matemat, Buenos Aires, DF, Argentina
5 shared publications - Joos Heintz
Departamento de Computación Universidad de Buenos Aires and CONICET Ciudad Univ., Pab.I 1428 Buenos Aires Argentina
4 shared publications - Ariel Waissbein
CoreLabs, CORE Security Technologies, Buenos Aires, Argentina
2 shared publications
Latest Publications
- 27 April 2025
- Published by Springer Nature in Collectanea Mathematica
- Vol. 77 (2) , 407-431
On the geometric degree of the tangent bundle of a smooth algebraic variety
- 27 April 2025
- Published by Springer Nature in Collectanea Mathematica
- Vol. 77 (2) , 407-431
On the geometric degree of the tangent bundle of a smooth algebraic variety
- Open Access
Identifiability from a few species for a class of biochemical reaction networks
Under mass-action kinetics, biochemical reaction networks give rise to polynomial autonomous dynamical systems whose parameters are often difficult to estimate. We deal in this paper with the problem of identifying the kinetic parameters of a class of biochemical networks which are abundant, such as multisite phosphorylation systems and phosphorylation cascades (for example, MAPK cascades). For any system of this class we explicitly exhibit a single species for each connected component of the associated digraph such that the successive total derivatives of its concentration allow us to identify all the parameters occurring in the component. The number of derivatives needed is bounded essentially by the length of the corresponding connected component of the digraph. Moreover, in the particular case of the cascades, we show that the parameters can be identified from a bounded number of successive derivatives of the last product of the last layer. This theoretical result induces also a heuristic interpolation-based identifiability procedure to recover the values of the rate constants from exact measurements.
Open AccessIdentifiability from a few species for a class of biochemical reaction networks
Under mass-action kinetics, biochemical reaction networks give rise to polynomial autonomous dynamical systems whose parameters are often difficult to estimate. We deal in this paper with the problem of identifying the kinetic parameters of a class of biochemical networks which are abundant, such as multisite phosphorylation systems and phosphorylation cascades (for example, MAPK cascades). For any system of this class we explicitly exhibit a single species for each connected component of the associated digraph such that the successive total derivatives of its concentration allow us to identify all the parameters occurring in the component. The number of derivatives needed is bounded essentially by the length of the corresponding connected component of the digraph. Moreover, in the particular case of the cascades, we show that the parameters can be identified from a bounded number of successive derivatives of the last product of the last layer. This theoretical result induces also a heuristic interpolation-based identifiability procedure to recover the values of the rate constants from exact measurements.
- Open Access
- 1 August 2018
- Published by Elsevier in Journal of Algebra
- Vol. 507, 547-570
Quantitative aspects of the generalized differential Lüroth's Theorem
- 1 August 2018
- Published by Elsevier in Journal of Algebra
- Vol. 507, 547-570
Open AccessQuantitative aspects of the generalized differential Lüroth's Theorem
- Open Access
On Bezout Inequalities for non-homogeneous Polynomial Ideals
We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators. We compute probabilistically the degree of an equidimensional ideal.
Open AccessOn Bezout Inequalities for non-homogeneous Polynomial Ideals
We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators. We compute probabilistically the degree of an equidimensional ideal.
- Open Access
A decision method for the integrability of differential-algebraic Pfaffian systems
We prove an effective integrability criterion for differential-algebraic Pfaffian systems leading to a decision method of consistency with a triple exponential complexity bound. As a byproduct, we obtain an upper bound for the order of differentiations in the differential Nullstellensatz for these systems.
Open AccessA decision method for the integrability of differential-algebraic Pfaffian systems
We prove an effective integrability criterion for differential-algebraic Pfaffian systems leading to a decision method of consistency with a triple exponential complexity bound. As a byproduct, we obtain an upper bound for the order of differentiations in the differential Nullstellensatz for these systems.
- 23 October 2014
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 15 (1) , 159-184
Degeneracy Loci and Polynomial Equation Solving
- 23 October 2014
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 15 (1) , 159-184
Degeneracy Loci and Polynomial Equation Solving
- 1 May 2014
- Published by Elsevier in Journal of Algebra
- Vol. 406, 1-19
Effective differential Lüroth's theorem
- 1 May 2014
- Published by Elsevier in Journal of Algebra
- Vol. 406, 1-19
Effective differential Lüroth's theorem
- Open Access
Effective Differential Nullstellensatz for Ordinary DAE Systems with Constant Coefficients
We give upper bounds for the differential Nullstellensatz in the case of ordinary systems of differential algebraic equations over any field of constants $K$ of characteristic $0$. Let $\vec{x}$ be a set of $n$ differential variables, $\vec{f}$ a finite family of differential polynomials in the ring $K\{\vec{x}\}$ and $f\in K\{\vec{x}\}$ another polynomial which vanishes at every solution of the differential equation system $\vec{f}=0$ in any differentially closed field containing $K$. Let $d:=\max\{\deg(\vec{f}), \deg(f)\}$ and $\epsilon:=\max\{2,{\rm{ord}}(\vec{f}), {\rm{ord}}(f)\}$. We show that $f^M$ belongs to the algebraic ideal generated by the successive derivatives of $\vec{f}$ of order at most $L = (n\epsilon d)^{2^{c(n\epsilon)^3}}$, for a suitable universal constant $c>0$, and $M=d^{n(\epsilon +L+1)}$. The previously known bounds for $L$ and $M$ are not elementary recursive.Open AccessEffective Differential Nullstellensatz for Ordinary DAE Systems with Constant Coefficients
We give upper bounds for the differential Nullstellensatz in the case of ordinary systems of differential algebraic equations over any field of constants $K$ of characteristic $0$. Let $\vec{x}$ be a set of $n$ differential variables, $\vec{f}$ a finite family of differential polynomials in the ring $K\{\vec{x}\}$ and $f\in K\{\vec{x}\}$ another polynomial which vanishes at every solution of the differential equation system $\vec{f}=0$ in any differentially closed field containing $K$. Let $d:=\max\{\deg(\vec{f}), \deg(f)\}$ and $\epsilon:=\max\{2,{\rm{ord}}(\vec{f}), {\rm{ord}}(f)\}$. We show that $f^M$ belongs to the algebraic ideal generated by the successive derivatives of $\vec{f}$ of order at most $L = (n\epsilon d)^{2^{c(n\epsilon)^3}}$, for a suitable universal constant $c>0$, and $M=d^{n(\epsilon +L+1)}$. The previously known bounds for $L$ and $M$ are not elementary recursive. - Open Access
Degeneracy loci and polynomial equation solving
Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers $C$ and let $F$ be a $(p\times s)$-matrix of coordinate functions of $C[V]$, where $s\ge p+r$. The pair $(V,F)$ determines a vector bundle $E$ of rank $s-p$ over $W:=\{x\in V:\mathrm{rk} F(x)=p\}$. We associate with $(V,F)$ a descending chain of degeneracy loci of E (the generic polar varieties of $V$ represent a typical example of this situation). The maximal degree of these degeneracy loci constitutes the essential ingredient for the uniform, bounded error probabilistic pseudo-polynomial time algorithm which we are going to design and which solves a series of computational elimination problems that can be formulated in this framework. We describe applications to polynomial equation solving over the reals and to the computation of a generic fiber of a dominant endomorphism of an affine space.Open AccessDegeneracy loci and polynomial equation solving
Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers $C$ and let $F$ be a $(p\times s)$-matrix of coordinate functions of $C[V]$, where $s\ge p+r$. The pair $(V,F)$ determines a vector bundle $E$ of rank $s-p$ over $W:=\{x\in V:\mathrm{rk} F(x)=p\}$. We associate with $(V,F)$ a descending chain of degeneracy loci of E (the generic polar varieties of $V$ represent a typical example of this situation). The maximal degree of these degeneracy loci constitutes the essential ingredient for the uniform, bounded error probabilistic pseudo-polynomial time algorithm which we are going to design and which solves a series of computational elimination problems that can be formulated in this framework. We describe applications to polynomial equation solving over the reals and to the computation of a generic fiber of a dominant endomorphism of an affine space. - Open Access
Effective Differential Lüroth's Theorem
This paper focuses on effectivity aspects of the L\"uroth's theorem in differential fields. Let $\mathcal{F}$ be an ordinary differential field of characteristic 0 and $\mathcal{F}$ be the field of differential rational functions generated by a single indeterminate $u$. Let be given non constant rational functions $v_1,...,v_n\in \mathcal{F}$ generating a differential subfield $\mathcal{G}\subseteq \mathcal{F}$. The differential L\"uroth's theorem proved by Ritt in 1932 states that there exists $v\in \mathcal G$ such that $\mathcal{G}= \mathcal{F}$. Here we prove that the total order and degree of a generator $v$ are bounded by $\min_j \textrm{ord} (v_j)$ and $(nd(e+1)+1)^{2e+1}$, respectively, where $e:=\max_j \textrm{ord} (v_j)$ and $d:=\max_j \textrm{deg} (v_j)$. As a byproduct, our techniques enable us to compute a L\"uroth generator by dealing with a polynomial ideal in a polynomial ring in finitely many variables.Open AccessEffective Differential Lüroth's Theorem
This paper focuses on effectivity aspects of the L\"uroth's theorem in differential fields. Let $\mathcal{F}$ be an ordinary differential field of characteristic 0 and $\mathcal{F}$ be the field of differential rational functions generated by a single indeterminate $u$. Let be given non constant rational functions $v_1,...,v_n\in \mathcal{F}$ generating a differential subfield $\mathcal{G}\subseteq \mathcal{F}$. The differential L\"uroth's theorem proved by Ritt in 1932 states that there exists $v\in \mathcal G$ such that $\mathcal{G}= \mathcal{F}$. Here we prove that the total order and degree of a generator $v$ are bounded by $\min_j \textrm{ord} (v_j)$ and $(nd(e+1)+1)^{2e+1}$, respectively, where $e:=\max_j \textrm{ord} (v_j)$ and $d:=\max_j \textrm{deg} (v_j)$. As a byproduct, our techniques enable us to compute a L\"uroth generator by dealing with a polynomial ideal in a polynomial ring in finitely many variables.