English
Related papers

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

200 papers

We prove upper and lower bounds for all the coefficients in the Hilbert Polynomial of a graded Gorenstein algebra $S=R/I$ with a quasi-pure resolution over $R$. The bounds are in terms of the minimal and the maximal shifts in the resolution…

Commutative Algebra · Mathematics 2012-02-08 Sabine El Khoury , Hema Srinivasan

We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…

Logic · Mathematics 2011-09-14 Kirsten Eisentraeger , Graham Everest , Alexandra Shlapentokh

The main goal of this paper is to characterize the Hilbert functions of all (artinian) codimension 4 Gorenstein algebras that have at least two independent relations of degree four. This includes all codimension 4 Gorenstein algebras whose…

Commutative Algebra · Mathematics 2008-04-10 Juan C. Migliore , Uwe Nagel , Fabrizio Zanello

Given a Hilbertian field $k$ and a finite set $\mathcal{S}$ of Krull valuations of $k$, we show that every finite split embedding problem $G \rightarrow {\rm{Gal}}(L/k)$ over $k$ with abelian kernel has a solu\-tion ${\rm{Gal}}(F/k)…

Number Theory · Mathematics 2022-01-10 François Legrand

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

Computational Complexity · Computer Science 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

We identify the simple algebraic groups over number fields that are, in a suitable sense, determined by their finite adele points. Assuming CSP and Grothendieck rigidity, our results essentially characterize higher rank arithmetic groups…

Group Theory · Mathematics 2026-05-06 Adrian Baumann , Holger Kammeyer

This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…

General Mathematics · Mathematics 2022-04-15 Bogdan Grechuk

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

Optimization and Control · Mathematics 2012-11-15 Mehdi Ghasemi , Murray Marshall

A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem…

Data Structures and Algorithms · Computer Science 2016-08-30 Manfred Cochefert , Jean-François Couturier , Petr A. Golovach , Dieter Kratsch , Daniël Paulusma , Anthony Stewart

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

Number Theory · Mathematics 2019-07-30 Peter Müller

In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…

Computational Complexity · Computer Science 2009-02-08 Gábor Ivanyos , Marek Karpinski , Lajos Rónyai , Nitin Saxena

We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…

Number Theory · Mathematics 2007-05-23 Neil Berry , Arturas Dubickas , Noam D. Elkies , Bjorn Poonen , Chris Smyth

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

Group Theory · Mathematics 2018-07-11 Andrew James Kelley

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

Group Theory · Mathematics 2017-05-16 A. Mohammadzadeh , A. R. Moghaddamfar

Let $A=K[a_1,\ldots,a_n]$ be a weighted $\mathbb{N}$-filtered solvable polynomial algebra with filtration $FA=\{ F_pA\}_{p\in\mathbb{N}}$, where solvable polynomial algebras are in the sense of (A. Kandri-Rody and V. Weispfenning,…

Rings and Algebras · Mathematics 2014-01-23 Huishi Li

We study algebras k[x_1,...,x_n]/I which admit a grading by a subsemigroup of N^d such that every graded component is a one-dimensional k-vector space. V.I.~Arnold and coworkers proved that for d = 1 and n <= 3 there are only finitely many…

alg-geom · Mathematics 2008-02-03 Bernd Sturmfels

A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a…

Commutative Algebra · Mathematics 2019-03-26 Jeske Glenn , Christopher O'Neill , Vadim Ponomarenko , Benjamin Sepanski

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa
‹ Prev 1 4 5 6 7 8 10 Next ›