Related papers: A short overview of the "Topological recursion"
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
In these lectures three different methods of computing the asymptotic expansion of a Hermitian matrix integral is presented. The first one is a combinatorial method using Feynman diagrams. This leads us to the generating function of the…
Topological recursion associates to a spectral curve, a sequence of meromorphic differential forms. A tangent space to the "moduli space" of spectral curves (its space of deformations) is locally described by meromorphic 1-forms, and we use…
For a system of partial differential equations admitting point, contact, or higher symmetries, the framework of invariant reduction systematically computes how invariant geometric structures, such as conservation laws, presymplectic…
We find further evidence for the conjecture relating large N Chern-Simons theory on S^3 with topological string on the resolved conifold geometry by showing that the Wilson loop observable of a simple knot on S^3 (for any representation)…
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…
We describe a framework for random pairwise comparisons matrices, inspired by selected constructions releted to the so called inconsistency reduction of pairwise comparisons (PC) matrices. In to build up structures on random pairwise…
"Toeplitzification" or "redundancy (spatial) averaging", the well-known routine for deriving the Toeplitz covariance matrix estimate from the standard sample covariance matrix, recently regained new attention due to the important Random…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
The standard approach to characterizing topological matter, computing topological invariants, fails when the symmetry protecting the topological phase is preserved only on average in a disordered system. Because topological invariants rely…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
Some basic notions and results in Topological Dynamics are extended to continuous groupoid actions in topological spaces. We focus mainly on recurrence properties. Besides results that are analogous to the classical case of group actions,…
Flows on surfaces are one of the most fundamental and classical objects in dynamical systems, and are studied from various areas (e.g. integrable systems, differential equations, fluid mechanics). Though hyperbolic flows and recurrent flows…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…
The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…
We first review our previous work arxiv:1503.02993 [math-ph] where we considered a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco and showed that extending this Hopf Algebra by…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
Given a principal bundle with a connection, we look for an asymptotic expansion of the holonomy of a loop in terms of its length. This length is defined relative to some Riemannian or sub-Riemannian structure. We are able to give an…