Library

X
Your search history is empty.
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1995-1999  (2)
  • Polyactive™  (1)
  • discrete valuation ring  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Models of Curves and Finite Covers (1999)
    Springer
    Compositio mathematica 118 (1999), S. 61-102 
    Details
    ISSN: 1570-5846
    Keywords: branch locus ; covers ; curves ; discrete valuation ring ; models ; semi-stable ; simultaneous resolution.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let K be a discrete valuation field with ring of integers O K .Letf : X ! Y be a finite morphism of curves over K. In this article, we study some possible relationships between the models over O K of X and of Y. Three such relationships are listed below. Consider a Galois cover f : X ! Y of degree prime to the characteristic of the residue field, with branch locus B. We show that if Y has semi-stable reduction over K,thenX achieves semi-stable reduction over some explicit tame extension of K.B/.WhenK is strictly henselian, we determine the minimal extension L=K with the property that X L has semi-stable reduction. Let f : X ! Y be a finite morphism, with g.Y/ 〉 2. We show that if X has a stable model X over O K ,thenY has a stable model Y over O K , and the morphism f extends to a morphism X ! Y. ! Y. Finally, given any finite morphism f : X ! Y, is it possible to choose suitable regular models X and Y of X and Y over O K such that f extends to a finite morphism X ! Y ?As wasshown by Abhyankar, the answer is negative in general. We present counterexamples in rather general situ-ations, with f a cyclic cover of any order 〉 4. On the other hand, we prove, without any hypotheses on the residual characteristic, that this extension problem has a positive solution when f is cyclic of order 2 or 3.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1001141725199
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Composite biomaterials with chemical bonding between hydroxyapatite filler particles and PEG/PBT copolymer matrix (1998)
    Hoboken, NJ : Wiley-Blackwell
    Journal of Biomedical Materials Research 40 (1998), S. 490-497 
    Details
    ISSN: 0021-9304
    Keywords: hydroxyapatite ; Polyactive™ ; composites ; interface ; mechanical properties ; surface grafting ; coupling agent ; diisocyanate ; Chemistry ; Polymer and Materials Science
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Medicine , Technology
    Notes: In an effort to make composites from hydroxyapatite and a PEG/PBT copolymer (Polyactive™ 70/30), chemical linkages were introduced between the filler particles and polymer matrix using hexamethylene diisocyanate as a coupling agent. Infrared spectra (IR) and thermal gravimetric analysis (TGA) confirmed the presence of Polyactive™ 70/30 on the surface of HA filler particles. The amount of chemically bound polymer was 4.7 wt.%, as determined by TGA. The mechanical properties of the composites, that is, tensile strength and Young's modulus, were improved significantly by the introduction of a chemical linkage between the filler particles and polymer matrix compared to control composites. This method provides an effective way to introduce chemical linkage between HA filler particles and a polymer matrix. By optimizing the grafting process, a further improvement of the mechanical properties in the composites can be expected. © 1998 John Wiley & Sons, Inc. J Biomed Mater Res, 40, 490-497, 1998.
    Additional Material: 10 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...