Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons

Size: px
Start display at page:

Download "Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons"

Transcription

1 Minicourse II Symplectic Monte Carlo Methods for Random Equilateral Polygons Jason Cantarella and Clayton Shonkwiler University of Georgia Georgia Topology Conference July 9, 2013

2 Basic Definitions Symplectic Structure Connections Conclusion Summary of the Constructions Summary of Tom Needham s Talk The fixed edgelength polygon space Pol(n; r) is symplectic. M n 2 (C) V 2 (C n )=µ 1 U(2) (0) //U(2) = proj. µ 1 U(1) n (r) = j S3 rj //U(1) n =Hopf Gr 2 (C n ) µ 1 U(1) n (r) //U(1) n µ 1 SO(3) (0) j S2 r j //SO(3) Pol r (n) Tom Needham Symplectic Structures of Polygon Spaces

3 Basic Definitions Symplectic Structure Summary Connections of Tom Needham s Talk II Conclusion Summary of the Constructions Pol(n; r) s symplectic volume is the standard measure. M n 2 (C) V 2 (C n )=µ 1 U(2) (0) //U(2) = proj. µ 1 U(1) n (r) = j S3 rj //U(1) n =Hopf Gr 2 (C n ) µ 1 U(1) n (r) //U(1) n µ 1 SO(3) (0) j S2 r j //SO(3) Pol r (n) Tom Needham Symplectic Structures of Polygon Spaces

4 Basic Summary Definitions of Tom Needham s Talk III Symplectic Structure Connections Measure on the Grassmannian Conclusion of variable edgelength polygons is a natural combination of measures on fixed edgelength polygons. Summary of the Constructions M n 2 (C) V 2 (C n )=µ 1 U(2) (0) //U(2) = proj. µ 1 U(1) n (r) = j S3 rj //U(1) n =Hopf Gr 2 (C n ) µ 1 U(1) n (r) //U(1) n µ 1 SO(3) (0) j S2 r j //SO(3) Pol r (n)

5 Why do we care? Symplectic Geometry Recap A symplectic manifold M 2n has a special 2-form ω called the symplectic form. The n-th power of this form ω n is the volume form on M 2n. The circle acts by symplectomorphisms on M 2n if the action preserves ω. A circle action generates a vector field X on M 2n. We can contract the vector field X with ω to generate a one-form: ι X ω( v) = ω(x, v) If ι X ω is exact, the map is called Hamiltonian and it is dh for some smooth function H on M 2n. The function H is called the momentum associated to the action, or the moment map.

6 Symplectic Geometry Recap II A torus T k which acts by symplectomorphisms on M so that the action is Hamiltonian induces a moment map µ : M R k where the action preserves the fibers. Theorem (Atiyah, Guillemin Sternberg, 1982) The image of µ is a convex polytope in R k called the moment polytope. Theorem (Duistermaat Heckman, 1982) The pushforward of Liouville measure to the moment polytope is piecewise polynomial. If k = n the manifold is called a toric symplectic manifold and the pushforward measure is the uniform measure on the polytope.

7 A Down-to-Earth Example Let (M, ω) be the 2-sphere with the standard area form. Let T 1 = S 1 act by rotation around the z-axis. Then the moment polytope is the interval [ 1, 1], and S 2 is a toric symplectic manifold. Theorem (Archimedes, Duistermaat Heckman) The pushforward of the standard measure on the sphere to the interval is 2π times Lebesgue measure. π Illustration by Kuperberg.

8 Probability and Toric Symplectic Manifolds If M 2n is a toric symplectic manifold with moment polytope P R n, then the inverse image of each point in P is an n-torus. This yields α : P T n M which parametrizes a full-measure subset of M by action-angle coordinates. Proposition The map α : P T n M is measure-preserving. Therefore, we can sample M with respect to Liouville measure by sampling P and T n independently and uniformly. For example, we can sample S 2 uniformly by choosing z and θ independently and uniformly.

9 An Extended Example: Equilateral Arm Space Toric symplectic manifold

10 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2.

11 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action

12 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis

13 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ

14 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ µ(e 1,..., e n ) = (z 1,..., z n ), z-coordinates of e i.

15 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ µ(e 1,..., e n ) = (z 1,..., z n ), z-coordinates of e i. Moment polytope P

16 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ µ(e 1,..., e n ) = (z 1,..., z n ), z-coordinates of e i. Moment polytope P hypercube [ 1, 1] n.

17 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ µ(e 1,..., e n ) = (z 1,..., z n ), z-coordinates of e i. Moment polytope P hypercube [ 1, 1] n. Action-angle coordinates α

18 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ µ(e 1,..., e n ) = (z 1,..., z n ), z-coordinates of e i. Moment polytope P hypercube [ 1, 1] n. Action-angle coordinates α α(z i, θ i ) = ( 1 zi 2 cos θ i, 1 zi 2 sin θ i, z i ).

