Related papers: The Evaluation Space of Logarithmic Stable Maps
We consider the moduli problem of stable maps from a Riemann surface into a supermanifold; in twistor-string theory, this is the instanton moduli space. By developing the algebraic geometry of supermanifolds to include a treatment of…
We present a new method for stochastic shape optimisation of engineering structures. The method generalises an existing deterministic scheme, in which the structure is represented and evolved by a level-set method coupled with mathematical…
We define what appears to be a new construction. Given a graph $G$ and a positive integer $k$, the reduced $k$th power of $G$, denoted $G^{(k)}$, is the configuration space in which $k$ indistinguishable tokens are placed on the vertices of…
We study the lift-and-project rank of the stable set polytopes of graphs with respect to the Lov\'{a}sz--Schrijver SDP operator $\text{LS}_+$, with a particular focus on finding and characterizing the smallest graphs with a given…
The paper contains several theoretical results related to the weighted nonlinear least-squares problem for low-rank signal estimation, which can be considered as a Hankel structured low-rank approximation problem. A parameterization of the…
This work is inspired by conversations with Izzet Coskun and Joe Harris. We run the log minimal model program for the Kontsevich space of stable maps $\bar{\mathcal M}_{0,0}(\mathbb P^{3}, 3)$ and give modular interpretations to all the…
Multistage stochastic optimization problems are oftentimes formulated informally in a pathwise way. These are correct in a discrete setting and suitable when addressing computational challenges, for example. But the pathwise problem…
We compute the (stable) \'etale cohomology of $\mathrm{Hom}_{n}(C, \mathcal{P}(\vec{\lambda}))$, the moduli stack of degree $n$ morphisms from a smooth projective curve $C$ to the weighted projective stack $\mathcal{P}(\vec{\lambda})$, the…
We discuss the relative log minimal model theory for log surfaces in the analytic setting. More precisely, we show that the minimal model program, the abundance theorem, and the finite generation of log canonical rings hold for log pairs of…
Maulik and Ranganathan have recently introduced moduli spaces of logarithmic stable pairs. We examine the theory in the case of toric surfaces, and recast the theory in this case using three ingredients: Gelfand, Kapranov and Zelevinsky…
It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible. Such configurations yield representations of data that are optimally robust to…
In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken…
In This paper, we survey recent progress on the theory of Gromov- Witten invariants on Hilbert schemes of points mainly on elliptic surfaces and simply connected minimal surface of general type. In particular, we focus on the aspects of…
We study the lift-and-project rank of the stable set polytopes of graphs with respect to the Lov\'asz-Schrijver SDP operator $\text{LS}_+$. In particular, we focus on a search for relatively small graphs with high $\text{LS}_+$-rank (i.e.,…
Many concepts in logarithmic geometry are invariant under log blowups. To formalize this invariance, we introduce the m-open, m-\'etale, m-smooth, m-fppf, and m-fpqc topologies for fs log schemes. These refine the standard topologies from…
In this article, we introduce the notion of good map and use it to establish Gromov-Witten theory for orbifolds.
In these lectures notes, we review our recent works addressing various problems of finding the nearest stable system to an unstable one. After the introduction, we provide some preliminary background, namely, defining Port-Hamiltonian…
We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.
We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding particular extreme points of a certain polytope associated…
We address the construction of stable random matrix ensembles as the generalization of the stable random variables (Levy distributions). With a simple method we derive the Cauchy case, which is known to have remarkable properties. These…