منابع مشابه
Tame Flows
The tame flows are “nice” flows on “nice” spaces. The nice (tame) sets are the pfaffian sets introduced by Khovanski, and a flow Φ : R×X → X on pfaffian set X is tame if the graph of Φ is a pfaffian subset of R×X×X . Any compact tame set admits plenty tame flows. We prove that the flow determined by the gradient of a generic real analytic function with respect to a generic real analytic metric ...
متن کاملTame structures
We study various notions of “tameness” for definably complete expansions of ordered fields. We mainly study structures with locally o-minimal open core, d-minimal structures, and dense pairs of d-minimal structures.
متن کاملTame Mappings Are Semismooth
Superlinear convergence of the Newton method for nonsmooth equations requires a “semismoothness” assumption. In this work we prove that locally Lipschitz functions definable in an o-minimal structure (in particular semialgebraic or globally subanalytic functions) are semismooth. Semialgebraic, or more generally, globally subanalytic mappings present the special interest of being γ-order semismo...
متن کاملCharacteristics of common pheasant ( Phasianus colchicus ) meat
1 Dept. of Meat Science, Faculty of Food Science and Fisheries, West Pomeranian University of Technology, Szczecin, Poland 2 Center of Bioimmobilization and Innovative Packaging Materials, Faculty of Food Science and Fisheries, West Pomeranian University of Technology, Szczecin, Poland 3 Division of Sciences of Commoditives and Food Quality, Faculty of Food Science and Fisheries, West Pomerania...
متن کاملFlyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales’ proof of the Kepler Conjecture and confirm the completeness of Hales’ list of all tame graphs while reducing it from 5128 to 2771 graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Blue Jay
سال: 1951
ISSN: 2562-5667,0006-5099
DOI: 10.29173/bluejay1162