• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 16
  • 14
  • 4
  • 2
  • 1
  • 1
  • Tagged with
  • 44
  • 44
  • 17
  • 14
  • 12
  • 9
  • 9
  • 9
  • 8
  • 8
  • 8
  • 7
  • 7
  • 7
  • 6
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Curves over finite fields

Voloch, J. F. January 1985 (has links)
No description available.
2

De loco geometrico centri lineae rectae definitae cuiusdam longitudinis cuius termini in peripheria lineae secundi ordinis moventur ...

Steiner, Johann August Moritz, January 1900 (has links)
Diss.--Breslau (H. Dittrich, A. Koch, and M. Jacobi, respondents). / Title vignette.
3

The behavior of the Hessian at a multiple point of a curve

Case, James Edward, January 1938 (has links)
Thesis (Ph. D.)--University of Chicago, 1936. / Vita. Lithoprinted. "Private edition, distributed by the University of Chicago libraries, Chicago, Illinois." Includes bibliographical references (p. 30).
4

On vector bundles over algebraic and arithmetic curves

Hoffmann, Norbert. January 2002 (has links)
Thesis (Dr. rer. nat.)--Rheinische Friedrich-Wilhelms-Universität Bonn, 2002. / Includes bibliographical references (p. 49-50).
5

Harmonic interpolation for smooth curves and surfaces.

Hardy, Alexandre 07 December 2007 (has links)
The creation of smooth interpolating curves and surfaces is an important aspect of computer graphics. Trigonometric interpolation in the form of the Fourier transform has been a popular technique. For computer graphics, simpler curves and surfaces like the B´ezier curve and B-spline curve have been more popular due to the computational efficiency. Fitting B-spline or B´ezier curves or surfaces to unorganised data points has been more challenging since these curves are not naturally interpolating. Normally a system of equations needs to be solved to obtain the curves or surfaces with the added problem of identifying data points to form piecewise continuous surfaces. We solve the problem of periodic interpolating curves and surfaces using harmonic interpolation [73]. We extend harmonic interpolation to handle an even number of data points. We then show how harmonic interpolation can be applied using geometry images [29] to create smooth interpolating surfaces. We introduce algorithms to manipulate the amount of interpolated points, and the location of the interpolated points. Finally, we show how a smooth interpolating surface created by harmonic interpolation can be converted to a series of B´ezier surfaces. The combination of techniques allows us to quickly create a smooth interpolating surface from a set of unorganised points that have a known spherical structure. Keywords: Interpolation, harmonic interpolation, trigonometric interpolation, B´ezier curves surface fitting, tensor product surfaces. / Prof. W.F. Steeb
6

Discrete analogues of Kakeya problems

Iliopoulou, Marina January 2013 (has links)
This thesis investigates two problems that are discrete analogues of two harmonic analytic problems which lie in the heart of research in the field. More specifically, we consider discrete analogues of the maximal Kakeya operator conjecture and of the recently solved endpoint multilinear Kakeya problem, by effectively shrinking the tubes involved in these problems to lines, thus giving rise to the problems of counting joints and multijoints with multiplicities. In fact, we effectively show that, in R3, what we expect to hold due to the maximal Kakeya operator conjecture, as well as what we know in the continuous case due to the endpoint multilinear Kakeya theorem by Guth, still hold in the discrete case. In particular, let L be a collection of L lines in R3 and J the set of joints formed by L, that is, the set of points each of which lies in at least three non-coplanar lines of L. It is known that |J| = O(L3/2) ( first proved by Guth and Katz). For each joint x ∈ J, let the multiplicity N(x) of x be the number of triples of non-coplanar lines through x. We prove here that X x2J N(x)1=2 = O(L3=2); while we also extend this result to real algebraic curves in R3 of uniformly bounded degree, as well as to curves in R3 parametrized by real univariate polynomials of uniformly bounded degree. The multijoints problem is a variant of the joints problem, involving three finite collections of lines in R3; a multijoint formed by them is a point that lies in (at least) three non-coplanar lines, one from each collection. We finally present some results regarding the joints problem in different field settings and higher dimensions.
7

On the number of nodal domains of spherical harmonics

Leydold, Josef January 1993 (has links) (PDF)
It is well known that the n-th eigenfunction to one-dimensional Sturm-Liouville eigenvalue problems has exactly n-1 nodes, i.e. non-degenerate zeros. For higher dimensions, it is much more complicated to obtain general statements on the zeros of eigenfunctions. The author states a new conjecture on the number of nodal domains of spherical harmonics, i.e. of connected components of S^2 \ N(u) with the nodal set N(u) = (x in S^2 : u(x) = 0) of the eigenfunction u, and proves it for the first six eigenvalues. It is a sharp upper bound, thus improving known bounds as the Courant nodal domain theorem, see S. Y. Cheng, Comment. Math. Helv. 51, 43-55 (1976; Zbl 334.35022). The proof uses facts on real projective plane algebraic curves (see D. A. Gudkov, Usp. Mat. Nauk 29(4), 3-79, Russian Math. Surveys 29(4), 1-79 (1979; Zbl 316.14018)), because they are the zero sets of homogeneous polynomials, and the spherical harmonics are the restrictions of spherical harmonic homogeneous polynomials in the space to the plane. / Series: Preprint Series / Department of Applied Statistics and Data Processing
8

Hypergeometric functions over finite fields and their relations to algebraic curves.

Vega Veglio, Maria V. 2009 May 1900 (has links)
Classical hypergeometric functions and their relations to counting points on curves over finite fields have been investigated by mathematicians since the beginnings of 1900. In the mid 1980s, John Greene developed the theory of hypergeometric functions over finite fi elds. He explored the properties of these functions and found that they satisfy many summation and transformation formulas analogous to those satisfi ed by the classical functions. These similarities generated interest in finding connections that hypergeometric functions over finite fields may have with other objects. In recent years, connections between these functions and elliptic curves and other Calabi-Yau varieties have been investigated by mathematicians such as Ahlgren, Frechette, Fuselier, Koike, Ono and Papanikolas. A survey of these results is given at the beginning of this dissertation. We then introduce hypergeometric functions over finite fi elds and some of their properties. Next, we focus our attention on a particular family of curves and give an explicit relationship between the number of points on this family over Fq and sums of values of certain hypergeometric functions over Fq. Moreover, we show that these hypergeometric functions can be explicitly related to the roots of the zeta function of the curve over Fq in some particular cases. Based on numerical computations, we are able to state a conjecture relating these values in a more general setting, and advances toward the proof of this result are shown in the last chapter of this dissertation. We nish by giving various avenues for future study.
9

Some stable degenerations and applications to moduli /

Van Opstall, Michael A., January 2004 (has links)
Thesis (Ph. D.)--University of Washington, 2004. / Vita. Includes bibliographical references (p. 44-48).
10

On the algebraic limit cycles of quadratic systems

Sorolla Bardají, Jordi 17 May 2005 (has links)
No description available.

Page generated in 0.0329 seconds