7,942 research outputs found
Determinantal sets, singularities and application to optimal control in medical imagery
Control theory has recently been involved in the field of nuclear magnetic
resonance imagery. The goal is to control the magnetic field optimally in order
to improve the contrast between two biological matters on the pictures.
Geometric optimal control leads us here to analyze mero-morphic vector fields
depending upon physical parameters , and having their singularities defined by
a deter-minantal variety. The involved matrix has polynomial entries with
respect to both the state variables and the parameters. Taking into account the
physical constraints of the problem, one needs to classify, with respect to the
parameters, the number of real singularities lying in some prescribed
semi-algebraic set. We develop a dedicated algorithm for real root
classification of the singularities of the rank defects of a polynomial matrix,
cut with a given semi-algebraic set. The algorithm works under some genericity
assumptions which are easy to check. These assumptions are not so restrictive
and are satisfied in the aforementioned application. As more general strategies
for real root classification do, our algorithm needs to compute the critical
loci of some maps, intersections with the boundary of the semi-algebraic
domain, etc. In order to compute these objects, the determinantal structure is
exploited through a stratifi-cation by the rank of the polynomial matrix. This
speeds up the computations by a factor 100. Furthermore, our implementation is
able to solve the application in medical imagery, which was out of reach of
more general algorithms for real root classification. For instance,
computational results show that the contrast problem where one of the matters
is water is partitioned into three distinct classes
On Termination of Integer Linear Loops
A fundamental problem in program verification concerns the termination of
simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x
is a vector of variables, u, a, and c are integer vectors, and A and B are
integer matrices. Assuming the matrix A is diagonalisable, we give a decision
procedure for the problem of whether, for all initial integer vectors u, such a
loop terminates. The correctness of our algorithm relies on sophisticated tools
from algebraic and analytic number theory, Diophantine geometry, and real
algebraic geometry. To the best of our knowledge, this is the first substantial
advance on a 10-year-old open problem of Tiwari (2004) and Braverman (2006).Comment: Accepted to SODA1
Definable transformation to normal crossings over Henselian fields with separated analytic structure
We are concerned with rigid analytic geometry in the general setting of
Henselian fields with separated analytic structure, whose theory was
developed by Cluckers--Lipshitz--Robinson. It unifies earlier work and
approaches of numerous mathematicians. Separated analytic structures admit
reasonable relative quantifier elimination in a suitable analytic language.
However, the rings of global analytic functions with two kinds of variables
seem not to have good algebraic properties such as Noetherianity or excellence.
Therefore the usual global resolution of singularities from rigid analytic
geometry is no longer at our disposal. Our main purpose is to give a definable
version of the canonical desingularization algorithm (the hypersurface case)
due to Bierstone--Milman so that both these powerful tools are available in the
realm of non-Archimedean analytic geometry at the same time. It will be carried
out within a category of definable, strong analytic manifolds and maps, which
is more flexible than that of affinoid varieties and maps. Strong analytic
objects are those definable ones that remain analytic over all fields
elementarily equivalent to . This condition may be regarded as a kind of
symmetry imposed on ordinary analytic objects. The strong analytic category
makes it possible to apply a model-theoretic compactness argument in the
absence of the ordinary topological compactness. On the other hand, our
closedness theorem enables application of resolution of singularities to
topological problems involving the topology induced by valuation. Eventually,
these three results will be applied to such issues as the existence of
definable retractions or extending continuous definable functions.Comment: This is the final version published in the journal Symmetry-Basel,
2019, 11, 93
Algorithmic Algebraic Geometry and Flux Vacua
We develop a new and efficient method to systematically analyse four
dimensional effective supergravities which descend from flux compactifications.
The issue of finding vacua of such systems, both supersymmetric and
non-supersymmetric, is mapped into a problem in computational algebraic
geometry. Using recent developments in computer algebra, the problem can then
be rapidly dealt with in a completely algorithmic fashion. Two main results are
(1) a procedure for calculating constraints which the flux parameters must
satisfy in these models if any given type of vacuum is to exist; (2) a stepwise
process for finding all of the isolated vacua of such systems and their
physical properties. We illustrate our discussion with several concrete
examples, some of which have eluded conventional methods so far.Comment: 41 pages, 4 figure
Lower Bounds on Complexity of Lyapunov Functions for Switched Linear Systems
We show that for any positive integer , there are families of switched
linear systems---in fixed dimension and defined by two matrices only---that are
stable under arbitrary switching but do not admit (i) a polynomial Lyapunov
function of degree , or (ii) a polytopic Lyapunov function with facets, or (iii) a piecewise quadratic Lyapunov function with
pieces. This implies that there cannot be an upper bound on the size of the
linear and semidefinite programs that search for such stability certificates.
Several constructive and non-constructive arguments are presented which connect
our problem to known (and rather classical) results in the literature regarding
the finiteness conjecture, undecidability, and non-algebraicity of the joint
spectral radius. In particular, we show that existence of an extremal piecewise
algebraic Lyapunov function implies the finiteness property of the optimal
product, generalizing a result of Lagarias and Wang. As a corollary, we prove
that the finiteness property holds for sets of matrices with an extremal
Lyapunov function belonging to some of the most popular function classes in
controls
Report on some recent advances in Diophantine approximation
A basic question of Diophantine approximation, which is the first issue we
discuss, is to investigate the rational approximations to a single real number.
Next, we consider the algebraic or polynomial approximations to a single
complex number, as well as the simultaneous approximation of powers of a real
number by rational numbers with the same denominator. Finally we study
generalisations of these questions to higher dimensions. Several recent
advances have been made by B. Adamczewski, Y. Bugeaud, S. Fischler, M. Laurent,
T. Rivoal, D. Roy and W.M. Schmidt, among others. We review some of these
works.Comment: to be published by Springer Verlag, Special volume in honor of Serge
Lang, ed. Dorian Goldfeld, Jay Jorgensen, Dinakar Ramakrishnan, Ken Ribet and
John Tat
A clever elimination strategy for efficient minimal solvers
We present a new insight into the systematic generation of minimal solvers in
computer vision, which leads to smaller and faster solvers. Many minimal
problem formulations are coupled sets of linear and polynomial equations where
image measurements enter the linear equations only. We show that it is useful
to solve such systems by first eliminating all the unknowns that do not appear
in the linear equations and then extending solutions to the rest of unknowns.
This can be generalized to fully non-linear systems by linearization via
lifting. We demonstrate that this approach leads to more efficient solvers in
three problems of partially calibrated relative camera pose computation with
unknown focal length and/or radial distortion. Our approach also generates new
interesting constraints on the fundamental matrices of partially calibrated
cameras, which were not known before.Comment: 13 pages, 7 figure
The Polyhedron-Hitting Problem
We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC
'80 and JACM '86)---determining whether a target polyhedron V may be reached
from a starting point x under repeated applications of a linear transformation
A in an ambient vector space Q^m. In the context of program verification, very
similar reachability questions were also considered and left open by Lee and
Yannakakis in (STOC '92). We present what amounts to a complete
characterisation of the decidability landscape for the Polyhedron-Hitting
Problem, expressed as a function of the dimension m of the ambient space,
together with the dimension of the polyhedral target V: more precisely, for
each pair of dimensions, we either establish decidability, or show hardness for
longstanding number-theoretic open problems
- …