相关论文: Blowing up Stringy Canonical Forms: An Algorithm t…

League competition is investigated using random processes and scaling techniques. In our model, a weak team can upset a strong team with a fixed probability. Teams play an equal number of head-to-head matches and the team with the largest…

We propose new algorithms for generating $k$-statistics, multivariate $k$-statistics, polykays and multivariate polykays. The resulting computational times are very fast compared with procedures existing in the literature. Such speeding up…

We present a general algorithm to order moves so as to speedup exact game solvers. It uses online learning of playout policies and Monte Carlo Tree Search. The learned policy and the information in the Monte Carlo tree are used to order…

We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on an oracle, evaluating the dynamic programming operator up to…

Leverage score sampling is crucial to the design of randomized algorithms for large-scale matrix problems, while the computation of leverage scores is a bottleneck of many applications. In this paper, we propose a quantum algorithm to…

Fireworks algorithm is a new type of intelligent optimization algorithm. Because of its fast convergence speed, easy implementation, explosiveness, diversity, simplicity and randomness, it has attracted more and more attention in many…

Categorical resolution of singularities has been constructed in arXiv:1212.6170. It proceeds by alternating two steps of seemingly different nature. We show how to use the formalism of filtered derived categories to combine the two steps…

The score sequence of a tournament is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The problem of counting score sequences of a tournament with $n$ vertices is more than 100 years old (MacMahon 1920). In…

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it…

We study the multi-level bottleneck assignment problem (MBA), which has important applications in scheduling and quantitative finance. Given a weight matrix, the task is to rearrange entries in each column such that the maximum sum of…

In this paper, we investigate the blow-up phenomenon of the $H^2$ norm of solutions to the inhomogeneous biharmonic Schrodinger equation in two distinct scenarios. First, we consider the case of negative energy, analyzing separately the…

We explain a highly efficient algorithm for playing the simplest type of dots and boxes endgame optimally (by which we mean "in such a way so as to maximise the number of boxes that you take"). The algorithm is sufficiently simple that it…

We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model…

In this paper, a new continuous scoring system for soccer is proposed, based on the proportion of time that a team is winning, losing or tied. Several simulations are made applying this technique to complete seasons of different leagues. As…

In this note, we reconcile two approaches that have been used to construct stringy multiplications. The pushing forward after pulling back that has been used to give a global stringy extension of the functors K_0,K^{top},A^*,H^* [CR, FG,…

The generalized, two-component Hunter-Saxton system comprises several well-known models of fluid dynamics and serves as a tool for the study of one-dimensional fluid convection and stretching. In this article a general representation…

The solution to the supersymmetric FCNC problem may not have a simple field theory interpretation. Here I advocate a possibility based on string selection rules. The requirement of non--trivial Yukawa structures restricts the form of the…

Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have…

We apply the dressing method to a string solution given by a static string wrapped around the equator of a three-sphere and find that the result is the single spike solution recently discussed in the literature. Further application of the…

Compactification of the heterotic string on toroidal orbifolds is a promising set-up for the construction of realistic unified models of particle physics. The target space dynamics of such models, however, drives them slightly away from the…