English
Related papers

Related papers: Noether's Problem for Some Semidirect Products

200 papers

Let $k$ be a perfect field of characteristic $p>0$, $k(t)_{per}$ the perfect closure of $k(t)$ and $A$ a $k$-algebra. We characterize whether the ring $A\otimes_k k(t)_{per}$ is noetherian or not. As a consequence, we prove that the ring…

Commutative Algebra · Mathematics 2007-05-23 M. Fernandez-Lebron , L. Narvaez-Macarro

Let $\mathcal{O}_K$ be a complete discrete valuation ring with field of fractions $K$ and algebraically closed residue field $k.$ Let $G$ be a smooth connected commutative algebraic group over $K$ which does not contain a copy of…

Algebraic Geometry · Mathematics 2026-04-21 Otto Overkamp , Ismaele Vanni

We prove the following extension of Tits' simplicity theorem. Let $k$ be an infinite field, $G$ an algebraic group defined and quasi-simple over $k,$ and $G(k)$ the group of $k$-rational points of $G.$ Let $G(k)^+$ be the subgroup of $G(k)$…

Group Theory · Mathematics 2020-05-14 Bachir Bekka

Let F be a non-archimedean local field of characteristic zero whose residue field has at least three elements. Let G be an almost simple linear algebraic group over F, with rank_F(G) >= 2. Let X be a simply connected symmetric space of…

Group Theory · Mathematics 2026-04-17 Federico Viola

We prove that the group algebra $KG$ of a group $G$ over a field $K$ is primitive, provided that $G$ has a free subgroup with the same cardinality as $G$, and that $G$ satisfies the following condition $(\ast)$: for each subset $M$ of $G$…

Rings and Algebras · Mathematics 2018-05-04 James Alexander , Tsunekazu Nishinaka

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

Number Theory · Mathematics 2017-02-01 Stéphane Fischler , Tanguy Rivoal

This paper solves the rational noncommutative analog of Hilbert's 17th problem: if a noncommutative rational function is positive semidefinite on all tuples of hermitian matrices in its domain, then it is a sum of hermitian squares of…

Rings and Algebras · Mathematics 2021-08-23 Jurij Volčič

Let G be a finite group, (g_{1},...,g_{r}) an (unordered) r-tuple of G^{(r)} and x_{i,g_i}'s variables that correspond to the g_i's, i=1,...,r. Let F<x_{1,g_1},...,x_{r,g_r}> be the corresponding free G-graded algebra where F is a field of…

Rings and Algebras · Mathematics 2017-12-05 Eli Aljadeff , Alexei Kanel-Belov

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

For any finite $k$-group scheme $G$ acting rationally on a $k$-variety, if the action is generically free then the dimension of $\mathrm{Lie} (G)$ is upper bounded by the dimension of the variety. We show that this is the only obstruction…

Algebraic Geometry · Mathematics 2026-05-18 Bianca Gouthier

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

In this paper, we formulate an analogue of Waring's problem for an algebraic group $G$. At the field level we consider a morphism of varieties $f\colon \mathbb{A}^1\to G$ and ask whether every element of $G(K)$ is the product of a bounded…

Number Theory · Mathematics 2017-07-26 Michael Larsen , Dong Quan Ngoc Nguyen

Suppose that G is a finite group and x in G has prime order p > 3. Then x is contained in the solvable radical of G if (and only if) <x,x^g> is solvable for all g in G. If G is an almost simple group and x in G has prime order p > 3 then…

Group Theory · Mathematics 2009-02-11 Simon Guest

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

Computational Complexity · Computer Science 2013-01-18 Vikraman Arvind

In this paper, we give a brief survey of recent developments on Noether's problem and rationality problem for multiplicative invariant fields including author's recent papers Hoshi [Hos15] about Noether's problem over Q, Hoshi, Kang and…

Algebraic Geometry · Mathematics 2020-10-06 Akinari Hoshi

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

Let f be a G-function (in the sense of Siegel), and x be an algebraic number; assume that the value f(x) is a real number. As a special case of a more general result, we show that f(x) can be written as g(1), where g is a G-function with…

Number Theory · Mathematics 2011-06-23 Stéphane Fischler , Tanguy Rivoal

Let R be an affine PI-algebra over an algebraically closed field k and let G be an affine algebraic k-group that acts rationally by algebra automorphisms on R. For R prime and G a torus, we show that R has only finitely many G-prime ideals…

Rings and Algebras · Mathematics 2011-05-23 Martin Lorenz

Using an analogue of Makanin-Razborov diagrams, we give a description of the solution set of systems of equations over an equationally Noetherian free product of groups $G$. Equivalently, we give a parametrisation of the set $Hom(H, G)$ of…

Group Theory · Mathematics 2009-03-13 Montserrat Casals-Ruiz , Ilya Kazachkov

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…

Symbolic Computation · Computer Science 2009-04-19 Jaime Gutierrez , Rosario Rubio , David Sevilla
‹ Prev 1 4 5 6 7 8 10 Next ›