Let @math be a contact form on a manifold @math , and @math a closed Legendrian submanifold. I prove that @math intersects some characteristic for @math at least twice if all characteristics are closed and of the same period, and @math embeds nicely into the product of @math and an exact symplectic manifold. As an application of the method of proof, the minimal action of a regular closed coisotropic submanifold of complex projective space is at most @math . This yields an obstruction to presymplectic embeddings, and in particular to Lagrangian embeddings.
C. Abbas @cite_17 @cite_5 @cite_19 proved the strict chord property for certain Legendrian knots in tight closed contact 3-manifolds.
@cite_19 @cite_5 @cite_17
2027438934 2603883167 2117728641 2034640236 1641082372 2118154107 2963587665 2963702702 2325575424 1966351146 2128878012 2137741537 2964237766 1968429800 1986537307 2041763757 2012430523 2079630523 2508919161 2080743555
Arnold conjectured that every Legendrian knot in the standard contact structure on the 3-sphere possesses a characteristic chord with respect to any contact form. I confirm this conjecture if the know has Thurston-Bennequin invariant −1. More generally, existence of chords is proved for a standard Legendrian unknot on the boundary of a subcritical Stein manifold of any dimension. There is also a multiplicity result which implies in some situations existence of infinitely many chords.¶The proof relies on the behaviour of symplectic homology under handle attaching. The main observation is that symplectic homology only changes in the presence of chords. Let (S, fλ) be the three sphere endowed with a contact form fλ, where λ is the standard tight contact form on S and f : S → R 0 is a smooth function. Moreover let L ⊂ S be a Legendrian knot. Then V.I. Arnold raised the conjecture in 1986 that there is a characteristic chord, i.e. an orbit x of the Reeb vectorfield that intersects the knot L at two different times. Characteristic chords are important in the theory of contact homology, see [6], [5]. Very little is known about their existence or non-existence . Using a deep result by H. Hofer, K. Wysocki and E. Zehnder about the existence of a global surface of section in strictly convex hypersurfaces in R, we observe that characteristic chords exist for certain Legendrian knots in strictly convex hypersurfaces in R. Let M be a closed three-dimensional manifold with contact form λ so that Ker λ is tight. In this paper, we will present a first application of the filling method by pseudoholomorphic curves recently developed by the author. We will show that Legendrian knots L ⊂ M satisfying suitable assumptions admit a Reeb Chord, that is, there is a trajectory x(t) of the Reeb vector field and T > 0 such that x(0),x(T) ∈ L and x(0) ≠ x(T). Given a knot K in the 3-sphere, let QK be its fundamental quan- dle as introduced by D.Joyce. Its first homology group is easily seen to be H1(QK) = Z. We prove that H2(QK) = 0 if and only if K is trivial, and H2(QK) = Z whenever K is non-trivial. An analogous result holds for links, thus characterizing trivial components. More detailed information can be derived from the conjugation quandle: let Q K be the conjugacy class of a meridian in the knot group 1(S 3 rK). We show that H2(Q K) = Z p , where p is the number of prime summands in a connected sum decomposition of K. Recently, Mullins calculated the Casson-Walker invariant of the 2-fold cyclic branched cover of an oriented link in S^3 in terms of its Jones polynomial and its signature, under the assumption that the 2-fold branched cover is a rational homology 3-sphere. Using elementary principles, we provide a similar calculation for the general case. In addition, we calculate the LMO invariant of the p-fold branched cover of twisted knots in S^3 in terms of the Kontsevich integral of the knot. We prove that the chordal contour lines of the discrete Gaussian free field converge to forms of SLE(4). Specifically, there is a constant λ > 0 such that when h is an interpolation of the discrete Gaussian free field on a Jordan domain—with boundary values −λ on one boundary arc and λ on the complementary arc—the zero level line of h joining the endpoints of these arcs converges to SLE(4) as the domain grows larger. If instead the boundary values are −a 0 on the complementary arc, then the convergence is to SLE(4; a λ - 1, b λ - 1), a variant of SLE(4). We study barycenters in the space of probability measures on a Riemannian manifold, equipped with the Wasserstein metric. Under reasonable assumptions, we establish absolute continuity of the barycenter of general measures Ω∈P(P(M))Ω∈P(P(M)) on Wasserstein space, extending on one hand, results in the Euclidean case (for barycenters between finitely many measures) of Agueh and Carlier [1] to the Riemannian setting, and on the other hand, results in the Riemannian case of Cordero-Erausquin, McCann, Schmuckenschlager [12] for barycenters between two measures to the multi-marginal setting. Our work also extends these results to the case where Ω is not finitely supported. As applications, we prove versions of Jensen's inequality on Wasserstein space and a generalized Brunn–Minkowski inequality for a random measurable set on a Riemannian manifold. We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of Kahn's result that a disjoint union of copies of Kd;d maximizes the number of independent sets of a bipartite d-regular graph, Galvin and Tet ali's result that the independence polynomial is maximized by the same, and Zhao's extension of both results to all d-regular graphs. For matchings, this shows that the matching polynomial and the total number of matchings of a d-regular graph are maximized by a union of copies of Kd;d. Using this we prove the asymptotic upper matching conjecture of Friedland, Krop, Lundow, and Markstrom. In probabilistic language, our main theorems state that for all d-regular graphs and all �, the occupancy fraction of the hard-core model and the edge occupancy fraction of the monomer-dimer model with fugacity � are maximized by Kd;d. Our method involves constrained optimization problems over distributions of random variables and applies to all d-regular graphs directly, without a reduction to the bipartite case. Using a variant of the method we prove a lower bound on the occupancy fraction of the hard-core model on any d-regular, vertex-transitive, bipartite graph: the occupancy fraction of such a graph is strictly greater than the occupancy fraction of the unique translationinvariant hard-core measure on the infinite d-regular tree 2'n, equality holding only for plane convex curves. K. Borsuk, in 1947, extended this result to n dimensional space, and, in the same paper, conjectured that the total curvature of a knot in three dimensional space must exceed 47r. A proof of this conjecture is presented below.' In proving this proposition, use will be made of a definition, suggested by R. H. Fox, of total curvature which is applicable to any closed curve. This general definition is validated by showing that the generalized total curvature K(C) is We consider tensor powers L N of a positive Hermitian line bundle (L,h L ) over a non-compact complex manifold X. In the compact case, B. Shiffman and S. Zelditch proved that the zeros of random sections become asymptotically uniformly distributed as N→∞ with respect to the natural measure coming from the curvature of L. Under certain boundedness assumptions on the curvature of the canonical line bundle of X and on the Chern form of L we prove a non-compact version of this result. We give various applications, including the limiting distribution of zeros of cusp forms with respect to the principal congruence subgroups of SL 2(ℤ) and to the hyperbolic measure, the higher dimensional case of arithmetic quotients and the case of orthogonal polynomials with weights at infinity. We also give estimates for the speed of convergence of the currents of integration on the zero-divisors. For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Euclidean space. Algorithms for constructing these triangulations will also be described. We prove that on a restricted contact type hypersurface the number of leaf-wise intersections is bounded from below by a certain cup-length. Given a closed orientable Lagrangian surface L in a closed symplectic four-manifold X together with a relative homology class d in H_2 (X , L ; Z) with vanishing boundary in H_1 (L ; Z), we prove that the algebraic number of J-holomorphic discs with boundary on L, homologous to d and passing through the adequate number of points neither depends on the choice of the points nor on the generic choice of the almost-complex structure J. We furthermore get analogous open Gromov-Witten invariants by counting, for every non-negative integer k, unions of k discs instead of single discs. We study the quantitative geometry of graphs in terms of their genus, using the structure of certain "cut graphs," i.e. subgraphs whose removal leaves a planar graph. In particular, we give optimal bounds for random partitioning schemes, as well as various types of embeddings. Using these geometric primitives, we present exponentially improved dependence on genus for a number of problems like approximate max-flow min-cut theorems, approximations for uniform and nonuniform Sparsest Cut, treewidth approximation, Laplacian eigenvalue bounds, and Lipschitz extension theorems and related metric labeling problems. We list here a sample of these improvements. All the following statements refer to graphs of genus g, unless otherwise noted. • We show that such graphs admit an O(log g)-approximate multi-commodity max-flow min-cut theorem for the case of uniform demands. This bound is optimal, and improves over the previous bound of O(g) [KPR93, FT03]. For general demands, we show that the worst possible gap is O(log g + CP), where CP is the gap for planar graphs. This dependence is optimal, and already yields a bound of O(log g + √log n), improving over the previous bound of O(√g log n) [KLMN04]. • We give an O(√log g)-approximation for the uniform Sparsest Cut, balanced vertex separator, and treewidth problems, improving over the previous bound of O(g) [FHL05]. • If a graph G has genus g and maximum degree D, we show that the kth Laplacian eigenvalue of G is (log g)2 · O(kgD n), improving over the previous bound of g2·O(kgD n) [KLPT09]. There is a lower bound of Ω(kgD n), making this result almost tight. • We show that if (X, d) is the shortest-path metric on a graph of genus g and S ⊆ X, then every L-Lipschitz map f: S → Z into a Banach space Z admits an O(L log g)-Lipschitz extension f: X → Z. This improves over the previous bound of O(Lg) [LN05], and compares to a lower bound of Ω(L√log g). In a related way, we show that there is an O(log g)-approximation for the 0-extension problem on such graphs, improving over the previous O(g) bound. • We show that every n-vertex shortest-path metric on a graph of genus g embeds into L2 with distortion O(log g + √log n), improving over the previous bound of O(√g log n). Our result is asymptotically optimal for every dependence g = g(n). We show that for every closed Riemannian manifold X there exists a positive number¶ ( > 0 ) such that for all 0 0 ) such that for every metric space Y with Gromov-Hausdorff distance to X less than¶ ( ) the geometric ( )-complex ( |Y_ | ) is homotopy equivalent to X.¶ In particular, this gives a positive answer to a question of Hausmann [4]. For any property P on n-vertex graphs, let C(P) be the minimum number of edges that need to be examined by any decision tree algorithm for determining P. In 1975 Rivest and Vuillemin settled the Aanderra-Rosenberg Conjecture, proving that C(P) = Ω(n2) for every nontrivial monotone graph property P. An intriguing open question is whether the theorem remains true when randomized algorithms are allowed. In this paper we report progress on this problem, showing that Ω(n(log n)1 12) edges must be examined by a randomized algorithm for determining any nontrivial monotone graph property. Let P be a Poisson process of intensity one in a square Sn of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph Gn,k. We prove that there exists a critical constant ccrit such that for c ccrit, Gn,⌊clog n⌋ is connected with probability tending to 1 as n → ∞. This answers a question posed by the authors in [1]. Let P be a Poisson process of intensity one in a square Sn of area n. For a fixed integer k, we join every point of P to its k nearest neighbours, creating an undirected random geometric graph GSn,k = Gn,k in which every vertex has degree at least k. The connectivity of these graphs was studied by the present authors in [1]. It is not hard to see that Gn,k becomes connected around k = �(log n), and we proved in [1] that if k(n) ≤ 0.3043log n then the probability that Gn,k(n) is connected tends to zero as n → ∞, while if k(n) ≥ 0.5139log n then the probability that Gn,k(n) is connected tends to one as n → ∞. However, we were unable to prove the natural conjecture that there exists a critical constant ccrit such that for c ccrit, P(Gn,⌊clog n⌋ is connected) → 1 as n → ∞. In this paper we prove this conjecture. Let be a complete Riemannian manifold and a probability measure on . Assume . We derive a new bound (in terms of , the injectivity radius of and an upper bound on the sectional curvatures of ) on the radius of a ball containing the support of which ensures existence and uniqueness of the global Riemannian center of mass with respect to . A significant consequence of our result is that under the best available existence and uniqueness conditions for the so-called local'' center of mass, the global and local centers coincide. In our derivation we also give an alternative proof for a uniqueness result by W. S. Kendall. As another contribution, we show that for a discrete probability measure on , under the existence and uniqueness conditions, the (global) center of mass belongs to the closure of the convex hull of the masses. We also give a refined result when is of constant curvature. [See the paper for the full abstract.] We show tight upper and lower bounds for time-space trade-offs for the @math -Approximate Near Neighbor Search problem. For the @math -dimensional Euclidean space and @math -point datasets, we develop a data structure with space @math and query time @math for every @math such that: This is the first data structure that achieves sublinear query time and near-linear space for every approximation factor @math , improving upon [Kapralov, PODS 2015]. The data structure is a culmination of a long line of work on the problem for all space regimes; it builds on Spherical Locality-Sensitive Filtering [Becker, Ducas, Gama, Laarhoven, SODA 2016] and data-dependent hashing [Andoni, Indyk, Nguyen, Razenshteyn, SODA 2014] [Andoni, Razenshteyn, STOC 2015]. Our matching lower bounds are of two types: conditional and unconditional. First, we prove tightness of the whole above trade-off in a restricted model of computation, which captures all known hashing-based approaches. We then show unconditional cell-probe lower bounds for one and two probes that match the above trade-off for @math , improving upon the best known lower bounds from [Panigrahy, Talwar, Wieder, FOCS 2010]. In particular, this is the first space lower bound (for any static data structure) for two probes which is not polynomially smaller than the one-probe bound. To show the result for two probes, we establish and exploit a connection to locally-decodable codes. The aim of this paper is to construct new topological invariants of compact oriented 3-manifolds and of framed links in such manifolds. Our invariant of (a link in) a closed oriented 3-manifold is a sequence of complex numbers parametrized by complex roots of 1. For a framed link in S 3 the terms of the sequence are equale to the values of the (suitably parametrized) Jones polynomial of the link in the corresponding roots of 1. In the case of manifolds with boundary our invariant is a (sequence of) finite dimensional complex linear operators. This produces from each root of unity q a 3-dimensional topological quantum field theory