Searcharxiv⌕ Search

arXiv subjects

Gleb Pogudin

Publications and source records attributed to Gleb Pogudin.

52 records · Page 3Linked to original sources
arXiv2020

Bounds for elimination of unknowns in systems of differential-algebraic equations

Elimination of unknowns in systems of equations, starting with Gaussian elimination, is a problem of general interest. The problem of finding an a priori upper bound for the number of differentiations in elimination of unknowns in a system of differential-algebraic equations (DAEs) is an important challenge, going back to Ritt (1932). The first characterization of this via an asymptotic analysis is due to Grigoriev's result (1989) on quantifier elimination in differential fields, but the challenge still remained. In this paper, we present a new bound, which is a major improvement over the previously known results. We also present a new lower bound, which shows asymptotic tightness of our upper bound in low dimensions, which are frequently occurring in applications. Finally, we discuss applications of our results to designing new algorithms for elimination of unknowns in systems of DAEs.

math.AC↗
arXiv2020

Solving difference equations in sequences: Universality and Undecidability

$ $We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference equations on grids (e.g., standard difference schemes) and difference equations in functions on words. On the universality side, we prove a version of strong Nullstellensatz for such difference equations under the assuption that the cardinality of the ground field is greater than the cardinality of the monoid and construct an example showing that this assumption cannot be omitted. On the undecidability side, we show that the following problems are undecidable: $\bullet$ testing radical difference ideal membership or, equivalently, determining whether a given difference polynomial vanishes on the solution set of a given system of difference polynomials; $\bullet$ determining consistency of a system of difference equations in the ring of real-valued sequences; $\bullet$ determining consistency of a system of equations with action of $\mathbb{Z}^2$, $\mathbb{N}^2$, or the free monoid with two generators in the corresponding ring of sequences over any field of characteristic zero.

math.AG↗
arXiv2019

The Dynamics of Canalizing Boolean Networks

Boolean networks are a popular modeling framework in computational biology to capture the dynamics of molecular networks, such as gene regulatory networks. It has been observed that many published models of such networks are defined by regulatory rules driving the dynamics that have certain so-called canalizing properties. In this paper, we investigate the dynamics of a random Boolean network with such properties using analytical methods and simulations. From our simulations, we observe that Boolean networks with higher canalizing depth have generally fewer attractors, the attractors are smaller, and the basins are larger, with implications for the stability and robustness of the models. These properties are relevant to many biological applications. Moreover, our results show that, from the standpoint of the attractor structure, high canalizing depth, compared to relatively small positive canalizing depth, has a very modest impact on dynamics. Motivated by these observations, we conduct mathematical study of the attractor structure of a random Boolean network of canalizing depth one (i.e., the smallest positive depth). For every positive integer $\ell$, we give an explicit formula for the limit of the expected number of attractors of length $\ell$ in an $n$-state random Boolean network as $n$ goes to infinity.

q-bio.MN↗
arXiv2019

Primitive Element Theorem for Fields with Commuting Derivations and Automorphisms

We establish a Primitive Element Theorem for fields equipped with several commuting operators such that each of the operators is either a derivation or an automorphism. More precisely, we show that for every extension $F \subset E$ of such fields of zero characteristic such that $\bullet$ $E$ is generated over $F$ by finitely many elements using the field operations and the operators, $\bullet$ every element of $E$ satisfies a nontrivial equation with coefficient in $F$ involving the field operations and the operators, $\bullet$ the action of the operators on $E$ is irredundant there exists an element $a \in E$ such that $E$ is generated over $F$ by $a$ using the field operations and the operators. This result generalizes the Primitive Element Theorems by Kolchin and Cohn in two directions simultaneously: we allow any numbers of derivations and automorphisms and do not impose any restrictions on the base field $F$.

math.AC↗
arXiv2019

Effective difference elimination and Nullstellensatz

We prove effective Nullstellensatz and elimination theorems for difference equations in sequence rings. More precisely, we compute an explicit function of geometric quantities associated to a system of difference equations (and these geometric quantities may themselves be bounded by a function of the number of variables, the order of the equations, and the degrees of the equations) so that for any system of difference equations in variables $\mathbf{x} = (x_1, \ldots, x_m)$ and $\mathbf{u} = (u_1, \ldots, u_r)$, if these equations have any nontrivial consequences in the $\mathbf{x}$ variables, then such a consequence may be seen algebraically considering transforms up to the order of our bound. Specializing to the case of $m = 0$, we obtain an effective method to test whether a given system of difference equations is consistent.

math.AG↗
arXiv2018

Elimination of unknowns for systems of algebraic differential-difference equations

