Related papers: A short overview of the "Topological recursion"
We consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model. We adopt a graphon as our random graph model, which is…
Infinite order linear recurrences are studied via kneading matrices and kneading determinants. The concepts of kneading matrix and kneading determinant of an infinite order linear recurrence, introduced in this work, are defined in a purely…
Gromov-Witten invariants of a symplectic manifold are a count of holomorphic curves. We describe a formula expressing the GW invariants of a symplectic sum $X# Y$ in terms of the relative GW invariants of $X$ and $Y$. This formula has…
We consider Open Gromov-Witten invariants for noncompact Calabi-Yau in the case the Lagrangian has the topology of $\R^2 \times S^1$. The definition of the invariant involves the choice of a frame for the Lagrangian, in accord with string…
It is shown that the solutions of certain systems of nonlinear \"Orst-order recursions with polynomial right-hand sides may be rather easily ascertained, and display interesting evolutions in their ticking time variable (taking integer…
We introduce and study the Hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), which enumerates the number of linear chord diagrams of fixed genus with specified numbers of backbones generated by s and chords generated by t. For…
Mapping an atomistic configuration to an $N$-point correlation of a field associated with the atomic positions (e.g. an atomic density) has emerged as an elegant and effective solution to represent structures as the input of…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
Symmetry of geometrical figures is reflected in regularities of their algebraic invariants. Algebraic regularities are often preserved when the geometrical figure is topologically deformed. The most natural, intuitively simple but…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
Extraction of structure, in particular of group symmetries, is increasingly crucial to understanding and building intelligent models. In particular, some information-theoretic models of parsimonious learning have been argued to induce…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We introduce the notion of $\mathcal{N}=1$ abstract super loop equations, and provide two equivalent ways of solving them. The first approach is a recursive formalism that can be thought of as a supersymmetric generalization of the…
Recently, the supersymmetry method was extended from Gaussian ensembles to arbitrary unitarily invariant matrix ensembles by generalizing the Hubbard-Stratonovich transformation. Here, we complete this extension by including arbitrary…
We revisit the geometry of involutions in groups of finite Morley rank. Our approach unifies and generalises numerous results, both old and recent, that have exploited this geometry; though in fact, we prove much more. We also conjecture…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…