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.
In @cite_14 K. Cieliebak proved that Legendrian spheres in the boundaries of certain subcritical Weinstein domains intersect some characteristic for @math at least twice.
@cite_14
2027438934
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. We study holomorphic spheres in certain symplectic cobordisms and derive information about periodic Reeb orbits in the concave end of these cobordisms from the non-compactness of the relevant moduli spaces. We use this to confirm the strong Weinstein conjecture (predicting the existence of null-homologous Reeb links) for various higher-dimensional contact manifolds, including contact type hypersurfaces in subcritical Stein manifolds and in some cotangent bundles. The quantitative character of this result leads to the definition of a symplectic capacity. We show that positive @math -equivariant symplectic homology is a contact invariant for a subclass of contact manifolds which are boundaries of Liouville domains. In nice cases, when the set of Conley-Zehnder indices of all good periodic Reeb orbits on the boundary of the Liouville domain is lacunary, the positive @math -equivariant symplectic homology can be computed; it is generated by those orbits. We prove a "Viterbo functoriality" property: when one Liouville domain is embedded into an other one, there is a morphism (reversing arrows) between their positive @math -equivariant symplectic homologies and morphisms compose nicely. These properties allow us to give a proof of Ustilovsky's result on the number of non isomorphic contact structures on the spheres @math . They also give a new proof of a Theorem by Ekeland and Lasry on the minimal number of periodic Reeb orbits on some hypersurfaces in @math . We extend this result to some hypersurfaces in some negative line bundles. We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i=1,...,n, are there non-crossing connectors y_i for (R_i,P_i), i.e., arc-connected sets y_i with P_i subset of y_i subset of R_i for every i=1,...,n, such that y_i and y_j are disjoint for all i different from j? We prove that non-crossing connectors do always exist if the regions form a collection of pseudo-disks, i.e., the boundaries of every pair of regions intersect at most twice. We provide a simple polynomial-time algorithm if the regions are axis-aligned rectangles. Finally we prove that the general problem is NP-complete, even if the regions are convex, the boundaries of every pair of regions intersect at most four times and P_i consists of only two points on the boundary of R_i for i=1,...,n. Multiple objects in the plane are called pseudodisks if the boundaries of any two of them intersect transversely at most twice. Given a set of @math (possibly intersecting) convex pseudodisks of @math complexity each and two points @math and @math in the plane, we present an efficient algorithm for computing a shortest @math -to- @math path avoiding the pseudodisks. After the union of the pseudodisks is computed, which can be done in @math randomized time or @math deterministic time, our algorithm runs in @math deterministic time, where @math is the size of the extended visibility graph of the union of the pseudodisks. Note that @math in the worst case. In over two decades, the previously best algorithms for this problem have not improved on the bound of @math time, even when all the pseudodisks are pairwise disjoint disks. Our technique is also applicable to a motion planning problem of finding a shortest path to translate a convex object in the plane from one location to anot... A family @math of graphs on a fixed set of @math vertices is called triangle-intersecting if for any @math , the intersection @math contains a triangle. More generally, for a fixed graph @math , a family @math is @math -intersecting if the intersection of any two graphs in @math contains a sub-graph isomorphic to @math . In [D. Ellis, Y. Filmus, and E. Friedgut, Triangle-intersecting families of graphs, J. Eur. Math. Soc. 14 (2012), pp. 841--885], Ellis, Filmus and Friedgut proved a 36-year old conjecture of Simonovits and Sos stating that the maximal size of a triangle-intersecting family is @math . Furthermore, they proved a @math -biased generalization, stating that for any @math , we have @math , where @math is the probability that the random graph @math belongs to @math . In the same paper, conjectured that the assertion of their biased theorem holds also for @math , and more generally, that for any non- @math -colorable graph @math and any @math -intersecting family @math , we have @math for all @math . In this note we construct, for any fixed @math and any @math , an @math -intersecting family @math of graphs such that @math , where @math depends only on @math and @math , thus disproving both conjectures. A set family F is said to be t-intersecting if any two sets in F share at least t elements. The Complete Intersection Theorem of Ahlswede and Khachatrian (1997) determines the maximal size f(n,k,t) of a t-intersecting family of k-element subsets of 1,2,...,n , and gives a full characterisation of the extremal families. In this paper, we prove the following stability version' of the theorem: if k n is bounded away from 0 and 1 2, and F is a t-intersecting family of k-element subsets of 1,2,...,n such that @math , then there exists an extremal family G such that @math . For fixed t, this assertion is tight up to a constant factor. This proves a conjecture of Friedgut from 2008. Our proof combines classical shifting arguments with a bootstrapping' method based upon an isoperimetric argument. In this paper we consider the degree of a typical vertex in two models of random intersection graphs introduced in [E. Godehardt, J. Jaworski, Two models of random intersection graphs for classification, in: M. Schwaiger, O. Opitz (Eds.), Exploratory Data Analysis in Empirical Research, Proceedings of the 25th Annual Conference of the Gesellschaft fur Klassifikation e.V., University of Munich, March 14-16, 2001, Springer, Berlin, Heidelberg, New York, 2002, pp. 67-81], the active and passive models. The active models are those for which vertices are assigned a random subset of a list of objects and two vertices are made adjacent when their subsets intersect. We prove sufficient conditions for vertex degree to be asymptotically Poisson as well as closely related necessary conditions. We also consider the passive model of intersection graphs, in which objects are vertices and two objects are made adjacent if there is at least one vertex in the corresponding active model ''containing'' both objects. We prove a necessary condition for vertex degree to be asymptotically Poisson for passive intersection graphs. We investigate the minimization of Newton's functional for the problem of the body of minimal resistance with maximal height @math cite butt in the class of convex developable functions defined in a disc. This class is a natural candidate to find a (non-radial) minimizer in accordance with the results of cite lrp2. We prove that the minimizer in this class has a minimal set in the form of a regular polygon with @math sides centered in the disc, and numerical experiments indicate that the natural number @math is a non-decreasing function of @math . The corresponding functions all achieve a lower value of the functional than the optimal radially symmetric function with the same height @math . The full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary @math of a set @math , as a function of @math . A weaker (but more widely-used) lower bound is @math , where equality holds iff @math is a subcube. In 2011, the first author obtained a sharp stability' version of the latter result, proving that if @math , then there exists a subcube @math such that @math . The weak' version of the edge isoperimetric inequality has the following well-known generalization for the @math -biased' measure @math on the discrete cube: if @math , or if @math and @math is monotone increasing, then @math . In this paper, we prove a sharp stability version of the latter result, which generalizes the aforementioned result of the first author. Namely, we prove that if @math , then there exists a subcube @math such that @math , where @math . This result is a central component in recent work of the authors proving sharp stability versions of a number of Erd o s-Ko-Rado type theorems in extremal combinatorics, including the seminal complete intersection theorem' of Ahlswede and Khachatrian. In addition, we prove a biased-measure analogue of the full' edge isoperimetric inequality, for monotone increasing sets, and we observe that such an analogue does not hold for arbitrary sets, hence answering a question of Kalai. We use this result to give a new proof of the full' edge isoperimetric inequality, one relying on the Kruskal-Katona theorem. We show that the category of coherent sheaves on the toric boundary divisor of a smooth quasiprojective DM toric stack is equivalent to the wrapped Fukaya category of a hypersurface in a complex torus. Hypersurfaces with every Newton polytope can be obtained. Our proof has the following ingredients. Using Mikhalkin-Viro patchworking, we compute the skeleton of the hypersurface. The result matches the [FLTZ] skeleton and is naturally realized as a Legendrian in the cosphere bundle of a torus. By [GPS1, GPS2, GPS3], we trade wrapped Fukaya categories for microlocal sheaf theory. By proving a new functoriality result for Bondal's coherent-constructible correspondence, we reduce the sheaf calculation to Kuwagaki's recent theorem on mirror symmetry for toric varieties. In this article we consider large energy wave maps in dimension 2+1, as in the resolution of the threshold conjecture by Sterbenz and Tataru (Commun. Math. Phys. 298(1):139–230, 2010; Commun. Math. Phys. 298(1):231–264, 2010), but more specifically into the unit Euclidean sphere ( S ^ n-1 R ^ n ) with ( n ), and study further the dynamics of the sequence of wave maps that are obtained in Sterbenz and Tataru (Commun. Math. Phys. 298(1):231–264, 2010) at the final rescaling for a first, finite or infinite, time singularity. We prove that, on a suitably chosen sequence of time slices at this scaling, there is a decomposition of the map, up to an error with asymptotically vanishing energy, into a decoupled sum of rescaled solitons concentrating in the interior of the light cone and a term having asymptotically vanishing energy dispersion norm, concentrating on the null boundary and converging to a constant locally in the interior of the cone, in the energy space. Similar and stronger results have been recently obtained in the equivariant setting by several authors (Cote, Commun. Pure Appl. Math. 68(11):1946–2004, 2015; Cote, Commun. Pure Appl. Math. 69(4):609–612, 2016; Cote, Am. J. Math. 137(1):139–207, 2015; , Am. J. Math. 137(1):209–250, 2015; Krieger, Commun. Math. Phys. 250(3):507–580, 2004), where better control on the dispersive term concentrating on the null boundary of the cone is provided, and in some cases the asymptotic decomposition is shown to hold for all time. Here, however, we do not impose any symmetry condition on the map itself and our strategy follows the one from bubbling analysis of harmonic maps into spheres in the supercritical regime due to Lin and Riviere (Ann. Math. 149(2):785–829, 1999; Duke Math. J. 111:177–193, 2002), which we make work here in the hyperbolic context of Sterbenz and Tataru (Commun. Math. Phys. 298(1), 231–264, 2010). A family of sets is said to be if its automorphism group is transitive, and if any two sets in the family have nonempty intersection. Our purpose here is to study the following question: for @math with @math , how large can a symmetric intersecting family of @math -element subsets of @math be? As a first step towards a complete answer, we prove that such a family has size at most [ (- c(n-2k) n k( n - k) ) n k , ] where @math is a universal constant. We also describe various combinatorial and algebraic approaches to constructing such families. This paper advocates a novel framework for segmenting a dataset in a Riemannian manifold @math into clusters lying around low-dimensional submanifolds of @math . Important examples of @math , for which the proposed clustering algorithm is computationally efficient, are the sphere, the set of positive definite matrices, and the Grassmannian. The clustering problem with these examples of @math is already useful for numerous application domains such as action identification in video sequences, dynamic texture clustering, brain fiber segmentation in medical imaging, and clustering of deformed images. The proposed clustering algorithm constructs a data-affinity matrix by thoroughly exploiting the intrinsic geometry and then applies spectral clustering. The intrinsic local geometry is encoded by local sparse coding and more importantly by directional information of local tangent spaces and geodesics. Theoretical guarantees are established for a simplified variant of the algorithm even when the clusters intersect. To avoid complication, these guarantees assume that the underlying submanifolds are geodesic. Extensive validation on synthetic and real data demonstrates the resiliency of the proposed method against deviations from the theoretical model as well as its superior performance over state-of-the-art techniques. We consider the relationship of the geometry of compact Riemannian manifolds with boundary to the first nonzero eigenvalue σ1 of the Dirichlet-to-Neumann map (Steklov eigenvalue). For surfaces Σ with genus γ and k boundary components we obtain the upper bound σ1L(∂Σ)⩽2(γ+k)π. For γ=0 and k=1 this result was obtained by Weinstock in 1954, and is sharp. We attempt to find the best constant in this inequality for annular surfaces (γ=0 and k=2). For rotationally symmetric metrics we show that the best constant is achieved by the induced metric on the portion of the catenoid centered at the origin which meets a sphere orthogonally and hence is a solution of the free boundary problem for the area functional in the ball. For a general class of (not necessarily rotationally symmetric) metrics on the annulus, which we call supercritical, we prove that σ1(Σ)L(∂Σ) is dominated by that of the critical catenoid with equality if and only if the annulus is conformally equivalent to the critical catenoid by a conformal transformation which is an isometry on the boundary. Motivated by the annulus case, we show that a proper submanifold of the ball is immersed by Steklov eigenfunctions if and only if it is a free boundary solution. We then prove general upper bounds for conformal metrics on manifolds of any dimension which can be properly conformally immersed into the unit ball in terms of certain conformal volume quantities. We show that these bounds are only achieved when the manifold is minimally immersed by first Steklov eigenfunctions. We also use these ideas to show that any free boundary solution in two dimensions has area at least π, and we observe that this implies the sharp isoperimetric inequality for free boundary solutions in the two-dimensional case. A family of sets is said to be if any two sets in the family have nonempty intersection. In 1973, Erd o s raised the problem of determining the maximum possible size of a union of @math different intersecting families of @math -element subsets of an @math -element set, for each triple of integers @math . We make progress on this problem, proving that for any fixed integer @math and for any @math , if @math is an @math -element set, and @math , where each @math is an intersecting family of @math -element subsets of @math , then @math , with equality only if @math for some @math with @math . This is best possible up to the size of the @math term, and improves a 1987 result of Frankl and F "uredi, who obtained the same conclusion under the stronger hypothesis @math , in the case @math . Our proof utilises an isoperimetric, influence-based method recently developed by Keller and the authors. Let @math be the largest component of the Erdős–Renyi random graph @math . The mixing time of random walk on @math in the strictly supercritical regime, p = c n with fixed c > 1, was shown to have order log2n by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald. In the critical window, p = (1 + e) n where λ = e3n is bounded, Nachmias and Peres proved that the mixing time on @math is of order n. However, it was unclear how to interpolate between these results, and estimate the mixing time as the giant component emerges from the critical window. Indeed, even the asymptotics of the diameter of @math in this regime were only recently obtained by Riordan and Wormald, as well as the present authors and Kim. In this paper, we show that for p = (1 + e) n with λ = e3n → ∞ and λ = o(n), the mixing time on @math is with high probability of order (n λ)log2λ. In addition, we show that this is the order of the largest mixing time over all components, both in the slightly supercritical and in the slightly subcritical regime [i.e., p = (1 − e) n with λ as above]. We consider the problem of finding the minimizer of a convex function @math of the form @math where a low-rank factorization of @math is readily available. We consider the regime where @math . As second-order methods prove to be effective in finding the minimizer to a high-precision, in this work, we propose randomized Newton-type algorithms that exploit sub-sampling of @math , as well as inexact updates, as means to reduce the computational complexity. Two non-uniform sampling distributions based on block norm squares and block partial leverage scores are considered in order to capture important terms among @math . We show that at each iteration non-uniformly sampling at most @math terms from @math is sufficient to achieve a linear-quadratic convergence rate in @math when a suitable initial point is provided. In addition, we show that our algorithms achieve a lower computational complexity and exhibit more robustness and better dependence on problem specific quantities, such as the condition number, compared to similar existing methods, especially the ones based on uniform sampling. Finally, we empirically demonstrate that our methods are at least twice as fast as Newton's methods with ridge logistic regression on several real datasets. Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk. At any time the robots can move anywhere they choose on the disk, independently of each other, with maximum speed @math . The robots can cooperate by exchanging information whenever they meet. We study algorithms for the two robots to minimize the evacuation time: the time when both robots reach the exit. In [CGGKMP14] the authors gave an algorithm defining trajectories for the two robots yielding evacuation time at most @math and also proved that any algorithm has evacuation time at least @math . We improve both the upper and lower bounds on the evacuation time of a unit disk. Namely, we present a new non-trivial algorithm whose evacuation time is at most @math and show that any algorithm has evacuation time at least @math . To achieve the upper bound, we designed an algorithm which non-intuitively proposes a forced meeting between the two robots, even if the exit has not been found by either of them.