19 An Extended Example: Equilateral Arm Space Toric symplectic manifold equilateral arms Arm(n; 1) = ΠS 2. Torus action spin each edge around z axis Moment map µ µ(e 1,..., e n ) = (z 1,..., z n ), z-coordinates of e i. Moment polytope P hypercube [ 1, 1] n. Action-angle coordinates α α(z i, θ i ) = ( 1 zi 2 cos θ i, 1 zi 2 sin θ i, z i ). Proposition (with Shonkwiler) The pushforward of z i (the projection of e i on the z-axis) from Arm(n; 1) to R is the pushforward of z i from the hypercube [ 1, 1] n to R.

20 Lemma (with Shonkwiler) The pushforward of uniform measure on the hypercube [ 1, 1] n to [ n, n] by the linear function x i is given by f n (x) = 1 2 n n SA(x, [ 1, 1]n ), where SA(x, [ 1, 1] n ) is the volume of the slice of the hypercube by the plane x i = x. Proposition (with Shonkwiler) The pdf of the end-to-end distance l [0, n] over Arm(n; 1) is φ(l) = l SA(l 1, [ 1, 1]n 1 ) SA(l + 1, [ 1, 1] n 1 ) 2 n 1 n 1

21 Proof The pdf of z i is f n (x). Since this is a projection of the spherically symmetric distribution of the end-to-end vector in R 3 to the z-axis, the pdf of end-to-end distance l is given by To differentiate f n (l), observe f n (x) = rn φ(l) = 2lf n(l). r n f n 1 (x y) 1 2r n dy = F n 1(x + r n ) F n 1 (x r n ) 2r n, where F n 1 (x) is the integral of f n 1. Differentiate, and substitute in the results of the Lemma.

22 Is that the Rayleigh/Chandrasekhar sinc formula? Let sinc x = sin x/x. Pólya (1912) showed that the volume of the central slab of the hypercube [ 1, 1] n 1 given by a 0 x i a 0 is given by Vol(a 0 ) = 2n a 0 π 0 sinc a 0 y sinc n 1 y dy. Our SA(x, [ 1, 1] n 1 ) is the n 1 dimensional volume of a face of this slab; since it is this face (and its symmetric copy) which sweep out n-dimensional volume as a 0 increases, we can deduce that n 1 SA(x, [ 1, 1] n 1 ) = Vol (x), 2 so SA(x, [ 1, 1] n 1 ) = 2n 1 n 1 π 0 cos xy sinc n 1 y dy.

23 The sinc formula explained This implies that SA(l 1, [ 1, 1] n 1 ) SA(l + 1, [ 1, 1] n 1 ) = Multiplying by = 2n 1 n 1 π 0 2 sin y sin ly sinc n 1 y dy = 2n n 1 π l 2 n 1 gives the pdf for l as n 1 Theorem (Rayleigh, 1919) φ(l) = 2l π 0 y sin ly sinc n y dy, 0 y sin ly sinc n y dy.

24 Part II: Toric Symplectic Structure on Closed Polygons Theorem (Kapovich Millson 1996, Hitchin 1987, Howard-Manon-Millson 2011) If we let Pol(n; r) be the space of closed space polygons with edgelengths (r 1,..., r n ) = r (mod SO(3)), then given an abstract triangulation T of the n-gon: symplectic structure Pol(n; r) is the 2n 6 dimensional symplectic reduction of n i=1 S2 (r i ) by the (Hamiltonian) diagonal SO(3) action. torus action fold polygon around n 3 chords in T moment map µ lengths of n 3 chords in T moment polytope P determined by triangle inequalities action-angle coordinates α build triangles and embed with given dihedrals

25 The Fan Triangulation We call this the fan triangulation: The corresponding moment polytope is given by the inequalities: 0 d 1 r 1 + r 2 r i+2 d i + d i+1 d i d i+1 r i+2 0 d n 3 r n + r n 1

26 Moment Polytopes The moment polytope corresponding to a fan triangulation is determined by the fan triangulation inequalities 0 d 1 r 1 + r 2 r i+2 d i + d i+1 d i d i+1 r i+2 0 d n 3 r n + r n 1 Moment polytope for Pol(5; 1) Moment polytope for Pol(6; 1)

27 Expected Value of Chord Lengths Proposition (with Shonkwiler) The expected length of a chord skipping k edges in an n-edge equilateral polygon is the k 1st coordinate of the center of mass of the moment polytope for Pol(n; 1). n k = , , ,035 97, , , ,059 91, ,499 78, , ,337 91, ,608 78, , ,337 91, ,985 78,400 1, ,059 91, ,608 78, ,121 91, ,499 78,400 97,456 78,400

28 Part III: Markov Chain on Toric Symplectic Manifold We can sample any toric symplectic manifold (such as Pol(n; r)) using a Markov chain in action-angle coordinates: TORIC-SYMPLECTIC-MCMC( p, θ, β) prob = UNIFORM-RANDOM-VARIATE(0, 1) if prob < β then Get point in P using hit-and-run. v = RANDOM-RN-DIRECTION(n) (t 0, t 1 ) = FIND-INTERSECTION-ENDPOINTS(P, p, v) t = UNIFORM-RANDOM-VARIATE(t 0, t 1 ) p = p + t v else Get point in T n uniformly. for ind = 1 to n do θ ind = UNIFORM-RANDOM-VARIATE(0, 2π) return ( p, θ) We can then convert a point (p, θ) P T n to a point in M 2n using the map α.

