相关论文: An introduction to Weinstein handlebodies for comp…

Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…

We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization…

We study issues related to F-theory on Calabi-Yau fourfolds and its duality to heterotic theory for Calabi-Yau threefolds. We discuss principally fourfolds that are described by reflexive polyhedra and show how to read off some of the data…

We review the results of several of our papers about the procedure of extension of Hamiltonians, allowing the construction of families of superintegrable systems with non-trivial polynomial first integrals (or symmetry operators) of…

We demonstrate a practical and efficient method for generating toric Calabi-Yau quiver theories, applicable to both D3 and M2 brane world-volume physics. A new analytic method is presented at low order parametres and an algorithm for the…

One generally expects that the techniques of arboreal singularities and gluing of local differential graded categories will result in a useful global invariant for all Weinstein manifolds. In this paper we construct explicit models for the…

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…

A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of the Thurston algorithm in obstructed cases, and in one…

We compute the cohomology ring of the complement of a toric arrangement with integer coefficients and investigate its dependency from the arrangement's combinatorial data. To this end, we study a morphism of spectral sequences associated to…

A theorem of Kirby states that two framed links in the 3-sphere produce orientation-preserving homeomorphic results of surgery if they are related by a sequence of stabilization and handle-slide moves. The purpose of the present paper is…

Weinstein trisection is a trisection of a symplectic 4-manifold whose 1-handlebodies are the Weinstein domain for the symplectic structure induced from an ambient manifold. Lambert-Cole, Meier, and Starkston showed that every closed…

Recent works have shown that quantum computers can polynomially speed up certain SAT-solving algorithms even when the number of available qubits is significantly smaller than the number of variables. Here we generalise this approach. We…

We develop a model for the cohomology of the complement of a hypersurface arrangement inside a smooth projective complex variety. This generalizes the case of normal crossing divisors, discovered by P. Deligne in the context of the mixed…

In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement. We give some results on the uniqueness of the representation of…

Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…

The aim of these notes is to provide a reasonably short and "hands-on" introduction to the differential calculus on associative algebras over a field of characteristic zero. Following a suggestion of Ginzburg's we call the resulting theory…

In their precedent work, the authors constructed closed oriented hyperbolic surfaces with pseudo-Anosov homeomorphisms from certain class of integral matrices. In this paper, we present a very simple algorithm to compute the Teichmueller…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a…

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…