English
Related papers

Related papers: C^1-regularity for local graph representations of …

200 papers

We give a classification and a construction of all smooth $(n-1)$-dimensional varieties of lines in ${\bf P}\sp n$ verifying that all their lines meet a curve. This also gives a complete classification of $(n-1)$-scrolls over a curve…

alg-geom · Mathematics 2008-02-03 Enrique Arrondo , Marina Bertolini , Cristina Turrini

Let C be a smooth projective curve over a discretely valued field K, defined by an affine equation f(x,y)=0. We construct a model of C over the ring of integers of K using a toroidal embedding associated to the Newton polygon of f. We show…

Number Theory · Mathematics 2026-01-13 Tim Dokchitser

Let \Sigma be a minimal submanifold of \R^{n+m} that can be represented as the graph of a smooth map f:\R^n-->\R^m. We apply a formula we derived in the study of mean curvature flow to obtain conditions under which \Sigma must be an affine…

Differential Geometry · Mathematics 2007-05-23 Mu-Tao Wang

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

Combinatorics · Mathematics 2018-04-09 Asaf Ferber , Vishesh Jain

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…

Combinatorics · Mathematics 2015-04-21 Farhad Shahrokhi

We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…

Optimization and Control · Mathematics 2013-08-30 Julien M. Hendrickx , Raphaël M. Jungers , Alexander Olshevsky , Guillaume Vankeerberghen

Let $M$ be a smooth connected orientable compact surface. Denote by $F(M,S^1)$ the space of all Morse functions $f:M\to S^1$ having no critical points on the boundary of $M$ and such that for every boundary component $V$ of $M$ the…

Geometric Topology · Mathematics 2015-12-25 Sergiy Maksymenko

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

Combinatorics · Mathematics 2023-10-25 Théo Lenoir

We develop a framework for characterizing isometric immersions of simply connected, bounded, planar regions with piecewise smooth boundaries into three-dimensional space. Each immersion is associated with a framed curve along the boundary…

Differential Geometry · Mathematics 2025-08-19 Brian Seguin , Eliot Fried

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

Combinatorics · Mathematics 2007-05-23 Laszlo Lovasz , Balazs Szegedy

If there is a topologically locally constant family of smooth algebraic varieties together with an admissible normal function on the total space, then the latter is constant on any fiber if this holds on some fiber. Combined with spreading…

Algebraic Geometry · Mathematics 2014-11-25 Morihiko Saito

Graph representations are the generalization of geometric graph drawings from the plane to higher dimensions. A method introduced by Tutte to optimize properties of graph drawings is to minimize their energy. We explore this minimization…

Computational Geometry · Computer Science 2023-09-07 Matt DeVos , Danielle Rogers , Alexandra Wesolek

In this paper we prove the optimal $C^{1,1}(B_\frac12)$-regularity for a general obstacle type problem $$ \lap u = f\chi_{\{u\neq 0\}}\textup{in $B_1$}, $$ under the assumption that $f*N$ is $C^{1,1}(B_1)$, where $N$ is the Newtonian…

Analysis of PDEs · Mathematics 2011-05-05 John Andersson , Erik Lindgren , Henrik Shahgholian

We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…

Probability · Mathematics 2023-10-25 Théo Lenoir

A graph is called normal if its vertex set can be covered by cliques and also by stable sets, such that every such clique and stable set have non-empty intersection. This notion is due to Korner, who introduced the class of normal graphs as…

Combinatorics · Mathematics 2013-06-25 Zsolt Patakfalvi

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…

Analysis of PDEs · Mathematics 2022-06-10 Yannick Privat , Rémi Robin , Mario Sigalotti

Let $\rho: G \to \operatorname{GL}(V)$ be a rational representation of a reductive linear algebraic group $G$ defined over $\mathbb C$ on a finite dimensional complex vector space $V$. We show that, for any generic smooth (resp. $C^M$)…

Representation Theory · Mathematics 2012-03-19 Mark Losik , Peter W. Michor , Armin Rainer

We show that for sufficiently large $d$ and for $t\geq d+1$, there is a graph $G$ with average degree $(1-\varepsilon)\lambda t \sqrt{\ln d}$ such that almost every graph $H$ with $t$ vertices and average degree $d$ is not a minor of $G$,…

Combinatorics · Mathematics 2020-12-14 Sergey Norin , Bruce Reed , Andrew Thomason , David R. Wood

We define upper bound and lower bounds for order-preserving homogeneous of degree one maps on a proper closed cone in $\R^n$ in terms of the cone spectral radius. We also define weak upper and lower bounds for these maps. For a proper…

Dynamical Systems · Mathematics 2012-06-01 Philip Chodrow , Cole Franks , Brian Lins