相关论文: Computing Complex Dimension Faster and Determinist…
In this article we obtain lower and upper bounds for global dimensions of a class of artinian algebras in terms of global dimensions of a finite subset of their artinian subalgebras. Finding these bounds for the global dimension of an…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…
For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…
We present two geometric interpretations for complex multivectors and determinants: a little known one in terms of square roots of volumes, and a new one which uses fractions of volumes and allows graphical representations. The fraction…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in…
In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Recently holographic prescriptions are proposed to compute quantum complexity of a given state in the boundary theory. A specific proposal known as `holographic subregion complexity' is supposed to calculate the the complexity of a reduced…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…
We study the complexity of identifying the integer feasibility of reverse convex sets. We present various settings where the complexity can be either NP-Hard or efficiently solvable when the dimension is fixed. Of particular interest is the…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…
We study the question of when the coefficients of a hypergeometric series are p-adically unbounded for a given rational prime p. Our first main result is a necessary and sufficient criterion (applicable to all but finitely many primes) for…
We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose…
We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to the size of the output when the residual characteristic is…