151,960 research outputs found

    Cosymmetries and Nijenhuis recursion operators for difference equations

    Get PDF
    In this paper we discuss the concept of cosymmetries and co--recursion operators for difference equations and present a co--recursion operator for the Viallet equation. We also discover a new type of factorisation for the recursion operators of difference equations. This factorisation enables us to give an elegant proof that the recursion operator given in arXiv:1004.5346 is indeed a recursion operator for the Viallet equation. Moreover, we show that this operator is Nijenhuis and thus generates infinitely many commuting local symmetries. This recursion operator and its factorisation into Hamiltonian and symplectic operators can be applied to Yamilov's discretisation of the Krichever-Novikov equation

    Geometric recursion

    Full text link
    We propose a general theory to construct functorial assignments ΣΩΣE(Σ)\Sigma \longmapsto \Omega_{\Sigma} \in E(\Sigma) for a large class of functors EE from a certain category of bordered surfaces to a suitable target category of topological vector spaces. The construction proceeds by successive excisions of homotopy classes of embedded pairs of pants, and thus by induction on the Euler characteristic. We provide sufficient conditions to guarantee the infinite sums appearing in this construction converge. In particular, we can generate mapping class group invariant vectors ΩΣE(Σ)\Omega_{\Sigma} \in E(\Sigma). The initial data for the recursion encode the cases when Σ\Sigma is a pair of pants or a torus with one boundary, as well as the "recursion kernels" used for glueing. We give this construction the name of Geometric Recursion (GR). As a first application, we demonstrate that our formalism produce a large class of measurable functions on the moduli space of bordered Riemann surfaces. Under certain conditions, the functions produced by the geometric recursion can be integrated with respect to the Weil--Petersson measure on moduli spaces with fixed boundary lengths, and we show that the integrals satisfy a topological recursion (TR) generalizing the one of Eynard and Orantin. We establish a generalization of Mirzakhani--McShane identities, namely that multiplicative statistics of hyperbolic lengths of multicurves can be computed by GR, and thus their integrals satisfy TR. As a corollary, we find an interpretation of the intersection indices of the Chern character of bundles of conformal blocks in terms of the aforementioned statistics. The theory has however a wider scope than functions on Teichm\"uller space, which will be explored in subsequent papers; one expects that many functorial objects in low-dimensional geometry could be constructed by variants of our new geometric recursion.Comment: 97 pages, 21 figures. v2: misprint corrected. v3: revised and abridged version, 66 page

    A generalized topological recursion for arbitrary ramification

    Full text link
    The Eynard-Orantin topological recursion relies on the geometry of a Riemann surface S and two meromorphic functions x and y on S. To formulate the recursion, one must assume that x has only simple ramification points. In this paper we propose a generalized topological recursion that is valid for x with arbitrary ramification. We justify our proposal by studying degenerations of Riemann surfaces. We check in various examples that our generalized recursion is compatible with invariance of the free energies under the transformation (x,y) -> (y,x), where either x or y (or both) have higher order ramification, and that it satisfies some of the most important properties of the original recursion. Along the way, we show that invariance under (x,y) -> (y,x) is in fact more subtle than expected; we show that there exists a number of counter examples, already in the case of the original Eynard-Orantin recursion, that deserve further study.Comment: 26 pages, 2 figure

    What is Radical Recursion?

    Get PDF
    Recursion or self-reference is a key feature of contemporary research and writing in semiotics. The paper begins by focusing on the role of recursion in poststructuralism. It is suggested that much of what passes for recursion in this field is in fact not recursive all the way down. After the paradoxical meaning of radical recursion is adumbrated, topology is employed to provide some examples. The properties of the Moebius strip prove helpful in bringing out the dialectical nature of radical recursion. The Moebius is employed to explore the recursive interplay of terms that are classically regarded as binary opposites: identity and difference, object and subject, continuity and discontinuity, etc. To realize radical recursion in an even more concrete manner, a higher-dimensional counterpart of the Moebius strip is utilized, namely, the Klein bottle. The presentation concludes by enlisting phenomenological philosopher Maurice Merleau-Ponty’s concept of depth to interpret the Klein bottle’s extra dimension

    Recursion formulae of higher Weil-Petersson volumes

    Full text link
    In this paper we study effective recursion formulae for computing intersection numbers of mixed ψ\psi and κ\kappa classes on moduli spaces of curves. By using the celebrated Witten-Kontsevich theorem, we generalize Mulase-Safnuk form of Mirzakhani's recursion and prove a recursion formula of higher Weil-Petersson volumes. We also present recursion formulae to compute intersection pairings in the tautological rings of moduli spaces of curves.Comment: 18 pages, to appear in IMR

    Integrable discretization of recursion operators and unified bilinear forms to soliton hierarchies

    Get PDF
    In this paper, we give a procedure of how to discretize the recursion operators by considering unified bilinear forms of integrable hierarchies. As two illustrative examples, the unified bilinear forms of the AKNS hierarchy and the KdV hierarchy are presented from their recursion operators. Via the compatibility between soliton equations and their auto-B\"acklund transformations, the bilinear integrable hierarchies are discretized and the discrete recursion operators are obtained. The discrete recursion operators converge to the original continuous forms after a standard limit.Comment: 11Page
    corecore