Related papers: The complexity of computing the Hilbert polynomial…
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…
We describe the cohomology groups of a homogeneous vector bundle $E$ on any Hermitian symmetric variety $X=G/P$ of ADE type as the cohomology of a complex explicitly described. The main tool is the equivalence between the category of…
We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…
We compute the equivariant homology and cohomology of projective spaces with integer coefficients. More precisely, in the case of cyclic groups, we show that the cellular filtration of the projective space $P(k\rho )$, of lines inside…
In this short note we prove a couple of facts about polynomial count varieties, answering natural questions that they raise. A polynomial count $X$ variety is essentially one for which its number of points over finite fields is given by a…
In this paper, we calculate the upper bound on quantum space complexity of the quantum algorithms proposed by Biasse and Song (SODA'16) for solving class group computation and the principal ideal problem using the reductions to $S$-unit…
We prove a complexity dichotomy theorem for symmetric complex-weighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #P-hard over general graphs but tractable over planar graphs are precisely…
We study multivariate integration and approximation for functions belonging to a weighted reproducing kernel Hilbert space based on half-period cosine functions in the worst-case setting. The weights in the norm of the function space depend…
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…
We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…
We compute Hoelder Complexes,i.e. the complete bi-Lipschitz invariants, for germs of real weighed homogeneous algebraic or semialgebraic surfaces.
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We compute the Hilbert series of the complex Grassmannian using invariant theoretic methods and show that its h-polynomial coincides with the k-Narayana polynomial. We give a simplified formula for the h-polynomial of Schubert varieties.…
In this article we provide another method for obtaining explicit formulas yielding counts of secant planes to a projective curve. We formulate the problem in terms of Segre classes of suitable bundles over the symmetric product of the curve…
This is a draft of a monograph to appear in the Springer series "Encyclopaedia of Mathematical Sciences", subseries "Invariant Theory and Algebraic Transformation Groups". The subject is homogeneous spaces of algebraic groups and their…
We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification. The method is equivalent to performing projected backward Euler…
Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…
In this paper, an original reduction algorithm for solving simultaneous multivariate polynomial equations is presented. The algorithm is exponential in complexity, but the well-known algorithms, such as the extended Euclidean algorithm and…
We perform a classification of integrable systems of mixed scalar and vector evolution equations with respect to higher symmetries. We consider polynomial systems that are homogeneous under a suitable weighting of variables. This paper…