Related papers: Blowing up Stringy Canonical Forms: An Algorithm t…

The solution set of a system of polynomial equations typically contains ill-behaved, singular points. Resolution is a fundamental process in geometry in which we replace singular points with smooth points, while keeping the rest of the…

We first introduce and study the notion of multi-weighted blow-ups, which is later used to systematically construct an explicit yet efficient algorithm for functorial logarithmic resolution in characteristic zero, in the sense of Hironaka.…

We propose blowup equations for 6d little string theories which generalize Nakajima-Yoshioka's blowup equations for the 4d/5d instanton partition functions on Omega background. We find that unlike the blowup equations for standard SQFTs, we…

Stringy canonical forms are a class of integrals that provide $\alpha'$-deformations of the canonical form of any polytopes. For generalized associahedra of finite-type cluster algebra, there exist completely rigid stringy integrals, whose…

We establish a sharp upper estimate for the order of a canonical system in terms of the Hamiltonian. This upper estimate becomes an equality in the case of Krein strings. As an application we prove a conjecture of Valent about the order of…

We discuss the method of bounding suprema of canonical processes based on the inclusion of their index set into a convex hull of a well-controlled set of points. While the upper bound is immediate, the reverse estimate was established to…

When considering a real log canonical threshold (RLCT) that gives a Bayesian generalization error, in general, papers replace a mean error function with a relatively simple polynomial whose RLCT corresponds to that of the mean error…

This paper is devoted to finite state automata, regular expression matching, pattern recognition, and the exponential blow-up problem, which is the growing complexity of automata exponentially depending on regular expression length. This…

We find the winning strategy for a class of truncation games played on words. As a consequence of the present author's recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and…

In this paper we present a method for extending the blowup method, in the formulation of Krupa and Szmolyan, to flat slow manifolds that lose hyperbolicity beyond any algebraic order. Although these manifolds have infinite co-dimension,…

Hironaka's concept of characteristic polyhedron of a singularity has been one of the most powerful and fruitful ideas of the last decades in singularity theory. In fact, since then combinatorics have become a major tool in many important…

In this talk we discuss sector decomposition. This is a method to disentangle overlapping singularities through a sequence of blow-ups. We report on an open-source implementation of this algorithm to compute numerically the Laurent…

Stack-theoretic blow-ups have proven to be efficient in resolving singularities over fields of characteristic zero. In this article, we move forward towards positive characteristic where new challenges arise. In particular, the dimension of…

The ``losing positions" of certain combinatorial games constitute linear error detecting and correcting codes. We show that a large class of games that can be cast in the form of *annihilation games*, provides a potentially polynomial…

This paper develops a clustering algorithm for formations in team sports, with a focus on football games. Our method first clusters formations into several average formations: `442,' `4141,' `433,' `541,' and `343.' Then, each average…

We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.

This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and…

In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…

This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a…

We give sufficient conditions on the initial data so that a semilinear wave inequality blows-up in finite time. Our method is based on the study of an associated second order differential inequality. The same method is applied to some…