Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
Dupin Submanifolds In Lie Sphere Geometry (Updated Version), Thomas E. Cecil, Shiing-Shen Chern
Dupin Submanifolds In Lie Sphere Geometry (Updated Version), Thomas E. Cecil, Shiing-Shen Chern
Mathematics Department Faculty Scholarship
A hypersurface Mn-1 in Euclidean space En is proper Dupin if the number of distinct principal curvatures is constant on Mn-1, and each principal curvature function is constant along each leaf of its principal foliation. This paper was originally published in 1989 (see Comments below), and it develops a method for the local study of proper Dupin hypersurfaces in the context of Lie sphere geometry using moving frames. This method has been effective in obtaining several classification theorems of proper Dupin hypersurfaces since that time. This updated version of the paper contains the original exposition together …
Algorithms To Compute Characteristic Classes, Martin Helmer
Algorithms To Compute Characteristic Classes, Martin Helmer
Electronic Thesis and Dissertation Repository
In this thesis we develop several new algorithms to compute characteristics classes in a variety of settings. In addition to algorithms for the computation of the Euler characteristic, a classical topological invariant, we also give algorithms to compute the Segre class and Chern-Schwartz-MacPherson (CSM) class. These invariants can in turn be used to compute other common invariants such as the Chern-Fulton class (or the Chern class in smooth cases).
We begin with subschemes of a projective space over an algebraically closed field of characteristic zero. In this setting we give effective algorithms to compute the CSM class, Segre class and …
Codes Over Rings From Curves Of Higher Genus, José Felipe Voloch, Judy L. Walker
Codes Over Rings From Curves Of Higher Genus, José Felipe Voloch, Judy L. Walker
Department of Mathematics: Faculty Publications
We construct certain error-correcting codes over finite rings and estimate their parameters. These codes are constructed using plane curves and the estimates for their parameters rely on constructing “lifts” of these curves and then estimating the size of certain exponential sums.
THE purpose of this paper is to construct certain error-correcting codes over finite rings and estimate their parameters. For this purpose, we need to develop some tools; notably, an estimate for the dimension of trace codes over rings (generalizing work of van der Vlugt over fields and some results on lifts of affin curves from field of characteristic p …