相关论文: Generalized rational blow-down, torus knots, and E…

We present a novel definition of an algorithm and its corresponding algorithm language called CoLweb. The merit of CoLweb [1] is that it makes algorithm design so versatile. That is, it forces us to a high-level, proof-carrying,…

In this paper we give a quantum statistical interpretation for the bracket polynomial state sum <K> and for the Jones polynomial. We use this quantum mechanical interpretation to give a new quantum algorithm for computing the Jones…

We generalize the feasible interpolation theorem for semantic derivations from K.(1997) by allowing randomized protocols (protocols in the sense of K.(1997). We also introduce an extension of the monotone circuit model, monotone circuits…

We construct a functor from the category of manifolds with generalized corners to the category of complexes of toric monoids, and for every `refinement' of the complex associated to a manifold, we show there is a unique `blow-up', i.e., a…

Let $X$ be a fs logarithmic scheme that is generically logarithmically smooth, and that admits a strict closed embedding into a logarithmically smooth scheme $Y$ over a field $\kk$ of characteristic zero. We construct a simple and fast…

I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…

In this paper, we study the generalized Douglas-Rachford algorithm and its cyclic variants which include many projection-type methods such as the classical Douglas-Rachford algorithm and the alternating projection algorithm. Specifically,…

Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to…

We show that the triply-graded Khovanov-Rozansky homology of the $(m,n)$ torus knot can be recovered from the finite-dimensional representation $\mathrm{L}_{m/n}$ of the rational Cherednik algebra at slope $m/n$, endowed with the Hodge…

This paper proposes an optimum version of the recently advanced scheme for generalized unary coding. In this method, the block of 1s that identifies the number is allowed to be broken up, which extends the count. The result is established…

We give an explicit presentation for the integral cohomology ring of the complement of any arrangement of level sets of characters in a complex torus (alias "toric arrangement"). Our description parallels the one given by Orlik and Solomon…

Rational counterterms are a key ingredient for the automation of loop calculations through numerical methods. Building on the recently established properties of rational terms of UV origin at two loops, in this paper we present a systematic…

These notes present two normal surface theory algorithms to detect the unknot and use the split-link algorithm to prove that the figure-eight knot is knotted.

Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions. Typical examples are satisfying…

We give the first explicit computations of rational homotopy groups of spaces of "long knots" in Euclidean spaces. We define a spectral sequence which converges to these rational homotopy groups whose E^1 term is defined in terms of braid…

We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but…

We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…

Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links: in…

Quantum error-correcting codes are many-body entangled states that are prepared and measured using complex sequences of entangling operations. Each element of such an entangling sequence introduces noise to delicate quantum information…

G\"{o}ttsche-Nakajima-Yoshioka K-theoretic blowup equations characterize the Nekrasov partition function of five dimensional $\mathcal{N}=1$ supersymmetric gauge theories compactified on a circle, which via geometric engineering correspond…