Home  - Pure_And_Applied_Math - Convex Geometry

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

41-60 of 88    Back | 1  | 2  | 3  | 4  | 5  | Next 20

Convex Geometry:     more books (100)

Convexity and Related Combinatorial Geometry (Lecture Notes in Pure and Applied Mathematics) Discrete geometry and convexity (Annals of the New York Academy of Sciences) Geometry of numbers (Bibliotheca mathematica, a series of monographs on pure and applied mathematics) by C. G Lekkerkerker, 1969 Discrete and Computational Geometry Discrete Geometry and Convexity (Annals of the New York Academy of Sciences) Convex geometry of orbits : (Dissertation) by Grigoriy Blekherman, 2006-03-01 Convex Bodies and Algebraic Geometry: An Introduction to the Theory of Toric Varieties (Ergebnisse Der Mathematik Und Ihrer Grenzgebiete 3 Folge) by Tadao Oda, 1988-02 Complex Geometry of Convex Domains That Cover Varieties: MSRI 00708-88; November 1987 by S. Frankel, 1987 Memorandum by S. V Ovchinnikov, 1982 New York by P. W Aitchison, 1974 Convex Geometry Analysis (Mathematical Sciences Research Institute Publications, No. 34) by Keith (editor); Milman, Vitali (editor) Ball, 1999 Strange Phenomena in Convex and Discrete Geometry (Universitext) by Chuanming Zong, 1996-07 Join Geometries: A Theory of Convex Sets and Linear Geometry. Technical report by Andrew Klapper, 1987

lists with details

41. Atlas: Convex Geometries: Recent Development Presented By K. Adaricheva
    In particular, the lattice of closed sets of any finite convex geometry is joinsemidistributive,and every finite join-semidistributive lattice can be  
    http://atlas-conferences.com/cgi-bin/abstract/cake-48
    
    Extractions: Institute of Mathematics of SB RAS, Novosibirsk Convex Geometries: recent development Convex geometries are defined in combinatorics as the finite closure systems with the anti-exchange axiom . Via the lattices of closed sets they can be linked to the lattices with the unique irredundant decompositions that were studied in 40s by R.Dilworth. In recent paper by K.Adaricheva, V.Gorbunov and V.Tumanov "Join-semidistributive lattices and convex geometries'' (to appear in Adv.Math.) we discover a close connection of convex geometries with lattices satisfying the quasi-identity of join-semidistributivity: In particular, the lattice of closed sets of any finite convex geometry is join-semidistributive, and every finite join-semidistributive lattice can be embedded into the lattice of convex sets of some convex geometry. This also determines the place of the class of join-semidistributive lattices in the whole lattice hierarchy as a class that in some sense opposes to the class of modular lattices, the latter often being linked to the closure systems with the exchange-axiom The paper above introduces the general notion of a convex geometry as a (not necessarily finite) closure system with the anti-exchange axiom. This allows studying a wide class of closure systems that appear in different mathematical disciplines.

42. Semi-infinite Optimization
    Recent applications of semiinfinite optimization techniques to geometric extremalproblems are opened up in the last years, first of all in convex geometry.  
    http://www.math.uni-magdeburg.de/institute/imo/research/semiinfinite_html/semiin
    
    Extractions: There is a great variety of (classical) applications of semi-infinite optimization, including problems in approximation theory (with respect to polyhedral norms), operation research, optimal control, boundary value problems and others. These applications and appealing theoretical properties of semi-infinite problems gave rise to intensive (and up to now undiminished) research activities in this field since its inceptive appearing in the 1960s. Describing an n-dimensional convex body by its Minkowski support function, there occur in a very natural way systems of (infinitely many) linear inequalities with a finite number of variables. Additionally, any inclusion of two convex bodies can equivalently be formulated by the inequality for all directions , where h k are the support functions of C K , respectively. So the feasible regions of extremum problems corresponding to coverings or embeddings in convex geometry can be described by semi-infinite systems and semi-infinite optimization techniques turn out to be an appropriate tool for handling them.

