49,017 research outputs found
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 of characteristic . Let be a set of differential
variables, a finite family of differential polynomials in the ring
and another polynomial which vanishes at
every solution of the differential equation system in any
differentially closed field containing . Let and . We
show that belongs to the algebraic ideal generated by the successive
derivatives of of order at most , for a suitable universal constant , and
. The previously known bounds for and are not
elementary recursive
Singular value decay of operator-valued differential Lyapunov and Riccati equations
We consider operator-valued differential Lyapunov and Riccati equations,
where the operators and may be relatively unbounded with respect to
(in the standard notation). In this setting, we prove that the singular values
of the solutions decay fast under certain conditions. In fact, the decay is
exponential in the negative square root if generates an analytic semigroup
and the range of has finite dimension. This extends previous similar
results for algebraic equations to the differential case. When the initial
condition is zero, we also show that the singular values converge to zero as
time goes to zero, with a certain rate that depends on the degree of
unboundedness of . A fast decay of the singular values corresponds to a low
numerical rank, which is a critical feature in large-scale applications. The
results reported here provide a theoretical foundation for the observation
that, in practice, a low-rank factorization usually exists.Comment: Corrected some misconceptions, which lead to more general results
(e.g. exponential stability is no longer required). Also fixed some
off-by-one errors, improved the presentation, and added/extended several
remarks on possible generalizations. Now 22 pages, 8 figure
On the Complexity of Solving Quadratic Boolean Systems
A fundamental problem in computer science is to find all the common zeroes of
quadratic polynomials in unknowns over . The
cryptanalysis of several modern ciphers reduces to this problem. Up to now, the
best complexity bound was reached by an exhaustive search in
operations. We give an algorithm that reduces the problem to a combination of
exhaustive search and sparse linear algebra. This algorithm has several
variants depending on the method used for the linear algebra step. Under
precise algebraic assumptions on the input system, we show that the
deterministic variant of our algorithm has complexity bounded by
when , while a probabilistic variant of the Las Vegas type
has expected complexity . Experiments on random systems show
that the algebraic assumptions are satisfied with probability very close to~1.
We also give a rough estimate for the actual threshold between our method and
exhaustive search, which is as low as~200, and thus very relevant for
cryptographic applications.Comment: 25 page
- …