Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 73 for “"n-space"”.

  1. Euclidean N-space

    This study of the Euclidean N-space looks at some definitions and their characteristics, some comparisons, boundedness and compactness, and transformations and mappings.

    unt Repository record for Euclidean N-space (opens in a new tab)

  2. Circumscribing Cubes of Hyperellipsoids in Euclidean N-Space

    Made available in DSpace on 2014-12-09T22:17:24Z (GMT). No. of bitstreams: 1 6511880.pdf: 1107951 bytes, checksum: 1f000c95d5d6f1567638c683a101cd85 (MD5) Previous issue date: 1965

    uiuc Repository record for Circumscribing Cubes of Hyperellipsoids in Euclidean N-Space (opens in a new tab)

  3. Tame, Finite Complexes in Three-Space

    … A fundamental problem in topology of Euclidean n-space is to determine under what conditions two homeomorphic subsets of an n-space are strongly homeomorphic; that is, to determine when one can be carried onto the other by homeomorphism of space onto itself. This problem is of particular …

    utk-theses Repository record for Tame, Finite Complexes in Three-Space (opens in a new tab)

  4. A KLEINIAN APPROACH TO FUNDAMENTAL REGIONS

    … We will explore two models of hyperbolic $n$-space: $U^n$ and $B^n$. Points, lines, distances, and spheres of these two models will be defined and examples in $U^2$, $U^3$, and $B^2$ will be given. We will then discuss the isometries of $U^n$ and $B^n$. These isometries, known as M\"obius …

    csusb Repository record for A KLEINIAN APPROACH TO FUNDAMENTAL REGIONS (opens in a new tab)

  5. Intersecting red and blue line segments in optimal time and precision

    … of segments in O(n log n + k) time and O(n) space, where n is the total number of segments, and k is the number of intersection points. With a small modification, we are able to count intersections in O(n log n) time and O(n) space. Using only degree two predicates, we are also able to …

    ubc Repository record for Intersecting red and blue line segments in optimal time and precision (opens in a new tab) Download PDF for Intersecting red and blue line segments in optimal time and precision (opens in a new tab)

  6. Stokes' Theorem: Calculus of Differential Forms

    … fields of mathematics in relation to Euclidean n-space. It defines the meanings of differentiation for functions between these spaces and gives an exposition of the inverse function theorem. One also finds the definition for integration of real valued function defined on a Euclidean n-space. These …

    texas-state Repository record for Stokes' Theorem: Calculus of Differential Forms (opens in a new tab)

  7. On a Taylor expansion for a mean value of a function over a sphere

    … a function over the surface of a sphere in three-space and, then, generalize the method used in three-space to derive analogous expansions in two-space and n-space.</p><p>We initially consider some basic mean value theorems which are derived from Green's identities. The development, in Chapter II, …

    ut-knoxville Repository record for On a Taylor expansion for a mean value of a function over a sphere (opens in a new tab)

  8. A survey of some problems in affine algebraic geometry

    … What are the automorphisms of the affine n-space An? Given m < n, is there a unique way (up to automorphisms of An) to embed Am in A n?

    ottawa-retro Repository record for A survey of some problems in affine algebraic geometry (opens in a new tab)

  9. Self-stabilizing k-clustering in mobile ad hoc networks

    … FLOOD, takes O( k) time and uses O(k log n) space per process, while the second algorithm, BFS-MIS-CLSTR, takes O(n) time and uses O(log n) space; where n is the size of the network. Processes have unique IDs, and there is no designated leader. BFS-MIS-CLSTR solves three problems; it elects a …

    unlv Repository record for Self-stabilizing k-clustering in mobile ad hoc networks (opens in a new tab) Download PDF for Self-stabilizing k-clustering in mobile ad hoc networks (opens in a new tab)

  10. Adaptive Range Counting and Other Frequency-Based Range Query Problems

    … data structure that requires O(n loglog n) space and O(loglog n + log_w k) query time. Non-adaptive data structures on the other hand require Ω(log_w n) query time (Pătraşcu, 2007). Our specific bounds are interesting for two reasons. First, when k=O(1), our bounds match the state of the art …

    waterloo Repository record for Adaptive Range Counting and Other Frequency-Based Range Query Problems (opens in a new tab)

  11. The Model Theory of Algebraically Closed Fields

    … properties of algebraic subsets of complex n-space. The constructible subsets are precisely the first order definable subsets, and varieties correspond to maximal consistent collections of formulas, called types. Moreover, the topological dimension of a constructible set is equal to the Morley …

    waterloo Repository record for The Model Theory of Algebraically Closed Fields (opens in a new tab)

  12. On Sets and Functions in a Metric Space

    … is to study some of the properties of metric spaces. An effort is made to show that many of the properties of a metric space are generalized properties of R, the set of real numbers, or Euclidean n--space, and are specific cases of the properties of a general topological space.

    unt Repository record for On Sets and Functions in a Metric Space (opens in a new tab)

  13. On Lane's Integral

    … this paper is to develop Lane's Integral in two-space, and then to expand these concepts into three-space and n-space. Lane's Integral can be used by both mathematicians and statisticians as one of the tools in the calculation of certain probabilities and expectations. The method of presentation …

    unt Repository record for On Lane's Integral (opens in a new tab)

  14. Time and space tradeoffs in point location

    … in O(n√log n) time and store them in O(n/t) space to facilitate point location in O(log t) time, where t is an adjustable parameter. When t is a constant we get O(n) space and constant time. When t = O(n) we get constant space and O(log n) time.

    umkc Repository record for Time and space tradeoffs in point location (opens in a new tab)

  15. CONJECTURES REGARDING COMPACT CONNECTED 2-DIMENSIONAL TOPOLOGICAL LATTICES

    … to in this paper.Various subsets of Euclidean n-space serve as examples of topological lattices having (or not having) certain topological and/or algebraic properties.The question arises - given a topological lattice having properties P,...,P, can that lattice be identified as some well-known …

    nebraska Repository record for CONJECTURES REGARDING COMPACT CONNECTED 2-DIMENSIONAL TOPOLOGICAL LATTICES (opens in a new tab)

  16. Conformal Differential Geometry

    … in the conformal plane, then in conformal 3-space, and finally in conformal n-space. It is comprised of most of the research on this subject which has been carried on to date by Professors N.D. Lane and Peter Scherk. I have assisted Dr. Lane in the creation of some of the material which this …

    mcmaster Repository record for Conformal Differential Geometry (opens in a new tab)

  17. Simplicial Homology

    … thesis begins with hyperplanes in Euclidean n-space. Simplexes and complexes are defined, and orientations are given to each simplex of a complex. The chains of a complex are defined, and each chain is assigned a boundary. The function which assigns to each chain a boundary defines the set of …

    unt Repository record for Simplicial Homology (opens in a new tab)

Page 1 of 4