29 Convergence of TSMCMC(β) Proposition (with Shonkwiler) TORIC-SYMPLECTIC-MCMC(β) converges geometrically to Liouville measure on M 2n.

30 Convergence of TSMCMC(β) Proposition (with Shonkwiler) TORIC-SYMPLECTIC-MCMC(β) converges geometrically to Liouville measure on M 2n. Proposition (with Shonkwiler) Suppose that M 2n is a toric symplectic manifold with moment polytope P and action-angle coordinates α: P T n M 2n. Further, let P m ( p, θ, ) be the m-step transition probability of the Markov chain given by TORIC-SYMPLECTIC-MCMC(β) and let µ be the measure defined by symplectic volume on M 2n. There are constants R < and ρ < 1 so that for any ( p, θ) int(p) T n, α P m ( p, θ, ) µ < Rρ m. TV

31 Error Analysis for Integration with TSMCMC(β) Suppose f is a function M 2n R. If a run of the TSMCMC(β) algorithm produces (( p 0, θ 0 ), ( p 1, θ 1 ),...), let µ m (f ) := 1 m m f (α( p k, θ k )) k=1 be the sample average of the values of f over the run. Proposition (with Shonkwiler) If f is square-integrable, there exists a real number σ(f ) so that m( µm (f ) E(f )) w N (0, σ(f ) 2 ), the Gaussian distribution with mean 0 and standard deviation σ(f ) 2. Here the superscript w denotes weak convergence and E(f ) is the expectation of f.

32 Estimating the error variance σ(f ) We can use Geyer s technique to construct a statistically consistent estimator for the variance σ(f ) using the sample variance and covariance over a run. Let the lag-k covariance of a run γ k (f ) be given by γ k (f ) = 1 m k [f (α( p i, θ m i )) µ m (f )][f (α( p i+k, θ i+k )) µ m (f )] i=1 where µ m (f ) is the sample mean over the run, and let Γ k (f ) = γ 2k (f ) + γ 2k+1 (f ) Theorem (Geyer, 1992) If the points in a run were sampled from the stationary distribution of the Markov chain, the sequence of Γ k (f ) would be positive, decreasing, and convex.

33 The Initial Positive Sequence Estimator Definition (Geyer, 1992) Given a function f and a length-m run of the TSMCMC algorithm as above, let N be the largest integer so that Γ 1 (f ),..., Γ N (f ) are all strictly positive. Then the initial positive sequence estimator for σ(f ) is σ m (f ) := σ m,n (f ) = γ 0 (f ) + 2 γ 1 (f ) + 2 N Γ k (f ). k=1 Given a run, after we compute µ m (f ) and σ m (f ) a 95%-confidence interval for the true expectation of f is then given by E(f ) µ m (f ) ± 1.96 σ m (f )/ m

34 Example Computations Total Curvature for Equilateral 64-gons 1,000,000 steps, about 1 minute runtime TSMCMC(0.5) Perm Sample Mean IPS Error Estimate

35 Focusing on mostly permutation runs Proposition (with Shonkwiler) Expected total curvature of an equilateral 64-gon is Dihedral Moment Polytope Perm Mean IPS Error Actual

36 Confined Polygons Definition A polygon p Pol(n; r) is in rooted spherical confinement of radius r if each diagonal length d i r. Such a polygon is contained in a sphere of radius r centered at the first vertex. Illustration by Diao et al.

37 Sampling Confined Polygons Proposition (with Shonkwiler) Polygons in Pol(n; r) in rooted spherical confinement in a sphere of radius r are a toric symplectic manifold with moment polytope 0 d 1 r 1 + r 2 r i+2 d i + d i+1 d i d i+1 r i+2 0 d n 3 r n + r n 1 and the additional linear inequalities d i r. These polytopes are simply subpolytopes of the fan triangulation polytopes. Many other confinement models are possible!

38 Unconfined 100-gons

39 Unconfined 100-gons

40 Unconfined 100-gons

41 Unconfined 100-gons

42 50-confined 100-gons

43 50-confined 100-gons

44 50-confined 100-gons

45 50-confined 100-gons

46 20-confined 100-gons

47 20-confined 100-gons

48 20-confined 100-gons

49 20-confined 100-gons

50 10-confined 100-gons

51 10-confined 100-gons

52 10-confined 100-gons

53 10-confined 100-gons

54 5-confined 100-gons

55 5-confined 100-gons

56 5-confined 100-gons

57 5-confined 100-gons

58 2-confined 100-gons

59 2-confined 100-gons

60 2-confined 100-gons

61 2-confined 100-gons

62 1.1-confined 100-gons

63 1.1-confined 100-gons

64 1.1-confined 100-gons

65 1.1-confined 100-gons

66 Thank you for listening! Thank you!

67 References Probability Theory of Random Polygons from the Quaternionic Viewpoint Jason Cantarella, Tetsuo Deguchi, and Clayton Shonkwiler arxiv: To appear in Communications on Pure and Applied Mathematics. The Expected Total Curvature of Random Polygons Jason Cantarella, Alexander Y. Grosberg, Robert Kusner, and Clayton Shonkwiler arxiv: Symplectic Methods for Random Equilateral Polygons and the Moment Polytope Sampling Algorithm Jason Cantarella and Clayton Shonkwiler In preparation.

