14,840 research outputs found
Cell decomposition for semi-affine structures on p-adic fields
We use cell decomposition techniques to study additive reducts of p- adic
fields. We consider a very general class of fields, including fields with
infinite residue fields, which we study using a multi-sorted language. The
results are used to obtain cell decomposition results for the case of finite
residue fields. We do not require fields to be Henselian, and we allow them to
be of any characteristic.Comment: 22 page
Definable equivalence relations and zeta functions of groups
We prove that the theory of the -adics admits elimination
of imaginaries provided we add a sort for for each . We also prove that the elimination of
imaginaries is uniform in . Using -adic and motivic integration, we
deduce the uniform rationality of certain formal zeta functions arising from
definable equivalence relations. This also yields analogous results for
definable equivalence relations over local fields of positive characteristic.
The appendix contains an alternative proof, using cell decomposition, of the
rationality (for fixed ) of these formal zeta functions that extends to the
subanalytic context.
As an application, we prove rationality and uniformity results for zeta
functions obtained by counting twist isomorphism classes of irreducible
representations of finitely generated nilpotent groups; these are analogous to
similar results of Grunewald, Segal and Smith and of du Sautoy and Grunewald
for subgroup zeta functions of finitely generated nilpotent groups.Comment: 89 pages. Various corrections and changes. To appear in J. Eur. Math.
So
An example of a -minimal structure without definable Skolem functions
We show there are intermediate -minimal structures between the
semi-algebraic and sub-analytic languages which do not have definable Skolem
functions. As a consequence, by a result of Mourgues, this shows there are
-minimal structures which do not admit classical cell decomposition.Comment: 9 pages, (added missing grant acknowledgement
Symmetry Breaking for Answer Set Programming
In the context of answer set programming, this work investigates symmetry
detection and symmetry breaking to eliminate symmetric parts of the search
space and, thereby, simplify the solution process. We contribute a reduction of
symmetry detection to a graph automorphism problem which allows to extract
symmetries of a logic program from the symmetries of the constructed coloured
graph. We also propose an encoding of symmetry-breaking constraints in terms of
permutation cycles and use only generators in this process which implicitly
represent symmetries and always with exponential compression. These ideas are
formulated as preprocessing and implemented in a completely automated flow that
first detects symmetries from a given answer set program, adds
symmetry-breaking constraints, and can be applied to any existing answer set
solver. We demonstrate computational impact on benchmarks versus direct
application of the solver.
Furthermore, we explore symmetry breaking for answer set programming in two
domains: first, constraint answer set programming as a novel approach to
represent and solve constraint satisfaction problems, and second, distributed
nonmonotonic multi-context systems. In particular, we formulate a
translation-based approach to constraint answer set solving which allows for
the application of our symmetry detection and symmetry breaking methods. To
compare their performance with a-priori symmetry breaking techniques, we also
contribute a decomposition of the global value precedence constraint that
enforces domain consistency on the original constraint via the unit-propagation
of an answer set solver. We evaluate both options in an empirical analysis. In
the context of distributed nonmonotonic multi-context system, we develop an
algorithm for distributed symmetry detection and also carry over
symmetry-breaking constraints for distributed answer set programming.Comment: Diploma thesis. Vienna University of Technology, August 201
Polynomial Optimization with Applications to Stability Analysis and Control - Alternatives to Sum of Squares
In this paper, we explore the merits of various algorithms for polynomial
optimization problems, focusing on alternatives to sum of squares programming.
While we refer to advantages and disadvantages of Quantifier Elimination,
Reformulation Linear Techniques, Blossoming and Groebner basis methods, our
main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and
Handelman's theorem. We first formulate polynomial optimization problems as
verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's
algorithm, Bernstein's algorithm and Handelman's algorithm reduce the
intractable problem of feasibility of semi-algebraic sets to linear and/or
semi-definite programming. We apply these algorithms to different problems in
robust stability analysis and stability of nonlinear dynamical systems. As one
contribution of this paper, we apply Polya's algorithm to the problem of
H_infinity control of systems with parametric uncertainty. Numerical examples
are provided to compare the accuracy of these algorithms with other polynomial
optimization algorithms in the literature.Comment: AIMS Journal of Discrete and Continuous Dynamical Systems - Series
- …