We establish effective elimination theorems for differential-difference equations. Specifically, we find a computable function $B(r,s)$ of the natural number parameters $r$ and $s$ so that for any system of algebraic differential-difference equations in the variables $\mathbf{x} = x_1, \ldots, x_q$ and $\mathbf{y} = y_1, \ldots, y_r$ each of which has order and degree in $\mathbf{y}$ bounded by $s$ over a differential-difference field, there is a non-trivial consequence of this system involving just the $\mathbf{x}$ variables if and only if such a consequence may be constructed algebraically by applying no more than $B(r,s)$ iterations of the basic difference and derivation operators to the equations in the system. We relate this finiteness theorem to the problem of finding solutions to such systems of differential-difference equations in rings of functions showing that a system of differential-difference equations over $\mathbb{C}$ is algebraically consistent if and only if it has solutions in a certain ring of germs of meromorphic functions.

math.AC↗
arXiv2018

SIAN: software for structural identifiability analysis of ODE models

Biological processes are often modeled by ordinary differential equations with unknown parameters. The unknown parameters are usually estimated from experimental data. In some cases, due to the structure of the model, this estimation problem does not have a unique solution even in the case of continuous noise-free data. It is therefore desirable to check the uniqueness a priori before carrying out actual experiments. We present a new software SIAN (Structural Identifiability ANalyser) that does this. Our software can tackle problems that could not be tackled by previously developed packages.

cs.SC↗
arXiv2018

Products of Ideals and Jet Schemes

In the present paper, we give a full description of the jet schemes of the polynomial ideal $\left( x_1\ldots x_n \right) \in k[x_1, \ldots, x_n]$ over a field of zero characteristic. We use this description to answer questions about products and intersections of ideals emerged recently in algorithmic studies of algebraic differential equations.

math.AC↗
arXiv2018

Complexity of Triangular Representations of Algebraic Sets

Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.

math.AG↗
arXiv2018

Irredundant Triangular Decomposition

Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the variety it represents, and powerful randomized algorithms for computing triangular decompositions using Hensel lifting in the zero-dimensional case and for irreducible varieties. However, in the general case, most of the algorithms computing triangular decompositions produce embedded components, which makes it impossible to directly apply the intrinsic degree bounds. This, in turn, is an obstacle for efficiently applying Hensel lifting due to the higher degrees of the output polynomials and the lower probability of success. In this paper, we give an algorithm to compute an irredundant triangular decomposition of an arbitrary algebraic set $W$ defined by a set of polynomials in C[x_1, x_2, ..., x_n]. Using this irredundant triangular decomposition, we were able to give intrinsic degree bounds for the polynomials appearing in the triangular sets and apply Hensel lifting techniques. Our decomposition algorithm is randomized, and we analyze the probability of success.

math.AG↗
arXiv2018

A differential analog of the Noether normalization lemma

In this paper, we prove the following differential analog of the Noether normalization lemma: for every $d$-dimensional differential algebraic variety over differentially closed field of zero characteristic there exists a surjective map onto the $d$-dimensional affine space. Equivalently, for every integral differential algebra $A$ over differential field of zero characteristic there exist differentially independent $b_1, \ldots, b_d$ such that $A$ is differentially algebraic over subalgebra $B$ differentially generated by $b_1, \ldots, b_d$, and whenever $\mathfrak{p} \subset B$ is a prime differential ideal, there exists a prime differential ideal $\mathfrak{q} \subset A$ such that $\mathfrak{p} = B \cap \mathfrak{q}$. We also prove the analogous theorem for differential algebraic varieties over the ring of formal power series over an algebraically closed differential field and present some applications to differential equations.

math.RA↗
arXiv2017

Power series expansions for the planar monomer-dimer problem

We compute the free energy of the planar monomer-dimer model. Unlike the classical planar dimer model, an exact solution is not known in this case. Even the computation of the low-density power series expansion requires heavy and nontrivial computations. Despite of the exponential computational complexity, we compute almost three times more terms than were previously known. Such an expansion provides both lower and upper bound for the free energy, and allows to obtain more accurate numerical values than previously possible. We expect that our methods can be applied to other similar problems.

cs.SC↗
arXiv2017

Bounds for Substituting Algebraic Functions into D-finite Functions

It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis of removable singularities leads to an order-degree curve which is much more accurate than the order-degree curve obtained from the usual linear algebra reasoning.

cs.SC↗
arXiv2016

New order bounds in differential elimination algorithms

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential field of characteristic zero with an arbitrary number of commuting derivations. This decomposition can then be used to test for membership in the given radical differential ideal. In particular, this algorithm allows us to determine whether a system of polynomial PDEs is consistent. Previously, the only known order upper bound was given by Golubitsky, Kondratieva, Moreno Maza, and Ovchinnikov for the case of a single derivation. We achieve our bound by associating to the algorithm antichain sequences whose lengths can be bounded using the results of Leon Sanchez and Ovchinnikov.

math.AC↗
arXiv2014

Prime differential nilalgebra exists

We construct a monomorphism from the differential algebra $k\{x\} / [x^m]$ to a Grassmann algebra endowed with a structure of differential algebra. Using this monomorphism we prove primality of $k\{x\} / [x^m]$ and its algebra of differential polynomials, solve one of Ritt's problems and give a new proof of integrality of the ideal $[x^m]$.

math.RA↗