Closed Random Walks and Symplectic Geometry

Closed Random Walks and Symplectic Geometry Closed Random Walks and Symplectic Geometry Clayton Shonkwiler University of Georgia Georgia Southern Colloquium November 22, 2013 Random Polygons (and Polymer Physics) Physics Question What is the average

More information

New algorithms for sampling closed and/or confined equilateral polygons

New algorithms for sampling closed and/or confined equilateral polygons New algorithms for sampling closed and/or confined equilateral polygons Jason Cantarella and Clayton Shonkwiler University of Georgia BIRS Workshop Entanglement in Biology November, 2013 Closed random

More information

Closed Random Walks and Symplectic Geometry

Closed Random Walks and Symplectic Geometry Closed Random Walks and Symplectic Geometry Clayton Shonkwiler University of Georgia Wichita State University December 11, 2013 Random Walks (and Polymer Physics) Physics Question What is the average shape

More information

The Symplectic Geometry of Polygon Space and How to Use It

The Symplectic Geometry of Polygon Space and How to Use It The Symplectic Geometry of Polygon Space and How to Use It Clayton Shonkwiler Colorado State University LSU Topology Seminar November 4, 2015 From Variable Edgelengths to Fixed Edgelengths In my grad student

More information

The Symplectic Geometry of Closed Equilateral Random Walks in 3-Space

The Symplectic Geometry of Closed Equilateral Random Walks in 3-Space The Symplectic Geometry of Closed Equilateral Random Walks in 3-Space Jason Cantarella and Clayton Shonkwiler (Dated: October 22, 2013) A closed equilateral random walk in 3-space is a selection of unit

More information

Applications of Geometry to Constrained Random Walks and Polymer Models

Applications of Geometry to Constrained Random Walks and Polymer Models Applications of Geometry to Constrained Random Walks and Polymer Models Clayton Shonkwiler Colorado State University shonkwiler.org Geometry for Signal Processing and Machine Learning October 14, 2016

More information

THE SYMPLECTIC GEOMETRY OF CLOSED EQUILATERAL RANDOM WALKS IN 3-SPACE

THE SYMPLECTIC GEOMETRY OF CLOSED EQUILATERAL RANDOM WALKS IN 3-SPACE The Annals of Applied Probability 2016, Vol. 26, No. 1, 549 596 DOI: 10.1214/15-AAP1100 Institute of Mathematical Statistics, 2016 THE SYMPLECTIC GEOMETRY OF CLOSED EQUILATERAL RANDOM WALKS IN 3-SPACE

More information

A Geometric Perspective on Random Walks with Topological Constraints

A Geometric Perspective on Random Walks with Topological Constraints A Geometric Perspective on Random Walks with Topological Constraints Clayton Shonkwiler Colorado State University Wake Forest University September 9, 2015 Random Walks (and Polymer Physics) Statistical

More information

arxiv: v2 [math.dg] 12 Jan 2016

arxiv: v2 [math.dg] 12 Jan 2016 The Annals of Applied Probability 2016, Vol. 26, No. 1, 549 596 DOI: 10.1214/15-AAP1100 c Institute of Mathematical Statistics, 2016 arxiv:1310.5924v2 [math.dg] 12 Jan 2016 THE SYMPLECTIC GEOMETRY OF CLOSED

More information

A Geometric Perspective on Random Walks with Topological Constraints

A Geometric Perspective on Random Walks with Topological Constraints A Geometric Perspective on Random Walks with Topological Constraints Clayton Shonkwiler Colorado State University LSU Graduate Student Colloquium November 3, 2015 Random Walks (and Polymer Physics) Statistical

More information

Grassmannians and Random Polygons

Grassmannians and Random Polygons Grassmannians and Random Polygons Clayton Shonkwiler Colorado State University April 17, 2015 Polygons Definition A polygon given by vertices v 1,..., v n is a collection of line segments in the plane

More information

arxiv: v2 [cond-mat.stat-mech] 19 Jan 2016