43. Geometric And Convex Combinatorics
    the solution of problems in integer programming have their origin in various fieldsof mathematics, such as Geometry of Numbers, convex geometry, Algebra, or  
    http://www.math.uni-magdeburg.de/institute/imo/research/geometry_html/geometry.h
    
    Extractions: Next: References Geometric and convex combinatorics Methods for the solution of problems in integer programming have their origin in various fields of mathematics, such as Geometry of Numbers Convex Geometry Algebra , or Number Theory . The reason for this is the fact that the study of relations between discrete structures (lattices) and continuous sets (convex bodies, cones) is of fundamental importance for all of them. In this project we are trying to utilize current methods and results from the fields mentioned above for integer programming, and to contribute to a better understanding of lattice structures in connection with convex sets. The individual projects can be classified as follows: In 1896 Minkowski laid the foundation of what is today called the Geometry of Numbers , when he solved problems in number theory using geometric methods and interpretations. Today it is an independent field of research with close ties to other mathematical disciplines, for example coding theory and integer programming.

44. Warwick Preprints By WS.Kendall
    203, Computer algebra and stochastic calculus, 212, convex geometryand nonconfluent Gammamartingales I Tightness and strict convexity,  
    http://www.warwick.ac.uk/statsdept/staff/WSK/ppt.html

45. Wlodek's Geometry Papers
    with convex sets, Chapter 3.3, vol. B, in Handbook of convex geometry,P. Gruber and J. Wills, Eds., NorthHolland 1993, 799-860.  
    http://www.auburn.edu/~kuperwl/geometry.html

46. Polytechnic University Department Of Mathematics: Tenured Faculty
    Erwin Lutwak Ph.D., Polytechnic Institute of Brooklyn convex geometry, geometricand analytic inequalities Phone (718) 2603366 Email elutwak@poly.edu Office  
    http://www.math.poly.edu/people/tenured_faculty.phtml

