相关论文: Blobbed topological recursion: properties and appl…
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…
We prove a formula for the genus one free energy $\mathcal{F}^{(1)}$ of the quartic Kontsevich model for arbitrary ramification by working out a boundary creation operator for blobbed topological recursion. We thus investigate the…
We study the topology of the link $M^{\mathrm{trop}}_{g,n}[1]$ of the tropical moduli spaces of curves when g=2. Tropical moduli spaces can be identified with boundary complexes for $\mathcal{M}_{g,n}$, as shown by…
We prove that there is a one-to-one, bounded, holomorphic function on a region $\Omega$ iff $S^{2} - \Omega$ is not totally disconnected. This paper has been withdrawn by the author since Theorem 3 is incorrect.
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…
In this paper, we investigate one of the established methods for reconstructing modified gravity models from a dark energy model, with the aim of discovering relationships between these theories. In this study, we focus on the $f(R,T)$…
We extend the theory of topological recursion by considering Airy structures whose partition functions are highest weight vectors of particular $\mathcal{W}$-algebra representations. Such highest weight vectors arise as partition functions…
The second author and Norbury initiated the enumeration of lattice points in the Deligne-Mumford compactifications of moduli spaces of curves. They showed that the enumeration may be expressed in terms of polynomials, whose top and bottom…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the laws of composition which hold in them, as well as a natural…
We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…
We study the affine variety $L_{n}(\mathfrak{g})$ of Lie algebra representations, the collection of all homomorphisms from an arbitrary $n$-dimensional Lie algebra into a fixed real semi-simple Lie algebra $\mathfrak{g}$. Using techniques…
It is demonstrated that decompositions of integrable highest weight modules of a simple Lie algebra with respect to its reductive subalgebra obey the set of algebraic relations leading to the recursive properties for the corresponding…
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
We reformulate the monodromy relations of open-string scattering amplitudes as boundary terms of twisted homologies on the configuration spaces of Riemann surfaces of arbitrary genus. This allows us to write explicit linear relations…
We aim to completely formalize the rough topological analysis of integrable Hamiltonian systems admitting analytical solutions such that the initial phase variables along with the time derivatives of the auxiliary variables are expressed as…
We investigate topology change in 3D. Using Morse theory and handle decomposition we find the set of elementary cobordisms for 3-manifolds. These are: (i) \O <-> S^2; (ii) \Sigma_g <-> \Sigma_{g+1}; (iii) \Sigma_{g_1} \sqcup \Sigma_{g_2}…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
Let $\mathcal{F}$ be the germ at $\mathbf{0} \in \mathbb{C}^n$ of a holomorphic foliation of dimension $d$, $1 \leq d < n$, with an isolated singularity at $\mathbf{0}$. We study its geometry and topology using ideas that originate in the…
We introduce a bivariate version of topological complexity, $\mathrm{TC}(f,g)$, associated with two continuous maps $f\colon X\to Z$ and $g\colon Y\to Z$. This invariant measures the minimal number of continuous motion planning rules…