arxiv: v2 [cond-mat.stat-mech] 19 Jan 2016 A fast direct sampling algorithm for equilateral closed polygons arxiv:1510.02466v2 [cond-mat.stat-mech] 19 Jan 2016 Jason Cantarella, Bertrand Duplantier, Clayton Shonkwiler, and Erica Uehara (Dated:

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

More information

Tripod Configurations

Tripod Configurations Tripod Configurations Eric Chen, Nick Lourie, Nakul Luthra Summer@ICERM 2013 August 8, 2013 Eric Chen, Nick Lourie, Nakul Luthra (S@I) Tripod Configurations August 8, 2013 1 / 33 Overview 1 Introduction

More information

751 Problem Set I JWR. Due Sep 28, 2004

751 Problem Set I JWR. Due Sep 28, 2004 751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path

More information

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function

More information

Extremal Configurations of Polygonal Linkages

Extremal Configurations of Polygonal Linkages Extremal Configurations of Polygonal Linkages Dirk Siersma Department of Mathematics University of Utrecht Singularity Conference Bruce 60, Wall 75 Liverpool, June 18-22, 2012 Outline Introduction Planar

More information

Two Connections between Combinatorial and Differential Geometry

Two Connections between Combinatorial and Differential Geometry Two Connections between Combinatorial and Differential Geometry John M. Sullivan Institut für Mathematik, Technische Universität Berlin Berlin Mathematical School DFG Research Group Polyhedral Surfaces

More information

The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus by Jason Schweinsberg University of California at San Diego Outline of Talk 1. Loop-erased random walk 2.

More information

CAT(0)-spaces. Münster, June 22, 2004

CAT(0)-spaces. Münster, June 22, 2004 CAT(0)-spaces Münster, June 22, 2004 CAT(0)-space is a term invented by Gromov. Also, called Hadamard space. Roughly, a space which is nonpositively curved and simply connected. C = Comparison or Cartan

More information

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

More information

Veering triangulations admit strict angle structures

Veering triangulations admit strict angle structures Veering triangulations admit strict angle structures Craig Hodgson University of Melbourne Joint work with Hyam Rubinstein, Henry Segerman and Stephan Tillmann. Geometric Triangulations We want to understand

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

Parameterization of triangular meshes

Parameterization of triangular meshes Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Sequential Monte Carlo Method for counting vertex covers

Sequential Monte Carlo Method for counting vertex covers Sequential Monte Carlo Method for counting vertex covers Slava Vaisman Faculty of Industrial Engineering and Management Technion, Israel Institute of Technology Haifa, Israel May 18, 2013 Slava Vaisman

More information

Estimating normal vectors and curvatures by centroid weights

Estimating normal vectors and curvatures by centroid weights Computer Aided Geometric Design 21 (2004) 447 458 www.elsevier.com/locate/cagd Estimating normal vectors and curvatures by centroid weights Sheng-Gwo Chen, Jyh-Yang Wu Department of Mathematics, National

More information

Geometry of Spaces of Planar Quadrilaterals

Geometry of Spaces of Planar Quadrilaterals Geometry of Spaces of Planar Quadrilaterals Jessica L. StClair Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements

More information

Outer Billiard on Piecewise Circular Curves & Piecewise Hyperbola Curves

Outer Billiard on Piecewise Circular Curves & Piecewise Hyperbola Curves Outer Billiard on Piecewise Circular Curves & Piecewise Hyperbola Curves Brown University August 9, 2013 Outer Billiard ~ ~ p T 2 (p) T(p) Piecewise Circular Curves Definition Piecewise circular curve

More information

Conics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved.

Conics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved. 10 Conics, Parametric Equations, and Polar Coordinates Copyright Cengage Learning. All rights reserved. 10.5 Area and Arc Length in Polar Coordinates Copyright Cengage Learning. All rights reserved. Objectives

More information

Topic: Orientation, Surfaces, and Euler characteristic

Topic: Orientation, Surfaces, and Euler characteristic Topic: Orientation, Surfaces, and Euler characteristic The material in these notes is motivated by Chapter 2 of Cromwell. A source I used for smooth manifolds is do Carmo s Riemannian Geometry. Ideas of

More information

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.

We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the

More information

Constrained Willmore Tori in the 4 Sphere

Constrained Willmore Tori in the 4 Sphere (Technische Universität Berlin) 16 August 2006 London Mathematical Society Durham Symposium Methods of Integrable Systems in Geometry Constrained Willmore Surfaces The Main Result Strategy of Proof Constrained

More information

Introduction to Complex Analysis

Introduction to Complex Analysis Introduction to Complex Analysis George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 413 George Voutsadakis (LSSU) Complex Analysis October 2014 1 / 50 Outline

More information

Hyperbolic structures and triangulations

Hyperbolic structures and triangulations CHAPTER Hyperbolic structures and triangulations In chapter 3, we learned that hyperbolic structures lead to developing maps and holonomy, and that the developing map is a covering map if and only if the

More information

Pick s Theorem and Lattice Point Geometry

Pick s Theorem and Lattice Point Geometry Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct

More information

Notes on Spherical Geometry

Notes on Spherical Geometry Notes on Spherical Geometry Abhijit Champanerkar College of Staten Island & The Graduate Center, CUNY Spring 2018 1. Vectors and planes in R 3 To review vector, dot and cross products, lines and planes

More information

Conics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved.

Conics, Parametric Equations, and Polar Coordinates. Copyright Cengage Learning. All rights reserved. 10 Conics, Parametric Equations, and Polar Coordinates Copyright Cengage Learning. All rights reserved. 10.5 Area and Arc Length in Polar Coordinates Copyright Cengage Learning. All rights reserved. Objectives

More information

Basic Euclidean Geometry

Basic Euclidean Geometry hapter 1 asic Euclidean Geometry This chapter is not intended to be a complete survey of basic Euclidean Geometry, but rather a review for those who have previously taken a geometry course For a definitive

More information

Geometric structures on 2-orbifolds

Geometric structures on 2-orbifolds Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)

More information

Automorphism Groups of Cyclic Polytopes

Automorphism Groups of Cyclic Polytopes 8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n

More information

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves. A curve is a subset of IR 2 of the form Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints

More information

Shape Modeling and Geometry Processing

