198 research outputs found
Tools in the orbit space approach to the study of invariant functions: rational parametrization of strata
Functions which are equivariant or invariant under the transformations of a
compact linear group acting in an euclidean space , can profitably
be studied as functions defined in the orbit space of the group. The orbit
space is the union of a finite set of strata, which are semialgebraic manifolds
formed by the -orbits with the same orbit-type. In this paper we provide a
simple recipe to obtain rational parametrizations of the strata. Our results
can be easily exploited, in many physical contexts where the study of
equivariant or invariant functions is important, for instance in the
determination of patterns of spontaneous symmetry breaking, in the analysis of
phase spaces and structural phase transitions (Landau theory), in equivariant
bifurcation theory, in crystal field theory and in most areas where use is made
of symmetry adapted functions.
A physically significant example of utilization of the recipe is given,
related to spontaneous polarization in chiral biaxial liquid crystals, where
the advantages with respect to previous heuristic approaches are shown.Comment: Figures generated through texdraw package; revised version appearing
in J. Phys. A: Math. Ge
Continuity argument revisited: geometry of root clustering via symmetric products
We study the spaces of polynomials stratified into the sets of polynomial
with fixed number of roots inside certain semialgebraic region , on its
border, and at the complement to its closure. Presented approach is a
generalisation, unification and development of several classical approaches to
stability problems in control theory: root clustering (-stability) developed
by R.E. Kalman, B.R. Barmish, S. Gutman et al., -decomposition(Yu.I.
Neimark, B.T. Polyak, E.N. Gryazina) and universal parameter space method(A.
Fam, J. Meditch, J.Ackermann).
Our approach is based on the interpretation of correspondence between roots
and coefficients of a polynomial as a symmetric product morphism.
We describe the topology of strata up to homotopy equivalence and, for many
important cases, up to homeomorphism. Adjacencies between strata are also
described. Moreover, we provide an explanation for the special position of
classical stability problems: Hurwitz stability, Schur stability,
hyperbolicity.Comment: 45 pages, 4 figure
CAD Adjacency Computation Using Validated Numerics
We present an algorithm for computation of cell adjacencies for well-based
cylindrical algebraic decomposition. Cell adjacency information can be used to
compute topological operations e.g. closure, boundary, connected components,
and topological properties e.g. homology groups. Other applications include
visualization and path planning. Our algorithm determines cell adjacency
information using validated numerical methods similar to those used in CAD
construction, thus computing CAD with adjacency information in time comparable
to that of computing CAD without adjacency information. We report on
implementation of the algorithm and present empirical data.Comment: 20 page
Algebraic Aspects of Conditional Independence and Graphical Models
This chapter of the forthcoming Handbook of Graphical Models contains an
overview of basic theorems and techniques from algebraic geometry and how they
can be applied to the study of conditional independence and graphical models.
It also introduces binomial ideals and some ideas from real algebraic geometry.
When random variables are discrete or Gaussian, tools from computational
algebraic geometry can be used to understand implications between conditional
independence statements. This is accomplished by computing primary
decompositions of conditional independence ideals. As examples the chapter
presents in detail the graphical model of a four cycle and the intersection
axiom, a certain implication of conditional independence statements. Another
important problem in the area is to determine all constraints on a graphical
model, for example, equations determined by trek separation. The full set of
equality constraints can be determined by computing the model's vanishing
ideal. The chapter illustrates these techniques and ideas with examples from
the literature and provides references for further reading.Comment: 20 pages, 1 figur
- …