English
Related papers

Related papers: Computing critical points for algebraic systems de…

200 papers

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

Symbolic Computation · Computer Science 2026-05-22 Thi Xuan Vu

In this note, we study the polynomial representation of the quantum Olshanetsky-Perelomov system for a finite reflection group $W$ of type $B_n$. We endow the polynomial ring ${\mathbb C} [x_1,\ldots\\\ldots, x_n]$ with a structure of…

Representation Theory · Mathematics 2021-12-15 Ibrahim Nonkané , Latévi M. Lawson

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

Symbolic Computation · Computer Science 2018-03-01 Jonathan D. Hauenstein , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

We construct a representation of the Birman-Wenzl-Murakami algebra acting on a space of polynomials in n variables vanishing when three points coincide. These polynomials are closely related to the Pfaffian state of the Quantum Hall Effect…

Quantum Algebra · Mathematics 2009-11-11 V. Pasquier

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

Symbolic Computation · Computer Science 2012-02-02 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

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…

Computational Geometry · Computer Science 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff

Let $W$ be a rank $n$ irreducible finite reflection group and let $p_1(x),\ldots,p_n(x)$, $x\in\mathbb{R}^n$, be a basis of algebraically independent $W$-invariant real homogeneous polynomials. The orbit map $\overline…

Mathematical Physics · Physics 2019-09-24 Vittorino Talamini

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

Commutative Algebra · Mathematics 2007-05-23 Karin Gatermann , Pablo A. Parrilo

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

Symbolic Computation · Computer Science 2021-04-05 Jérémy Berthomieu , Andrew Ferguson , Mohab Safey El Din

A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…

Combinatorics · Mathematics 2020-12-29 Tristram Bogart , Kevin Woods

By the Fourier transformations, any group-invariant functions over finite Abelian groups are transformed into group-invariant functions over the character groups. In this paper, we calculate matrix elements of this transformations under…

Representation Theory · Mathematics 2020-09-01 Koei Kawamura

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

Computational Complexity · Computer Science 2023-05-09 D. V. Gribanov , D. S. Malyshev

Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…

Symbolic Computation · Computer Science 2014-05-26 Pierre-Jean Spaenlehauer

We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…

Symbolic Computation · Computer Science 2026-05-27 Jérémy Berthomieu , Edern Gillot , Mohab Safey El Din

This paper studies the representations of a non-negative polynomial $f$ on a non-compact semi-algebraic set $K$ modulo its critical ideal. Under the assumptions that the semi-algebraic set $K$ is regular and $f$ satisfies the boundary…

Algebraic Geometry · Mathematics 2011-12-20 Dang Tuan Hiep

Let $\mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$. Let $(u_1, \dots, u_n)$ be a sequence of $n$ algebraically independent elements in $\mathbb{K}[x_1, \dots, x_n]$. Given a polynomial $f$ in…

Symbolic Computation · Computer Science 2022-06-01 Thi Xuan Vu
‹ Prev 1 2 3 10 Next ›