Shape Modeling and Geometry Processing 252-0538-00L, Spring 2018 Shape Modeling and Geometry Processing Discrete Differential Geometry Differential Geometry Motivation Formalize geometric properties of shapes Roi Poranne # 2 Differential Geometry

More information

Moore Catholic High School Math Department

Moore Catholic High School Math Department Moore Catholic High School Math Department Geometry Vocabulary The following is a list of terms and properties which are necessary for success in a Geometry class. You will be tested on these terms during

More information

Definitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger

Definitions. Topology/Geometry of Geodesics. Joseph D. Clinton. SNEC June Magnus J. Wenninger Topology/Geometry of Geodesics Joseph D. Clinton SNEC-04 28-29 June 2003 Magnus J. Wenninger Introduction Definitions Topology Goldberg s polyhedra Classes of Geodesic polyhedra Triangular tessellations

More information

Shape Modeling. Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell. CS 523: Computer Graphics, Spring 2011

Shape Modeling. Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell. CS 523: Computer Graphics, Spring 2011 CS 523: Computer Graphics, Spring 2011 Shape Modeling Differential Geometry Primer Smooth Definitions Discrete Theory in a Nutshell 2/15/2011 1 Motivation Geometry processing: understand geometric characteristics,

More information

An Analysis of a Variation of Hit-and-Run for Uniform Sampling from General Regions

An Analysis of a Variation of Hit-and-Run for Uniform Sampling from General Regions An Analysis of a Variation of Hit-and-Run for Uniform Sampling from General Regions SEKSAN KIATSUPAIBUL Chulalongkorn University ROBERT L. SMITH University of Michigan and ZELDA B. ZABINSKY University

More information

2D Object Definition (1/3)

2D Object Definition (1/3) 2D Object Definition (1/3) Lines and Polylines Lines drawn between ordered points to create more complex forms called polylines Same first and last point make closed polyline or polygon Can intersect itself

More information

Lecture 0: Reivew of some basic material

Lecture 0: Reivew of some basic material Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms

More information

Math 113 Exam 1 Practice

Math 113 Exam 1 Practice Math Exam Practice January 6, 00 Exam will cover sections 6.-6.5 and 7.-7.5 This sheet has three sections. The first section will remind you about techniques and formulas that you should know. The second

More information

Lecture notes for Topology MMA100

Lecture notes for Topology MMA100 Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine

More information

Curve and Surface Basics

Curve and Surface Basics Curve and Surface Basics Implicit and parametric forms Power basis form Bezier curves Rational Bezier Curves Tensor Product Surfaces ME525x NURBS Curve and Surface Modeling Page 1 Implicit and Parametric

More information

ON THE MAXIMAL VOLUME OF THREE-DIMENSIONAL HYPERBOLIC COMPLETE ORTHOSCHEMES

ON THE MAXIMAL VOLUME OF THREE-DIMENSIONAL HYPERBOLIC COMPLETE ORTHOSCHEMES Proceedings of the Institute of Natural Sciences, Nihon University No.49 04 pp.63 77 ON THE MAXIMAL VOLUME OF THREE-DIMENSIONAL HYPERBOLIC COMPLETE ORTHOSCHEMES Kazuhiro ICHIHARA and Akira USHIJIMA Accepted

More information

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3

A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F

More information

Parameterization. Michael S. Floater. November 10, 2011

Parameterization. Michael S. Floater. November 10, 2011 Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point

More information

MATH 2400, Analytic Geometry and Calculus 3

MATH 2400, Analytic Geometry and Calculus 3 MATH 2400, Analytic Geometry and Calculus 3 List of important Definitions and Theorems 1 Foundations Definition 1. By a function f one understands a mathematical object consisting of (i) a set X, called

More information

Mirror Symmetry Through Reflexive Polytopes

Mirror Symmetry Through Reflexive Polytopes Mirror Symmetry Through Reflexive Polytopes Physical and Mathematical Dualities Ursula Whitcher Harvey Mudd College April 2010 Outline String Theory and Mirror Symmetry Some Complex Geometry Reflexive

More information

Cluster algebras and infinite associahedra

Cluster algebras and infinite associahedra Cluster algebras and infinite associahedra Nathan Reading NC State University CombinaTexas 2008 Coxeter groups Associahedra and cluster algebras Sortable elements/cambrian fans Infinite type Much of the

More information

Pi at School. Arindama Singh Department of Mathematics Indian Institute of Technology Madras Chennai , India

Pi at School. Arindama Singh Department of Mathematics Indian Institute of Technology Madras Chennai , India Pi at School rindama Singh epartment of Mathematics Indian Institute of Technology Madras Chennai-600036, India Email: asingh@iitm.ac.in bstract: In this paper, an attempt has been made to define π by

More information

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana

Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana University of Groningen Geometric approximation of curves and singularities of secant maps Ghosh, Sunayana IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish

More information

To graph the point (r, θ), simply go out r units along the initial ray, then rotate through the angle θ. The point (1, 5π 6. ) is graphed below:

To graph the point (r, θ), simply go out r units along the initial ray, then rotate through the angle θ. The point (1, 5π 6. ) is graphed below: Polar Coordinates Any point in the plane can be described by the Cartesian coordinates (x, y), where x and y are measured along the corresponding axes. However, this is not the only way to represent points

More information

05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo

