相关论文: Computational Geometry Column 42

Research progress in quantum computing has, thus far, focused on a narrow set of application domains. Expanding the suite of quantum application domains is vital for the discovery of new software toolchains and architectural abstractions.…

Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…

We provide a survey of past research and a list of open problems regarding central simple algebras and the Brauer group over a field, intended both for experts and for beginners.

We give a presentation of cyclotomic q-Schur algebras by generators and defining relations. As an application, we give an algorithm for computing decomposition numbers of cyclotomic q-Schur algebras.

Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of…

This is a preliminary version of the Chapter 1 of a book "Computable Integrability"

Inscribability of polytopes is a classic subject but also a lively research area nowadays. We illustrate this with a selection of well-known results and recent developments on six particular topics related to inscribable polytopes. Along…

This survey of some of the more topological aspects of the placement problem for complex curves in complex surfaces was originally published in L'Enseignement Mathematique 29 (1983). The present LaTeXed redaction corrects several…

Predictive models are one of the most important techniques that are widely applied in many areas of software engineering. There have been a large number of primary studies that apply predictive models and that present well-preformed studies…

The concept of open weak CAD is introduced. Every open CAD is an open weak CAD. On the contrary, an open weak CAD is not necessarily an open CAD. An algorithm for computing projection polynomials of open weak CADs is proposed. The key idea…

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

We develop a link between degree estimates for rational sphere maps and compressed sensing. We provide several new ideas and many examples, both old and new, that amplify connections with linear programming. We close with a list of ten open…

Creative telescoping is the method of choice for obtaining information about definite sums or integrals. It has been intensively studied since the early 1990s, and can now be considered as a classical technique in computer algebra. At the…

This book is divided into two parts. In the first part we give an elementary introduction to computational physics consisting of 21 simulations which originated from a formal course of lectures and laboratory simulations delivered since…

Let n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

We present a study of cubic surfaces from the novel perspective of positive geometry. Our positive geometries have dimension two (the surface minus its 27 lines), dimension three (its complement in 3-space), and dimension four (the moduli…

The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation…

This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of…

The paper presents results for deriving closed-form analytic solutions of the evolution of inhomogeneities in a homogeneous spatially flat multicomponent cosmological model. Mathematical methods to derive computable forms of the…