English
Related papers

Related papers: Hilbert's 13th Problem for Algebraic Groups

200 papers

Let $k$ be a field and let $V$ be a $k$-vector space of dimension $d$. Let $G \subseteq GL(V)$ be a finite group. Let $r = \dim_k (V^*)^G$. Assume $r \geq 1$. Let $R = k[V]^G$ be the ring of invariants of $G$. Let $H_R(n) =…

Commutative Algebra · Mathematics 2025-12-02 Tony J. Puthenpurakal

Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…

Algebraic Geometry · Mathematics 2017-07-04 Olivier Benoist

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…

Dynamical Systems · Mathematics 2024-09-04 Pablo Pedregal

The paper is concerned with the following version of Hilbert's irreducibility theorem: if $\pi: X \to Y$ is a Galois $G$-covering of varieties over a number field $k$ and $H \subset G$ is a subgroup, then for all sufficiently large and…

Number Theory · Mathematics 2022-07-28 Borys Kadets

In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…

Number Theory · Mathematics 2025-04-01 M Krithika , P Vanchinathan

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…

Computational Complexity · Computer Science 2025-10-28 Markus Bläser , Sagnik Dutta , Gorav Jindal

This note is purely expository. We show how in the course of the Kolmogorov-Arnold solution of Hilbert's 13-th problem on superpositions there appeared the notion of a basic embedding. A subset K of R^2 is {\it basic} if for each continuous…

Functional Analysis · Mathematics 2010-08-20 A. Skopenkov

Let $ {\mathbf k} $ be a field and $Q\in {\mathbf k}[x_1, \ldots, x_s]$ a form (homogeneous polynomial) of degree $d>1.$ The ${\mathbf k}$-Schmidt rank $rk_{\mathbf k}(Q)$ of $Q$ is the minimal $r$ such that $Q= \sum_{i=1}^r R_iS_i$ with…

Number Theory · Mathematics 2024-02-01 Amichai Lampert , Tamar Ziegler

Let $\text{GL}(n) = \text{GL}(n, {\mathbb C})$ denote the complex general linear group and let $G \subset \text{GL}(n)$ be one of the classical complex subgroups $\text{O}(n)$, $\text{SO}(n)$, and $\text{Sp}(2k)$ (in the case $n = 2k$). We…

Commutative Algebra · Mathematics 2020-07-03 Vesselin Drensky , Elitza Hristova

Let R be a polynomial ring in r variables and D a dual ring upon which R acts as partial differential operators (classical apolarity). For a type two graded level Artinian algebras A=R/I, of socle degree j we consider the family of Artinian…

Commutative Algebra · Mathematics 2007-05-23 Anthony Iarrobino

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…

Functional Analysis · Mathematics 2010-03-09 A. Skopenkov

A relatively compressed algebra with given socle degrees is an Artinian quotient $A$ of a given graded algebra $R/\fc$, whose Hilbert function is maximal among such quotients with the given socle degrees. For us $\fc$ is usually a…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Rosa Miró-Roig , Uwe Nagel

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

Number Theory · Mathematics 2024-03-27 M Krithika , P Vanchinathan

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

Dynamical Systems · Mathematics 2007-05-23 A. A. Glutsyuk , Yu. S. Ilyashenko

We consider the minimal free resolution of a generic set of n+1 forms (not necessarily of the same degree) in a polynomial ring of n variables. The Hilbert function for such an ideal is known, thanks to a result of Stanley and of Watanabe.…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Rosa Miró-Roig

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

Mathematical Physics · Physics 2015-10-14 Rencai Lu , Kaiming Zhao

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 $G$ be a commutative connected algebraic group over a number field $K$, let $A$ be a finitely generated and torsion-free subgroup of $G(K)$ of rank $r>0$ and, for $n>1$, let $K(n^{-1}A)$ be the smallest extension of $K$ inside an…

Number Theory · Mathematics 2023-01-10 Sebastiano Tronto

We consider the graph $k$-colouring problem encoded as a set of polynomial equations in the standard way over $0/1$-valued variables. We prove that there are bounded-degree graphs that do not have legal $k$-colourings but for which the…

Computational Complexity · Computer Science 2023-06-02 Massimo Lauria , Jakob Nordström