05 - Surfaces. Acknowledgements: Olga Sorkine-Hornung. CSCI-GA Geometric Modeling - Daniele Panozzo 05 - Surfaces Acknowledgements: Olga Sorkine-Hornung Reminder Curves Turning Number Theorem Continuous world Discrete world k: Curvature is scale dependent is scale-independent Discrete Curvature Integrated

More information

Generating Random Walks and Polygons with Thickness in Confinement

Generating Random Walks and Polygons with Thickness in Confinement Western Kentucky University TopSCHOLAR Masters Theses & Specialist Projects Graduate School 5-2015 Generating Random Walks and Polygons with Thickness in Confinement Sai Sindhuja Veeramachaneni Western

More information

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational

More information

FLIP GRAPHS, YOKE GRAPHS AND DIAMETER

FLIP GRAPHS, YOKE GRAPHS AND DIAMETER FLIP GRAPHS, AND Roy H. Jennings Bar-Ilan University, Israel 9th Sèminaire Lotharingien de Combinatoire 0- September, 0 Bertinoro, Italy FLIP GRAPHS, AND FLIP GRAPH TRIANGULATIONS PERMUTATIONS TREES KNOWN

More information

To be a grade 1 I need to

To be a grade 1 I need to To be a grade 1 I need to Order positive and negative integers Understand addition and subtraction of whole numbers and decimals Apply the four operations in correct order to integers and proper fractions

More information

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations

Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Conjectures concerning the geometry of 2-point Centroidal Voronoi Tessellations Emma Twersky May 2017 Abstract This paper is an exploration into centroidal Voronoi tessellations, or CVTs. A centroidal

More information

Trinities, hypergraphs, and contact structures

Trinities, hypergraphs, and contact structures Trinities, hypergraphs, and contact structures Daniel V. Mathews Daniel.Mathews@monash.edu Monash University Discrete Mathematics Research Group 14 March 2016 Outline 1 Introduction 2 Combinatorics of

More information

Surfaces: notes on Geometry & Topology

Surfaces: notes on Geometry & Topology Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces

More information

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron

Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron Structure in Quaternions Corresponding to the 4-Dimensional Tetrahedron AJ Friend School of Mathematics Georgia Institute of Technology Atlanta, GA Advised by: Adrian Ocneanu Department of Mathematics

More information

Convexization in Markov Chain Monte Carlo

Convexization in Markov Chain Monte Carlo in Markov Chain Monte Carlo 1 IBM T. J. Watson Yorktown Heights, NY 2 Department of Aerospace Engineering Technion, Israel August 23, 2011 Problem Statement MCMC processes in general are governed by non

More information

Measuring Lengths The First Fundamental Form

