Nearly optimal meshes in subanalytic sets
نویسندگان
چکیده
منابع مشابه
Rigid Subanalytic Sets
Let K be an algebraically closed field endowed with a complete non-archimedean norm. Let f : Y → X be a map of K-affinoid varieties. In this paper we study the analytic structure of the image f(Y ) ⊂ X; such an image is a typical example of a subanalytic set. We show that the subanalytic sets are precisely the D-semianalytic sets, where D is the truncated division function first introduced by D...
متن کاملOn the Normal Cycles of Subanalytic Sets
We present a short proof of the existence of the normal cycle of a compact subanalytic set. The approach is inspired by some old ides of Joseph Fu, uses Morse theoretic techniques and o-minimal topology.
متن کاملOne-Dimensional Fibers of Rigid Subanalytic Sets
Let K be an algebraically closed eld of any characteristic, complete with respect to the non-trivial ultrametric absolute value jj : K ! R +. By R denote the valuation ring of K, and by } its maximal ideal. We work within the class of subanalytic sets deened in L2], but our results here also hold for the strongly subanalytic sets introduced in S] as well as for those subanalytic sets considered...
متن کاملUniform Properties of Rigid Subanalytic Sets
In the context of rigid analytic spaces over a non-Archimedean valued field, a rigid subanalytic set is a Boolean combination of images of rigid analytic maps. We give an analytic quantifier elimination theorem for (complete) algebraically closed valued fields that is independent of the field; in particular, the analytic quantifier elimination is independent of the valued field’s characteristic...
متن کاملA Nearly Memory-Optimal Data Structure for Sets and Mappings
A novel, very memory-eÆcient hash table structure for representing a set of bit vectors | such as the set of reachable states of a system | is presented. Let the length of the bit vectors be w. There is an information-theoretic lower bound on the average memory consumption of any data structure that is capable of representing a set of at most n such bit vectors. We prove that, except in extreme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2012
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-012-9578-6