Using stable log maps, we introduce log twisted differentials extending the notion of abelian differentials to the Deligne-Mumford boundary of stable curves. The moduli stack of log twisted differentials provides a compactification of the strata of abelian differentials. The open strata can have up to three connected components, due to spin and hyperelliptic structures. We prove that the spin parity can be distinguished on the boundary of the log compactification. Moreover, combining the techniques of log geometry and admissible covers, we introduce log twisted hyperelliptic differentials, and prove that their moduli stack provides a toroidal compactification of the hyperelliptic loci in the open strata.
There are several recent attempts to study degeneration of abelian differentials from the classical viewpoint without using log structures, i.e., compactifying the strata in the Hodge bundle over @math (resp. in @math ) using twisted differentials (resp. twisted canonical divisors). Gendron ( @cite_31 ) proved the smoothability of twisted differentials when they have zero residues at all nodes. The first author ( @cite_22 ) studied twisted canonical divisors on curves of pseudo-compact type. Farkas and Pandharipande ( @cite_25 ) studied systematically the space of twisted canonical divisors and showed that it is in general reducible, which contains, besides the closure of the stratum, a number of boundary components that have dimension one less than the dimension of the stratum. Finally in @cite_11 a crucial global residue condition was found and used to isolate the closure of the stratum. As mentioned before, the moduli space @math of log twisted differentials maps onto the Farkas-Pandharipande space of twisted canonical divisors, hence it also contains extra boundary components. Nevertheless, there is a way to implant the global residue condition under the log setting to isolate the main component, which will be addressed in our future work.
@cite_31 @cite_25 @cite_22 @cite_11
2537454422 2320222014 2342521385 2244320003 1968429800 1743277569 2613622891 2107101459 1645016350 2276886773 2170546552 2073656615 2949485285 2734934103 2534944111 2019049541 2752965000 2472026787 1599439450 2085186189
Using stable log maps, we introduce log twisted differentials extending the notion of abelian differentials to the Deligne-Mumford boundary of stable curves. The moduli stack of log twisted differentials provides a compactification of the strata of abelian differentials. The open strata can have up to three connected components, due to spin and hyperelliptic structures. We prove that the spin parity can be distinguished on the boundary of the log compactification. Moreover, combining the techniques of log geometry and admissible covers, we introduce log twisted hyperelliptic differentials, and prove that their moduli stack provides a toroidal compactification of the hyperelliptic loci in the open strata. We give a log-geometric description of the space of twisted canonical divisors constructed by Farkas--Pandharipande. In particular, we introduce the notion of a principal rubber @math -log-canonical divisor, and we study its moduli space. It is a proper Deligne--Mumford stack admitting a perfect obstruction theory whose virtual fundamental cycle is of dimension @math . In the so-called strictly meromorphic case with @math , the moduli space is of the expected dimension and the push-forward of its virtual fundamental cycle to the moduli space of stable curves equals the weighted fundamental class of the moduli space of twisted canonical divisors. Conjecturally, it yields a formula of Pixton generalizing the double ramification cycle in the moduli space of stable curves. We describe the closure of the strata of abelian differentials with prescribed type of zeros and poles, in the projectivized Hodge bundle over the Deligne-Mumford moduli space of stable curves with marked points. We provide an explicit characterization of pointed stable differentials in the boundary of the closure, both a complex analytic proof and a flat geometric proof for smoothing the boundary differentials, and numerous examples. The main new ingredient in our description is a global residue condition arising from a full order on the dual graph of a stable curve. The moduli space of canonical divisors (with prescribed zeros and poles) on nonsingular curves is not compact since the curve may degenerate. We define a proper moduli space of twisted canonical divisors in the moduli space of Deligne-Mumford stable pointed curves which includes the space of canonical divisors as an open subset. The theory leads to geometric combinatorial constraints on the closures of the moduli spaces of canonical divisors. In case the differentials have at least one pole (the strictly meromorphic case), the moduli spaces of twisted canonical divisors on genus g curves are of pure codimension g in the moduli spaces of stable pointed curves. In addition to the closure of the canonical divisors on nonsingular curves, the moduli spaces have virtual components. In the Appendix, a complete proposal relating the sum of the fundamental classes of all components (with intrinsic multiplicities) to a formula of Pixton is proposed. The result is a precise and explicit conjecture in the tautological ring for the weighted fundamental class of the moduli spaces of twisted canonical divisors. As a consequence of the conjecture, the classes of the closures of the moduli spaces of canonical divisors on nonsingular curves are determined (both in the holomorphic and meromorphic cases). 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). The main goal of this work is to construct and study a reasonable compactification of the strata of the moduli space of Abelian differentials. This allows us to compute the Kodaira dimension of some strata of the moduli space of Abelian differentials. The main ingredients to study the compactifications of the strata are a version of the plumbing cylinder construction for differential forms and an extension of the parity of the connected components of the strata to the differentials on curves of compact type. We study in detail the compactifications of the hyperelliptic minimal strata and of the odd minimal stratum in genus three. Using the Minimal Model Program, any degeneration of K-trivial varieties can be arranged to be in a Kulikov type form, i.e. with trivial relative canonical divisor and mild singularities. In the hyper-K "ahler setting, we can then deduce a finiteness statement for monodromy acting on @math , once one knows that one component of the central fiber is not uniruled. Independently of this, using deep results from the geometry of hyper-K "ahler manifolds, we prove that a finite monodromy projective degeneration of hyper-K "ahler manifolds has a smooth filling (after base change and birational modifications). As a consequence of these two results, we prove a generalization of Huybrechts' theorem about birational versus deformation equivalence, allowing singular central fibers. As an application, we give simple proofs for the deformation type of certain geometric constructions of hyper-K "ahler manifolds (e.g. Debarre--Voisin or Laza--Sacc a--Voisin). In a slightly different direction, we establish some basic properties (dimension and rational homology type) for the dual complex of a Kulikov type degeneration of hyper-K "ahler manifolds. We study quantitatively the effective large-scale behavior of discrete elliptic equations on the lattice ( Z^d ) with random coefficients. The theory of stochastic homogenization relates the random, stationary, and ergodic field of coefficients with a deterministic matrix of effective coefficients. This is done via the corrector problem, which can be viewed as a highly degenerate elliptic equation on the infinite-dimensional space of admissible coefficient fields. In this contribution we develop new quantitative methods for the corrector problem based on the assumption that ergodicity holds in the quantitative form of a Spectral Gap Estimate w.r.t. a Glauber dynamics on coefficient fields—as it is the case for independent and identically distributed coefficients. As a main result we prove an optimal decay in time of the semigroup associated with the corrector problem (i.e. of the generator of the process called “random environment as seen from the particle”). As a corollary we recover existence of stationary correctors (in dimensions (d>2 )) and prove new optimal estimates for regularized versions of the corrector (in dimensions (d 2 )). We also give a self-contained proof of a new estimate on the gradient of the parabolic, variable-coefficient Green’s function, which is a crucial analytic ingredient in our approach. As an application of these results, we prove the first (and optimal) estimates for the approximation of the homogenized coefficients by the popular periodization method in case of independent and identically distributed coefficients. Let f be a polynomial of degree n in ZZ[x_1,..,x_n], typically reducible but squarefree. From the hypersurface f=0 one may construct a number of other subschemes Y by extracting prime components, taking intersections, taking unions, and iterating this procedure. We prove that if the number of solutions to f=0 in ^n is not a multiple of p, then all these intersections in ^n_ just described are reduced. (If this holds for infinitely many p, then it holds over as well.) More specifically, there is a_Frobenius splitting_ on ^n_ compatibly splitting all these subschemes Y . We determine when a Gr "obner degeneration f_0=0 of such a hypersurface f=0 is again such a hypersurface. Under this condition, we prove that compatibly split subschemes degenerate to compatibly split subschemes, and stay reduced. Our results are strongest in the case that f's lexicographically first term is i=1 ^n x_i. Then for all large p, there is a Frobenius splitting that compatibly splits f's hypersurface and all the associated Y . The Gr "obner degeneration Y' of each such Y is a reduced union of coordinate spaces (a Stanley-Reisner scheme), and we give a result to help compute its Gr "obner basis. We exhibit an f whose associated Y include Fulton's matrix Schubert varieties, and recover much more easily the Gr "obner basis theorem of [Knutson-Miller '05]. We show that in Bott-Samelson coordinates on an opposite Bruhat cell X^v_ in G B, the f defining the complement of the big cell also has initial term i=1 ^n x_i, and hence the Kazhdan-Lusztig subvarieties X^v_ w degenerate to Stanley-Reisner schemes. This recovers, in a weak form, the main result of [Knutson '08]. Curves of genus g which admit a map to CP1 with specified ramification profile mu over 0 and nu over infinity define a double ramification cycle DR_g(mu,nu) on the moduli space of curves. The study of the restrictions of these cycles to the moduli of nonsingular curves is a classical topic. In 2003, Hain calculated the cycles for curves of compact type. We study here double ramification cycles on the moduli space of Deligne-Mumford stable curves. The cycle DR_g(mu,nu) for stable curves is defined via the virtual fundamental class of the moduli of stable maps to rubber. Our main result is the proof of an explicit formula for DR_g(mu,nu) in the tautological ring conjectured by Pixton in 2014. The formula expresses the double ramification cycle as a sum over stable graphs (corresponding to strata classes) with summand equal to a product over markings and edges. The result answers a question of Eliashberg from 2001 and specializes to Hain's formula in the compact type case. When mu and nu are both empty, the formula for double ramification cycles expresses the top Chern class lambda_g of the Hodge bundle of the moduli space of stable genus g curves as a push-forward of tautological classes supported on the divisor of nonseparating nodes. Applications to Hodge integral calculations are given. Mulmuley [Mul12a] recently gave an explicit version of Noether’s Normalization lemma for ring of invariants of matrices under simultaneous conjugation, under the conjecture that there are deterministic black-box algorithms for polynomial identity testing (PIT). He argued that this gives evidence that constructing such algorithms for PIT is beyond current techniques. In this work, we show this is not the case. That is, we improve Mulmuley’s reduction and correspondingly weaken the conjecture regarding PIT needed to give explicit Noether Normalization. We then observe that the weaker conjecture has recently been nearly settled by the authors ([FS12]), who gave quasipolynomial size hitting sets for the class of read-once oblivious algebraic branching programs (ROABPs). This gives the desired explicit Noether Normalization unconditionally, up to quasipolynomial factors. As a consequence of our proof we give a deterministic parallel polynomial-time algorithm for deciding if two matrix tuples have intersecting orbit closures, under simultaneous conjugation. We also study the strength of conjectures that Mulmuley requires to obtain similar results as ours. We prove that his conjectures are stronger, in the sense that the computational model he needs PIT algorithms for is equivalent to the well-known algebraic branching program (ABP) model, which is provably stronger than the ROABP model. Finally, we consider the depth-3 diagonal circuit model as defined by Saxena [Sax08], as PIT algorithms for this model also have implications in Mulmuley’s work. Previous work (such as [ASS12] and [FS12]) have given quasipolynomial size hitting sets for this model. In this work, we give a much simpler construction of such hitting sets, using techniques of Shpilka and Volkovich [SV09]. In the present paper we analyze a class of tensor-structured preconditioners for the multidimensional second-order elliptic operators in ℝ d , d≥2. For equations in a bounded domain, the construction is based on the rank-R tensor-product approximation of the elliptic resolvent ℬ R ≈(ℒ−λ I)−1, where ℒ is the sum of univariate elliptic operators. We prove the explicit estimate on the tensor rank R that ensures the spectral equivalence. For equations in an unbounded domain, one can utilize the tensor-structured approximation of Green’s kernel for the shifted Laplacian in ℝ d , which is well developed in the case of nonoscillatory potentials. For the oscillating kernels e −i κ‖x‖ ‖x‖, x∈ℝ d , κ∈ℝ+, we give constructive proof of the rank-O(κ) separable approximation. This leads to the tensor representation for the discretized 3D Helmholtz kernel on an n×n×n grid that requires only O(κ |log e|2 n) reals for storage. Such representations can be applied to both the 3D volume and boundary calculations with sublinear cost O(n 2), even in the case κ=O(n). This paper proves that an "old dog", namely -- the classical Johnson-Lindenstrauss transform, "performs new tricks" -- it gives a novel way of preserving differential privacy. We show that if we take two databases, @math and @math , such that (i) @math is a rank-1 matrix of bounded norm and (ii) all singular values of @math and @math are sufficiently large, then multiplying either @math or @math with a vector of iid normal Gaussians yields two statistically close distributions in the sense of differential privacy. Furthermore, a small, deterministic and alteration of the input is enough to assert that all singular values of @math are large. We apply the Johnson-Lindenstrauss transform to the task of approximating cut-queries: the number of edges crossing a @math -cut in a graph. We show that the JL transform allows us to that preserves edge differential privacy (where two graphs are neighbors if they differ on a single edge) while adding only @math random noise to any given query (w.h.p). Comparing the additive noise of our algorithm to existing algorithms for answering cut-queries in a differentially private manner, we outperform all others on small cuts ( @math ). We also apply our technique to the task of estimating the variance of a given matrix in any given direction. The JL transform allows us to that preserves differential privacy w.r.t bounded changes (each row in the matrix can change by at most a norm-1 vector) while adding random noise of magnitude independent of the size of the matrix (w.h.p). In contrast, existing algorithms introduce an error which depends on the matrix dimensions. 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. We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly. Our findings lead to answers for a number of problems, a sampling of which includes: • We present a poly log n round deterministic algorithm for (2Δ−1)·(1+o(1))-edge-coloring, where Δ denotes the maximum degree. Modulo the 1 + o(1) factor, this settles one of the long-standing open problems of the area from the 1990's (see e.g. Panconesi and Srinivasan [PODC'92]). Indeed, a weaker requirement of (2Δ − 1) · poly log Δ-edge-coloring in poly log n rounds was asked for in the 4th open question in the Distributed Graph Coloring book by Barenboim and Elkin. • We show that sinkless orientation---i.e., orienting edges such that each node has at least one out-going edge---on Δ-regular graphs can be solved in O(logΔ log n) rounds randomized and in O(logΔ n) rounds deterministically. These prove the corresponding lower bounds by [STOC'16] and Chang, Kopelowitz, and Pettie [FOCS'16] to be tight. Moreover, these show that sinkless orientation exhibits an exponential separation between its randomized and deterministic complexities, akin to the results of for Δ-coloring Δ-regular trees. • We present a randomized O(log4 n) round algorithm for orienting a-arboricity graphs with maximum out-degree a(1 + e). This can be also turned into a decomposition into a(1 + e) forests when a = Ω(log n) and into a(1 + e) pseduo-forests when a = o(log n). Obtaining an efficient distributed decomposition into less than 2a forests was stated as the 10th open problem in the book by Barenboim and Elkin. Abstract By looking at fractional D p -branes of type IIA on T 4 Z 2 as wrapped branes and by using boundary state techniques we construct the effective low-energy action for the fields generated by fractional branes, build their worldvolume action and find the corresponding classical geometry. The explicit form of the classical background is consistent only outside an enhancon sphere of radius r e , which encloses a naked singularity of repulson-type. The perturbative running of the gauge coupling constant, dictated by the NS–NS twisted field that keeps its one-loop expression at any distance, also fails at r e . Recently, plugging trainable structural layers into deep convolutional neural networks (CNNs) as image representations has made promising progress. However, there has been little work on inserting parametric probability distributions, which can effectively model feature statistics, into deep CNNs in an end-to-end manner. This paper proposes a Global Gaussian Distribution embedding Network (G2DeNet) to take a step towards addressing this problem. The core of G2DeNet is a novel trainable layer of a global Gaussian as an image representation plugged into deep CNNs for end-to-end learning. The challenge is that the proposed layer involves Gaussian distributions whose space is not a linear space, which makes its forward and backward propagations be non-intuitive and non-trivial. To tackle this issue, we employ a Gaussian embedding strategy which respects the structures of both Riemannian manifold and smooth group of Gaussians. Based on this strategy, we construct the proposed global Gaussian embedding layer and decompose it into two sub-layers: the matrix partition sub-layer decoupling the mean vector and covariance matrix entangled in the embedding matrix, and the square-rooted, symmetric positive definite matrix sub-layer. In this way, we can derive the partial derivatives associated with the proposed structural layer and thus allow backpropagation of gradients. Experimental results on large scale region classification and fine-grained recognition tasks show that G2DeNet is superior to its counterparts, capable of achieving state-of-the-art performance. Relations among tautological classes on the moduli space of stable curves are obtained via the study of Witten's r-spin theory for higher r. In order to calculate the quantum product, a new formula relating the r-spin correlators in genus 0 to the representation theory of sl2 is proven. The Givental-Teleman classification of CohFTs is used at two special semisimple points of the associated Frobenius manifold. At the first semisimple point, the R-matrix is exactly solved in terms of hypergeometric series. As a result, an explicit formula for Witten's r-spin class is obtained (along with tautological relations in higher degrees). As an application, the r=4 relations are used to bound the Betti numbers of the tautological ring of the moduli of nonsingular curves. At the second semisimple point, the form of the R-matrix implies a polynomiality property in r of Witten's r-spin class. In the Appendix (with F. Janda), a conjecture relating the r=0 limit of Witten's r-spin class to the class of the moduli space of holomorphic differentials is presented. We study individual eigenstates of quantized area-preserving maps on the 2-torus which are classically chaotic. In order to analyze their semiclassical behavior, we use the Bargmann–Husimi representations for quantum states as well as their stellar parametrization, which encodes states through a minimal set of points in phase space (the constellation of zeros of the Husimi density). We rigorously prove that a semiclassical uniform distribution of Husimi densities on the torus entails a similar equidistribution for the corresponding constellations. We deduce from this property a universal behavior for the phase patterns of chaotic Bargmann eigenfunctions which is reminiscent of the WKB approximation for eigenstates of integrable systems (though in a weaker sense). In order to obtain more precise information on “chaotic eigenconstellations,” we then model their properties by ensembles of random states, generalizing former results on the 2-sphere to the torus geometry. This approach yields statistical predictions for the constellations which fit quite well the chaotic data. We finally observe that specific dynamical information, e.g., the presence of high peaks (like scars) in Husimi densities, can be recovered from the knowledge of a few long-wavelength Fourier coefficients, which therefore appear as valuable order parameters at the level of individual chaotic eigenfunctions. We consider a random, uniformly elliptic coefficient field (a(x) ) on the (d )-dimensional integer lattice ( Z ^d ). We are interested in the spatial decay of the quenched elliptic Green function (G(a;x,y) ). Next to stationarity, we assume that the spatial correlation of the coefficient field decays sufficiently fast to the effect that a logarithmic Sobolev inequality holds for the ensemble ( ). We prove that all stochastic moments of the first and second mixed derivatives of the Green function, that is, ( | _x G(x,y)|^p ) and ( | _x _y G(x,y)|^p ), have the same decay rates in (|x-y| 1 ) as for the constant coefficient Green function, respectively. This result relies on and substantially extends the one by Delmotte and Deuschel (Probab Theory Relat Fields 133:358–390, 2005), which optimally controls second moments for the first derivatives and first moments of the second mixed derivatives of (G ), that is, ( | _x G(x,y)|^2 ) and ( | _x _y G(x,y)| ). As an application, we are able to obtain optimal estimates on the random part of the homogenization error even for large ellipticity contrast.