相关论文: A review on computational aspects of polynomial am…

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…

Algorithms for continuous optimization problems have a rich history of design and innovation over the past several decades, in which mathematical analysis of their convergence and complexity properties plays a central role. Besides their…

We investigate the zonal polynomials, a family of symmetric polynomials that appear in many mathematical contexts, such as multivariate statistics, differential geometry, representation theory, and combinatorics. We present two computer…

Developing robust representations of chemical structures that enable models to learn topological inductive biases is challenging. In this manuscript, we present a representation of atomistic systems. We begin by proving that our…

Manifold optimization is ubiquitous in computational and applied mathematics, statistics, engineering, machine learning, physics, chemistry and etc. One of the main challenges usually is the non-convexity of the manifold constraints. By…

The field of computational complexity is concerned both with the intrinsic hardness of computational problems and with the efficiency of algorithms to solve them. Given such a problem, normally one designs an algorithm to solve it and sets…

In this paper we introduce the concept of polynomial diagrams and its area for special polynomials.We study the properties of polynomial area diagrams. The formula for the area of an arbitrary polynomial diagram.

Exploiting a connection between amoebas and tropical curves, we devise a method for computing tropical curves using numerical algebraic geometry and give an implementation. As an application, we use this technique to compute Newton polygons…

We report on the computation of invariants, covariants, and contravariants of cubic surfaces. All algorithms are implemented in the computer algebra system magma.

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

This review gives a survey of numerical algorithms and software to simulate quantum computers.It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…

The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [Kal04]. Here we consider the polynomiography of the partial sums of the exponential series. While…

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.

In this paper, we study some properties of associated sequaences in umbral calculus. From these properties, we derive new and interesting identities of several kinds of polynomials.

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…