All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 4 of 4

Showing per page

Cauchy problems for discrete affine minimal surfaces

Marcos Craizer, Thomas Lewiner, Ralph Teixeira (2012)

Archivum Mathematicum

In this paper we discuss planar quadrilateral (PQ) nets as discrete models for convex affine surfaces. As a main result, we prove a necessary and sufficient condition for a PQ net to admit a Lelieuvre co-normal vector field. Particular attention is given to the class of surfaces with discrete harmonic co-normals, which we call discrete affine minimal surfaces, and the subclass of surfaces with co-planar discrete harmonic co-normals, which we call discrete improper affine spheres. Within this classes,...

Cheeger inequalities for unbounded graph Laplacians

Frank Bauer, Matthias Keller, Radosław K. Wojciechowski (2015)

Journal of the European Mathematical Society

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if the vertex degrees are unbounded.

Convex bodies associated to linear series

Robert Lazarsfeld, Mircea Mustață (2009)

Annales scientifiques de l'École Normale Supérieure

In his work on log-concavity of multiplicities, Okounkov showed in passing that one could associate a convex body to a linear series on a projective variety, and then use convex geometry to study such linear systems. Although Okounkov was essentially working in the classical setting of ample line bundles, it turns out that the construction goes through for an arbitrary big divisor. Moreover, this viewpoint renders transparent many basic facts about asymptotic invariants of linear series, and opens...

Curvature on a graph via its geometric spectrum

Paul Baird (2013)

Actes des rencontres du CIRM

We approach the problem of defining curvature on a graph by attempting to attach a ‘best-fit polytope’ to each vertex, or more precisely what we refer to as a configured star. How this should be done depends upon the global structure of the graph which is reflected in its geometric spectrum. Mean curvature is the most natural curvature that arises in this context and corresponds to local liftings of the graph into a suitable Euclidean space. We discuss some examples.

Currently displaying 1 – 4 of 4

Page 1