Measuring Lengths The First Fundamental Form Differential Geometry Lia Vas Measuring Lengths The First Fundamental Form Patching up the Coordinate Patches. Recall that a proper coordinate patch of a surface is given by parametric equations x = (x(u,

More information

CHAPTER 6 Parametric Spline Curves

CHAPTER 6 Parametric Spline Curves CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic

More information

EXTERNAL VISIBILITY. 1. Definitions and notation. The boundary and interior of

EXTERNAL VISIBILITY. 1. Definitions and notation. The boundary and interior of PACIFIC JOURNAL OF MATHEMATICS Vol. 64, No. 2, 1976 EXTERNAL VISIBILITY EDWIN BUCHMAN AND F. A. VALENTINE It is possible to see any eleven vertices of an opaque solid regular icosahedron from some appropriate

More information

Simplicial Hyperbolic Surfaces

Simplicial Hyperbolic Surfaces Simplicial Hyperbolic Surfaces Talk by Ken Bromberg August 21, 2007 1-Lipschitz Surfaces- In this lecture we will discuss geometrically meaningful ways of mapping a surface S into a hyperbolic manifold

More information

Compactness Theorems for Saddle Surfaces in Metric Spaces of Bounded Curvature. Dimitrios E. Kalikakis

Compactness Theorems for Saddle Surfaces in Metric Spaces of Bounded Curvature. Dimitrios E. Kalikakis BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 51, 2005 (45 52) Compactness Theorems for Saddle Surfaces in Metric Spaces of Bounded Curvature Dimitrios E. Kalikakis Abstract The notion of a non-regular

More information

The universal implosion and the multiplicative Horn problem

The universal implosion and the multiplicative Horn problem The universal implosion and the multiplicative Horn problem Michael Thaddeus April 27, 2014 Michael Thaddeus The universal implosion and the multiplicative Horn problem 1 / 1 The multiplicative Horn problem

More information

Generating equilateral random polygons in confinement III

Generating equilateral random polygons in confinement III Generating equilateral random polygons in confinement III Y. Diao, C. Ernst, A. Montemayor, and U. Ziegler Department of Mathematics and Computer Science Western Kentucky University Bowling Green, KY 42101,

More information

Teichmüller Space and Fenchel-Nielsen Coordinates

Teichmüller Space and Fenchel-Nielsen Coordinates Teichmüller Space and Fenchel-Nielsen Coordinates Nathan Lopez November 30, 2015 Abstract Here we give an overview of Teichmüller space and its realization as a smooth manifold through Fenchel- Nielsen

More information

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves. A curve is a subset of IR 2 of the form Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints

More information

9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B

9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B 8. Boundary Descriptor 8.. Some Simple Descriptors length of contour : simplest descriptor - chain-coded curve 9 length of contour no. of horiontal and vertical components ( no. of diagonal components

More information

DEPARTMENT - Mathematics. Coding: N Number. A Algebra. G&M Geometry and Measure. S Statistics. P - Probability. R&P Ratio and Proportion

DEPARTMENT - Mathematics. Coding: N Number. A Algebra. G&M Geometry and Measure. S Statistics. P - Probability. R&P Ratio and Proportion DEPARTMENT - Mathematics Coding: N Number A Algebra G&M Geometry and Measure S Statistics P - Probability R&P Ratio and Proportion YEAR 7 YEAR 8 N1 Integers A 1 Simplifying G&M1 2D Shapes N2 Decimals S1

More information

Cuts of the Hypercube

Cuts of the Hypercube Cuts of the Hypercube Neil Calkin, Kevin James, J. Bowman Light, Rebecca Myers, Eric Riedl, Veronica July 3, 8 Abstract This paper approaches the hypercube slicing problem from a probabilistic perspective.

More information

Combinatorics I (Lecture 36)

Combinatorics I (Lecture 36) Combinatorics I (Lecture 36) February 18, 2015 Our goal in this lecture (and the next) is to carry out the combinatorial steps in the proof of the main theorem of Part III. We begin by recalling some notation

More information

Toric Varieties and Lattice Polytopes

Toric Varieties and Lattice Polytopes Toric Varieties and Lattice Polytopes Ursula Whitcher April 1, 006 1 Introduction We will show how to construct spaces called toric varieties from lattice polytopes. Toric fibrations correspond to slices

More information

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Preferred directions for resolving the non-uniqueness of Delaunay triangulations Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation

More information

Dynamic Collision Detection

Dynamic Collision Detection Distance Computation Between Non-Convex Polyhedra June 17, 2002 Applications Dynamic Collision Detection Applications Dynamic Collision Detection Evaluating Safety Tolerances Applications Dynamic Collision

More information

Pick up some wrapping paper.

Pick up some wrapping paper. Pick up some wrapping paper. What is the area of the following Christmas Tree? There is a nice theorem that allows one to compute the area of any simply-connected (i.e. no holes) grid polygon quickly.

More information

Kinematics of the Stewart Platform (Reality Check 1: page 67)

Kinematics of the Stewart Platform (Reality Check 1: page 67) MATH 5: Computer Project # - Due on September 7, Kinematics of the Stewart Platform (Reality Check : page 7) A Stewart platform consists of six variable length struts, or prismatic joints, supporting a

More information

04 - Normal Estimation, Curves

04 - Normal Estimation, Curves 04 - Normal Estimation, Curves Acknowledgements: Olga Sorkine-Hornung Normal Estimation Implicit Surface Reconstruction Implicit function from point clouds Need consistently oriented normals < 0 0 > 0

More information

Archbold Area Schools Math Curriculum Map

Archbold Area Schools Math Curriculum Map Math 8 August - May Mathematical Processes Formulate a problem or mathematical model in response to a specific need or situation, determine information required to solve the problem, choose method for

More information

4 Parametrization of closed curves and surfaces

4 Parametrization of closed curves and surfaces 4 Parametrization of closed curves and surfaces Parametrically deformable models give rise to the question of obtaining parametrical descriptions of given pixel or voxel based object contours or surfaces,

More information

Suggested List of Mathematical Language. Geometry

Suggested List of Mathematical Language. Geometry Suggested List of Mathematical Language Geometry Problem Solving A additive property of equality algorithm apply constraints construct discover explore generalization inductive reasoning parameters reason

More information

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory

More information

f xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is

f xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is 1. Let f(x, y) = 5 + 3x 2 + 3y 2 + 2y 3 + x 3. (a) Final all critical points of f. (b) Use the second derivatives test to classify the critical points you found in (a) as a local maximum, local minimum,

More information

Reflection groups 4. Mike Davis. May 19, Sao Paulo

Reflection groups 4. Mike Davis. May 19, Sao Paulo Reflection groups 4 Mike Davis Sao Paulo May 19, 2014 https://people.math.osu.edu/davis.12/slides.html 1 2 Exotic fundamental gps Nonsmoothable aspherical manifolds 3 Let (W, S) be a Coxeter system. S

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

Themes in the Texas CCRS - Mathematics

Themes in the Texas CCRS - Mathematics 1. Compare real numbers. a. Classify numbers as natural, whole, integers, rational, irrational, real, imaginary, &/or complex. b. Use and apply the relative magnitude of real numbers by using inequality

More information

Mathematical Analysis of Tetrahedron (solid angle subtended by any tetrahedron at its vertex)

Mathematical Analysis of Tetrahedron (solid angle subtended by any tetrahedron at its vertex) From the SelectedWorks of Harish Chandra Rajpoot H.C. Rajpoot Winter March 29, 2015 Mathematical Analysis of Tetrahedron solid angle subtended by any tetrahedron at its vertex) Harish Chandra Rajpoot Rajpoot,

More information