Related papers: An efficient implementation of the algorithm compu…

Let $k$ be a commutative ring and $S=k[x_0, \ldots, x_n]$ be a polynomial ring over $k$ with a monomial order. For any monomial ideal $J$, there exists an affine $k$-scheme of finite type, called Gr\"obner scheme, which parameterizes all…

Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools.…

We study the bi-graded Hilbert function of ideals of general fat points with same multiplicity in $\mathbb{P}^1\times\mathbb{P}^1$. Our first tool is the multiprojective-affine-projective method introduced by the second author in previous…

We compute the completion of the local ring of the Hilbert scheme of degree $n+1$ subschemes of $\mathbb{A}^n$ at the point corresponding to the ideal $\langle x_1,\ldots,x_n\rangle^2$, and describe the completion of the universal family.…

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…

Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions. We propose a class of strongly convergent algorithms for…

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…

Let Hilb^p be the Hilbert scheme parametrizing the closed subschemes of P^n with Hilbert polynomial p\in Q[t] over a field K of characteristic zero. By bounding below the cohomological Hilbert functions of the points of Hilb^p we define…

This paper presents a framework for computing random operator-valued feature maps for operator-valued positive definite kernels. This is a generalization of the random Fourier features for scalar-valued kernels to the operator-valued case.…

Let $p(t)$ be an admissible Hilbert polynomial in $\PP^n$ of degree $d$. The Hilbert scheme $\hilb^n_p(t)$ can be realized as a closed subscheme of a suitable Grassmannian $ \mathbb G$, hence it could be globally defined by homogeneous…

We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…

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…

Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…

Let Hilb^p be the Hilbert scheme parametrizing the closed subschemes of P^n with Hilbert polynomial p \in Q[t] over a field K of characteristic zero. By bounding below the cohomological Hilbert functions of the points of Hilb^p we define…

We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…

In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

We present a simple and at the same time fficient algorithm to compute all nondominated extreme points in the outcome set of multi-objective mixed integer linear programmes in any dimension. The method generalizes the well-known dichotomic…