We introduce a space of stable meromorphic differentials with poles of prescribed orders and define its tautological cohomology ring. This space, just as the space of holomorphic differentials, is stratified according to the set of multiplicities of zeros of the differential. The main goal of this paper is to compute the Poincar 'e-dual cohomology classes of all strata. We prove that all these classes are tautological and give an algorithm to compute them. In a second part of the paper we study the Picard group of the strata. We use the tools introduced in the first part to deduce several relations in these Picard groups.
* Incidence variety compactification. The problem of the compactification of the strata is extensively studied from different approaches in a joint work of Bainbridge, Chen, Gendron, Grushevsky, and Moeller (see @cite_13 and @cite_26 ). Their compactification (called incidence variety compactification ) is slightly different from the one that we use here. We will recall their definitions in since we will make use of some of their results.
@cite_26 @cite_13
1743277569 1645016350 2952970674 2135572587 2278052651 2052952091 2034079307 2602284421 2026924428 2105546154 2782043549 1991634974 179407972 1900856771 2026202150 1615542443 2010942428 2523448217 2113502771 2107101459
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. 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]. We study the intersections of general Schubert varieties X_w with permuted big cells, and give an inductive degeneration of each such "Schubert patch" to a Stanley-Reisner scheme. Similar results had been known for Schubert patches in various types of Grassmannians. We maintain reducedness using the results of [Knutson 2007] on automatically reduced degenerations, or through more standard cohomology-vanishing arguments. The underlying simplicial complex of the Stanley-Reisner scheme is a subword complex, as introduced for slightly different purposes in [Knutson-Miller 2004], and is homeomorphic to a ball. This gives a new proof of the Andersen-Jantzen-Soergel Billey and Graham Willems formulae for restrictions of equivariant Schubert classes to fixed points. Given a smooth toric variety X and an ample line bundle O(1), we construct a sequence of Lagrangian submanifolds of (C^*)^n with boundary on a level set of the Landau-Ginzburg mirror of X. The corresponding Floer homology groups form a graded algebra under the cup product which is canonically isomorphic to the homogeneous coordinate ring of X. This paper considers the effect of stochasticity on the quality of convergence of genetic algorithms (GAs). In many problems, the variance of building-block fitness or so-called collateral noise is the major source of variance, and a population-sizing equation is derived to ensure that average signal-to-collateral-noise ratios are favorable to the discrimination of the best building blocks required to solve a problem of bounded deception. The sizing relation is modified to permit the inclusion of other sources of stochasticity, such as the noise of selection, the noise of genetic operators, and the explicit noise or nondeterminism of the objective function. In a test suite of five functions, the sizing relation proves to be a conservative predictor of average correct convergence, as long as all major sources of noise are considered in the sizing calculation. These results suggest how the sizing equation may be viewed as a coarse delineation of a boundary between what a physicist might call two distinct phases of GA behavior. At low population sizes the GA makes many errors of decision, and the quality of convergence is largely left to the vagaries of chance or the serial fixup of flawed results through mutation or other serial injection of diversity. At large population sizes, GAs can reliably discriminate between good and bad building blocks, and parallel processing and recombination of building blocks lead to quick solution of even difficult deceptive problems. Additionally, the paper outlines a number of extensions to this work, including the development of more refined models of the relation between generational average error and ultimate convergence quality, the development of online methods for sizing populations via the estimation of populations via the estimation of population-sizing parameters, and the investigation of populationsizing in the context of niching and other schemes designed for use in problems with high cardinality solution sets. The paper also discusses how these results may one day lead to rigorous proofs of convergence for recombinative G As operating on problems of bounded description. Over the past decade, physicists have developed deep but non-rigorous techniques for studying phase transitions in discrete structures. Recently, their ideas have been harnessed to obtain improved rigorous results on the phase transitions in binary problems such as random @math -SAT or @math -NAESAT (e.g., Coja-Oghlan and Panagiotou: STOC 2013). However, these rigorous arguments, typically centered around the second moment method, do not extend easily to problems where there are more than two possible values per variable. The single most intensely studied example of such a problem is random graph @math -coloring. Here we develop a novel approach to the second moment method in this problem. This new method, inspired by physics conjectures on the geometry of the set of @math -colorings, allows us to establish a substantially improved lower bound on the @math -colorability threshold. The new lower bound is within an additive @math of a simple first-moment upper bound and within @math of the physics conjecture. By comparison, the best previous lower bound left a gap of about @math , unbounded in terms of the number of colors [Achlioptas, Naor: STOC 2004]. Let ( A ) be finite relational structure of finite type, and let CSP ( ( A) ) denote the following decision problem: if ( I ) is a given structure of the same type as ( A ) , is there a homomorphism from ( I ) to ( A )? To each relational structure ( A ) is associated naturally an algebra ( A ) whose structure determines the complexity of the associated decision problem. We investigate those finite algebras arising from CSP’s of so-called bounded width, i.e., for which local consistency algorithms effectively decide the problem. We show that if a CSP has bounded width then the variety generated by the associated algebra omits the Hobby-McKenzie types 1 and 2. This provides a method to prove that certain CSP’s do not have bounded width. We give several applications, answering a question of Nesetřil and Zhu [26], by showing that various graph homomorphism problems do not have bounded width. Feder and Vardi [17] have shown that every CSP is polynomial-time equivalent to the retraction problem for a poset we call the Feder − Vardi poset of the structure. We show that, in the case where the structure has a single relation, if the retraction problem for the Feder-Vardi poset has bounded width then the CSP for the structure also has bounded width. This is used to exhibit a finite order-primal algebra whose variety admits type 2 but omits type 1 (provided P ≠ NP). This is the second article of a series of papers on stochastic homogenization of discrete elliptic equations. We consider a discrete elliptic equation on the @math -dimensional lattice @math with random coefficients @math of the simplest type: They are identically distributed and independent from edge to edge. On scales large w. r. t. the lattice spacing (i. e. unity), the solution operator is known to behave like the solution operator of a (continuous) elliptic equation with constant deterministic coefficients. This symmetric ''homogenized'' matrix @math is characterized by @math for any direction @math , where the random field @math (the ''corrector'') is the unique solution of @math in @math such that @math , @math is stationary and @math , @math denoting the ensemble average (or expectation). In order to approximate the homogenized coefficients @math , the corrector problem is usually solved in a box @math of size @math with periodic boundary conditions, and the space averaged energy on @math defines an approximation @math of @math . Although the statistics is modified (independence is replaced by periodic correlations) and the ensemble average is replaced by a space average, the approximation @math converges almost surely to @math as @math . In this paper, we give estimates on both errors. To be more precise, we do not consider periodic boundary conditions on a box of size @math , but replace the elliptic operator by @math with (typically) @math , as standard in the homogenization literature. We then replace the ensemble average by a space average on @math , and estimate the overall error on the homogenized coefficients in terms of @math and @math . where (an)n ENo is some sequence of nonnegative numbers, (Sn),nENo is the sequence of partial sums, S0 = 0, Sn = XflXk, of another sequence (Xk)kEN of i.i.d. random variables, and A c R is a fixed Borel set such as [0,1] or [0, oo). Examples of such convolution series are subordinated distributions (f=0Oan = 1) which arise as distributions of random sums, and harmonic and ordinary renewal measures (a0 = 0, an = 1 n for all n C N in the first, an = 1 for all n C NO in the second case). These examples are in turn essential for the analysis of the large time behaviour of diverse applied models such as branching and queueing processes, they are also of interest in connection with representation theorems such as the Levy representation of infinitely divisible distributions. A traditional approach to such problems is via regular variation: If the underlying random variables are nonnegative we can use Laplace transforms and the related Abelian and Tauberian theorems [see, e.g., Stam (1973) in the context of subordination and Feller (1971, XIV.3) in connection with renewal theory; Embrechts, Maejima, and Omey (1984) is a recent treatment of generalized renewal measures along these lines]. The approach of the present paper is based on the Wiener-Levy-Gel'fand theorem and has occasionally been called the Banach algebra method. In Gruibel (1983) we gave a new variant of this method for the special case of lattice distributions, showing that by using the appropriate Banach algebras of sequences, arbitrarily fine expansions are possible under certain assumptions on the higher-order differences of (P(X1 = n))fnEN. Here we give a corresponding treatment of nonlattice distributions. We restrict ourselves to an analogue of first-order differences and obtain a number of theorems which perhaps are described best as next-term results. To explain this let us consider a special case in more detail. We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study of the space of proper colorings (solutions). We show that for a fixed number of colors and as the average vertex degree (number of constraints) increases, the set of solutions undergoes several phase transitions similar to those observed in the mean field theory of glasses. First, at the clustering transition, the entropically dominant part of the phase space decomposes into an exponential number of pure states so that beyond this transition a uniform sampling of solutions becomes hard. Afterward, the space of solutions condenses over a finite number of the largest states and consequently the total entropy of solutions becomes smaller than the annealed one. Another transition takes place when in all the entropically dominant states a finite fraction of nodes freezes so that each of these nodes is allowed a single color in all the solutions inside the state. Eventually, above the coloring threshold, no more solutions are available. In the 80's H. Masur and W. Veech defined two numerical invariants of strata of abelian differentials: the volume and the Siegel-Veech constant. Based on numerical experiments, A. Eskin and A. Zorich proposed a series of conjectures for the large genus asymptotics of these invariants. By a careful analysis of the asymptotic behavior of quasi-modular forms, D. Chen, M. Moeller, and D. Zagier proved this conjecture for strata of differentials with simple zeros. Here, we prove that the conjecture holds for the other extreme case, i.e. for strata of differentials with a unique zero. Our main ingredient is the expression of the numerical invariants of these strata in terms of Hodge integrals on moduli spaces of curves. We present a combinatorial and computational commutative algebra methodology for studying singularities of Schubert varieties of flag manifolds. We define the combinatorial notion of interval pattern avoidance. For “reasonable” invariants P of singularities, we geometrically prove that this governs (1) the P-locus of a Schubert variety, and (2) which Schubert varieties are globally not P. The prototypical case is P=“singular”; classical pattern avoidance applies admirably for this choice [V. Lakshmibai, B. Sandhya, Criterion for smoothness of Schubert varieties in SL(n) B, Proc. Indian Acad. Sci. Math. Sci. 100 (1) (1990) 45–52, MR 91c:14061], but is insufficient in general. Our approach is analyzed for some common invariants, including Kazhdan–Lusztig polynomials, multiplicity, factoriality, and Gorensteinness, extending [A. Woo, A. Yong, When is a Schubert variety Gorenstein?, Adv. Math. 207 (1) (2006) 205–220, MR 2264071]; the description of the singular locus (which was independently proved by [S. Billey, G. Warrington, Maximal singular loci of Schubert varieties in SL(n) B, Trans. Amer. Math. Soc. 335 (2003) 3915–3945, MR 2004f:14071; A. Cortez, Singularites generiques et quasi-resolutions des varietes de Schubert pour le groupe lineaire, Adv. Math. 178 (2003) 396–445, MR 2004i:14056; C. Kassel, A. Lascoux, C. Reutenauer, The singular locus of a Schubert variety, J. Algebra 269 (2003) 74–108, MR 2005f:14096; L. Manivel, Le lieu singulier des varietes de Schubert, Int. Math. Res. Not. 16 (2001) 849–871, MR 2002i:14045]) is also thus reinterpreted. Our methods are amenable to computer experimentation, based on computing with Kazhdan–Lusztig ideals (a class of generalized determinantal ideals) using Macaulay 2. This feature is supplemented by a collection of open problems and conjectures. We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an engineering construction in the area of error correcting codes where it has resulted in efficient capacity-achieving codes for a wide range of channels. However, this technique is not limited to problems in communications, and can be applied in the much broader context of graphical models. We describe here a general methodology for applying spatial coupling to random constraint satisfaction problems and obtain lower bounds for their (rough) satisfiability threshold. The main idea is to construct a distribution of geometrically structured random K-SAT instances - namely the spatially coupled ensemble - which has the same (rough) satisfiability threshold, and is at the same time algorithmically easier to solve. Then by running well-known algorithms on the spatially coupled ensemble we obtain a lower bound on the (rough) satisfiability threshold of the original ensemble. The method is versatile because one can choose the CSP, there is a certain amount of freedom in the construction of the spatially coupled ensemble, and also in the choice of the algorithm. In this work we focus on random K-SAT but we have also checked that the method is successful for Coloring, NAE-SAT and XOR-SAT. We choose Unit Clause propagation for the algorithm which is analyzed over the spatially coupled instances. For K = 3, for instance, our lower bound is equal to 3.67 which is better than the current bounds in the literature. Similarly, for graph 3-colorability we get a bound of 2.22 which is also better than the current bounds in the literature. We develop a higher regularity theory for general quasilinear elliptic equations and systems in divergence form with random coefficients. The main result is a large-scale L∞-type estimate for the gradient of a solution. The estimate is proved with optimal stochastic integrability under a one-parameter family of mixing assumptions, allowing for very weak mixing with non-integrable correlations to very strong mixing (for example finite range of dependence). We also prove a quenched L2 estimate for the error in homogenization of Dirichlet problems. The approach is based on subadditive arguments which rely on a variational formulation of general quasilinear divergence-form equations. Abstract This paper considers monochromatic radiative transfer in a diffusive three dimensional random binary mixture. The absorption coefficient, along any line-of-sight is a homogeneous Markov process, which is described by a three-dimensional Kubo-Anderson process. The transfer equation is solved numerically by Monte-Carlo simulations on a massively parallel computer (a Connection Machine) by attaching one or several photons to each processor. The implementation of the simulations on the machine is discussed in detail, in particular the association between photons and processors and the storage of the data concerning the photons and the realizations of the statistics. With a CM-2 having 8000 processors, it is possible, with an adequate strategy, to follow simultaneously millions of photons in hundreds of realizations and to reach optical thicknesses up to 100 with dispersions of order 10 -2 for the reflection and transmission coeficients. The simultations are validated, in the case of the one-dimensional rod geometry, by comparison with the exact analytical solution, constructed by averaging the solution of the non-stochastic problem (diffusion in a rod of given optical thickness) over the probability density of the optical thickness. The latter obeys a stochastic Liouville equation which is solved by a Green's function method. The influence of the dimension of the Kubo-Anderson process is studied for the case of a slab and it is shown that a slab consisting in a pile of layers (1D process) is more transparent than one which consists in a stack of lumps (3D process). A strategy for improving the efficiency of Monte-Carlo simulations, based on the distribution of the lengths of the individuals steps of the photons, is presented and discussed. We prove an extension of McDiarmid's inequality for metric spaces with unbounded diameter. To this end, we introduce the notion of the subgaussian diameter, which is a distribution-dependent refinement of the metric diameter. Our technique provides an alternative approach to that of Kutin and Niyogi's method of weakly difference-bounded functions, and yields nontrivial, dimension-free results in some interesting cases where the former does not. As an application, we give apparently the first generalization bound in the algorithmic stability setting that holds for unbounded loss functions. This yields a novel risk bound for some regularized metric regression algorithms. We give two extensions of the basic concentration result. The first enables one to replace the independence assumption by appropriate strong mixing. The second generalizes the subgaussian technique to other Orlicz norms. We introduce and analyze a numerical strategy to approximate effective coefficients in stochastic homogenization of discrete elliptic equations. In particular, we consider the simplest case possible: An elliptic equation on the @math -dimensional lattice @math with independent and identically distributed conductivities on the associated edges. Recent results by Otto and the author quantify the error made by approximating the homogenized coefficient by the averaged energy of a regularized corrector (with parameter @math ) on some box of finite size @math . In this article, we replace the regularized corrector (which is the solution of a problem posed on @math ) by some practically computable proxy on some box of size @math , and quantify the associated additional error. In order to improve the convergence, one may also consider @math independent realizations of the computable proxy, and take the arithmetic mean of the associated approximate homogenized coefficients. A natural optimization problem consists in properly choosing @math and @math in order to reduce the error at given computational complexity. Our analysis is sharp and allows us to give a clear answer to this question. In particular, we propose and analyze a numerical algorithm to approximate the homogenized coefficients, taking advantage of the (nearly) optimal scalings of the errors we derive. The efficiency of the approach is illustrated by a numerical study in dimension 2. We generalize the standard site percolation model on the @math -dimensional lattice to a model on random tessellations of @math . We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument burton1989density , develop two frameworks that imply the non-triviality of the phase transition and show that large classes of random tessellations fit into one of these frameworks. Our focus is on a very general approach that goes well beyond the typical Poisson driven models. The most interesting examples might be Voronoi tessellations induced by determinantal processes or certain classes of Gibbs processes introduced in schreiber2013 . In a second paper we will investigate first passage percolation on random tessellations. SUMMARY In this paper, we address the solution of three-dimensional heterogeneous Helmholtz problems discretized with second-order finite difference methods with application to acoustic waveform inversion in geophysics. In this setting, the numerical simulation of wave propagation phenomena requires the approximate solution of possibly very large indefinite linear systems of equations. For that purpose, we propose and analyse an iterative two-grid method acting on the Helmholtz operator where the coarse grid problem is solved inaccurately. A cycle of a multigrid method applied to a complex shifted Laplacian operator is used as a preconditioner for the approximate solution of this coarse problem. A single cycle of the new method is then used as a variable preconditioner of a flexible Krylov subspace method. We analyse the properties of the resulting preconditioned operator by Fourier analysis. Numerical results demonstrate the effectiveness of the algorithm on three-dimensional applications. The proposed numerical method allows us to solve three-dimensional wave propagation problems even at high frequencies on a reasonable number of cores of a distributed memory computer. Copyright © 2012 John Wiley & Sons, Ltd. 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.