47. MarieCurie1
    geometry of measures (as presented in Mattila Geometry of sets and measures inEuclidean spaces, Cambridge University Press 1995), convex geometry, ( see the  
    http://www.ucl.ac.uk/Mathematics/Adverts/MarieCurie1.html

48. IB
    Professor Imre Bárány, PhD, DSc. Tel 0207679-2836 E-mail barany@math.ucl.ac.uk.Research Interests convex geometry with Applications.  
    http://www.ucl.ac.uk/Mathematics/staff/IB.html

49. Convex.nb
    All rights reserved. Please read this copyright notice. Introduction. In this notebookseveral useful calculations are set up for studies of convex geometry.  
    http://www.mathphysics.com/convex/Convexnb.html
    
    Extractions: In this notebook several useful calculations are set up for studies of convex geometry. The original motivation for making the notebook was to study some properties of convex bodies of convex width, so some of the calculations are aimed at this problem. In particular, for that problem it is convenient to expand the important functions in Fourier series or spherical-harmonic series, depending on the dimension.

50. Maple Package `convex'
    convex a Maple package for convex geometry. Current Franz. This isa Maple package to facilitate computations in convex geometry.  
    http://www.uni-konstanz.de/FuF/mathe/homepages/franz/convex/
    
    Extractions: This is a Maple package to facilitate computations in convex geometry. Its provides functions to deal with rational of (in principle) arbitrary dimension or size. For example, one can define cones and polyhedra as convex hulls of points, rays and lines or as intersections of halfspaces and hyperplanes, determine their elementary properties, like dimension, vertices, rays, and facet normals, plot polytopes up to dimension 3, dualise cones and polyhedra, test for containment, compatibility, and regularity, compute images and preimages under linear and affine maps, respectively, calculate convex hulls and intersections of cones and polyhedra, define Cartesian products, joins, and Minkowski sums, calculate the volume and surface of polytopes, compute in the face lattice of a cone or polyhedron, e.g., the supporting face of a list of points, the minimum or maximum of a list of faces

51. No Title
    LN Trefethen, D. Bau Numerical Linear Algebra, SIAM 1997. convex geometry Lecture4 h, 8 credit points; Tutorial 2 h, 2 credit points Prof. Wolfgang Weil.  
    http://www.mathematik.uni-karlsruhe.de/~ipsm/abstract.html

52. Sylvester's Four-Point Problem -- From MathWorld
    Weil, W. and Wieacker, J. Stochastic Geometry. Ch. 5.2 in Handbookof convex geometry (Ed. P. M. Gruber and J. M. Wills). Amsterdam  
    http://mathworld.wolfram.com/SylvestersFour-PointProblem.html
    
    Extractions: Sylvester's four-point problem asks for the probability q R ) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester 1865). Depending on the method chosen to pick points from the infinite plane, a number of different solutions are possible, prompting Sylvester to conclude "This problem does not admit of a determinate solution" (Sylvester 1865; Pfiefer 1989). For points selected from an open, convex subset of the plane having finite area , the probability is given by

53. BioGeometry Recommended Literature
    convex geometry. Convex sets have been studied from a variety of angles.A big topic in this field is convex polytopes, and we recommend  
    http://biogeometry.duke.edu/education/literature/geometry.html
    
    Extractions: Geometry Our sources of geometric thought and writing go back to ancient civilizations, most notably the Greek and the Chinese. As an introduction to this vast field, we recommend the book by Hilbert and Cohn-Vossen [ ], which illustrates the variety of geometric thinking within mathematics. We group our recommendations into six subareas. Elementary Geometry. This field studies simple geometric figures and their relationships. We mention Coxeter and Greitzer [ ] as an excellent source. We also recommend the book by Pedoe [ ], which contains a wealth of material on circles and spheres. Discrete Geometry. This area in geometry is dominated by the Hungarian school of thought, which includes work on packings and coverings as studied by Laszlo Fejes-Toth and combinatorial extremum problems as popularized by Paul Erdos. We recommend the text by Pach and Agarwal [ ], which discusses a broad range of problems and results in the area. Convex Geometry.

54. MaPhySto And StocLab Summer School On Stereology And Geometric Tomography
    Geometric tomography has connections with convex geometry, geometricprobing in robotics, computerized tomography, and other areas.  
    http://www.maphysto.dk/events/S-and-GT2000/
    
    Extractions: MaPhySto and StocLab Summer School on Stereology and Geometric Tomography Sandbjerg Manor, 20-25 May, 2000 The aim of the summer school was to give an overview of modern stereology and its relation to geometric tomography, including both the mathematical and statistical theory and the practical applications. Stereology is the area of stochastics dealing with statistical inference about spatial structures from geometric samples of the structure such as two-dimensional sections and one-dimensional probes. The development of stereological methods involve the use of advanced mathematical tools, especially from geometric measure theory and integral geometry. Stereology is now in world-wide use in many areas of biology and medicine, most importantly in neuroscience and cancer grading. Other areas of application are geology, metallography and mineralogy. A disector consists of a reference plane and a look-up plane, a distance h apart. Illustration of the sampling relevant for estimation of length in R , based on projections on a vertical plane.

55. Convex Geometry Applied To Petri Nets State Space Size
    convex geometry Applied to Petri Nets State Space Size Estimationand Calculation of Traps, Siphons, and Invariants. Alexander  
    http://pdv.cs.tu-berlin.de/~azi/texte/TB20006_info.html
    
    Extractions: Alexander Huck, Jörn Freiheit, Armin Zimmermann: Convex Geometry Applied to Petri Nets: State Space Size Estimation and Calculation of Traps, Siphons, and Invariants. Technical Report 2000-6, Technische Universität Berlin. The computation of Petri net properties - if solely based on its structural information - is less time and space consuming than methods based on a reachability graph analysis. In this paper we propose an improved algorithm for the generation of minimal invariants, traps, and siphons. Furthermore, a method for the efficient estimation of the state space size for Petri nets is presented, which uses the obtained structural properties. Both algorithms only require structural net information and are based on a new and improved implementation of the double description method. We show how this convex geometry technique can be successfully applied to Petri nets. will soon be available

56. Citation
    5 BOARDMAN, J. 1993. Automating spectral unmixing of AVIRIS data using convex geometryconcepts. In the 4th JPL Airborne Geoscience Workshop (Washington, DC).  
    http://www.acm.org/pubs/citations/journals/toms/1996-22-4/p469-barber/
    
    Extractions: REFERENCES Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. 1 ALLEN, S. AND DUTTA, D. 1995. Determination and evaluation of support structures in layered manufacturing. J. Des. Manufactur. 5, 153-162.

57. Discrete Geometry - Publications Martin Henk
    a Series of Gorenstein Cyclic Quotient Singularities Admitting a Unique ProjectiveCrepant Resolution, to appaer in ``Combinatorial convex geometry and Toric  
    http://fma2.math.uni-magdeburg.de/~henk/henk_pub.html
    
    Extractions: On the representation of polyhedra by polynomial inequalities arXiv:math.MG/0203268 ), to appear in Discrete Comput. Geom. Dimitrios I. Dais and Martin Henk, On the Equations Defining Toric L.C.I. Singularities arXiv:math.AG/0204172 ), to appear in Trans. Amer. Math. Soc. Integral decomposition of polyhedra and some applications in mixed integer programming , Math. Prog. (B). Martin Henk, Successive Minima and Lattice Points , Rendi. Circ. Matematico Palermo, Serie II, Supppl. arXiv:math.MG/0204158 Martin Henk and Robert Weismantel, Diphantine Approximations and Integer Points of Cones , Combinatorica, On free planes in lattice ball packings , Bull. London Math. Soc. , no. 3, 2002, 284-290. Martin Henk and Annegret Wagler, Die Starke-Perfekte-Graphen-Vermutung , DMV-Mitteilungen Martin Henk and Chuaming Zong, Segments in Ball Packings , Mathematika, Ulrich Betke and Martin Henk

58. Richard J. Gardner's Home Page
    1974, under the supervision of Professor CA Rogers, and the D.Sc degree from theUniversity of London in 1988 for work in measure theory and convex geometry.  
    http://www.ac.wwu.edu/~gardner/
    
    Extractions: Western Washington University Abstract Algebra : Math 401. Calculus : Math 124, Math 125, Math 224, Math 225, Math 226. Complex Analysis : Math 438/Math 538, Math 539. Discrete Mathematics and Combinatorics : Math 209, Math 566. Fourier Series and PDE's : Math 430/Math 530. Functional Analysis : Math 528. Geometric Tomography and Imaging : Math 397. Geometry : Math 560, Math 562. History of Mathematics : Math 420. Linear Algebra : Math 204, Math 304. Number Theory : Math 302. Optimization : Math-CS 335, Math-CS 435/Math 535, Math 570. Ordinary Differential Equations : Math 331, Math 432. Probability and Statistics : Math 341, Math 342, Math 441/Math 541. Real Analysis : Math 312, Math 421/Math 521, Math 422/Math 522, Math 527. Olga Simek

59. Annex I To The Contract
    3) Geometry of Banach spaces, convex geometry Develop the aspects of the geometryof Banach spaces already directly related to function theory and operator  
    http://www.amsta.leeds.ac.uk/pure/analysis/network/annex1.html

60. Publications
    Translate this page Preprint ps et pdf. Entropy of the Grassmann manifold, convex geometryAnalysis, MSRI Publications, 34, (1998) 181-188. Version ps et pdf.  
    http://www-math.univ-mlv.fr/~pajor/recherche/pub.htm
    
    Extractions: Illinois Jour. of Math. (1996), 91-107. Preprint ps et pdf Entropy of the Grassmann manifold , Convex Geometry Analysis, MSRI Publications, , (1998) 181-188. Version ps et pdf. The isotropy constants of the Schatten classes are bounded (1998), 773-783. Preprint ps et pdf (en collaboration avec A. Litwak et V. Milman) Proc. of AMS. (1999), 1499-1507. Preprint ps et pdf Metric entropy of convex hulls in Banach spaces , (avec B. Carl et I. Kyrezi) J. London Math. Soc. (1999) 871-896. Preprint ps et pdf The flatness theorem for non-symmetric convex bodies via the local theory of Banach spaces (en collaboration avec W. Banaszczyk, A. Litwak et S. Szarek) Mathematics of Operations research, No 3, (1999), 728-750. Preprint ps et pdf Entropy method in Asymptotic Convex Geometry (en collaboration avec V. Milman) C.R. Acad. Sci. Paris (1999), 303-308. Preprint ps et pdf Entropy and asymptotic geometry of non-symmetric convex bodies (en collaboration avec V. Milman) Advances in Math.

41-60 of 88    Back | 1  | 2  | 3  | 4  | 5  | Next 20