English
Related papers

Related papers: Deciding if a variety forms an algebraic group

200 papers

Let $M_n(K)$ be the algebra of $n \times n$ matrix over an infinite integral domain $K$. Let $gl_n(K)$ be the Lie algebra of $n \times n$ matrix with the usual Lie product over $K$. Let $G = \{g_1,\ldots,g_n\}$ be a group of order $n$. We…

Rings and Algebras · Mathematics 2020-08-11 Luís Felipe Gonçalves Fonseca

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

Group Theory · Mathematics 2009-10-06 Enric Ventura

We show that every affine or projective algebraic variety defined over the field of real or complex numbers is homeomorphic to a variety defined over the field of algebraic numbers. We construct such a homeomorphism by choosing a small…

Algebraic Geometry · Mathematics 2019-12-03 Adam Parusinski , Guillaume Rond

We carry out the complete group classification of the class of (1+1)-dimensional linear Schr\"odinger equations with complex-valued potentials. After introducing the notion of uniformly semi-normalized classes of differential equations, we…

Mathematical Physics · Physics 2018-03-07 Célestin Kurujyibwami , Peter Basarab-Horwath , Roman O. Popovych

Let $f(X_1,\dots, X_n)$ be a nonzero multilinear noncommutative polynomial. If $A$ is a unital algebra with a surjective inner derivation, then every element in $A$ can be written as $f(a_1,\dots,a_n)$ for some $a_i\in A$.

Rings and Algebras · Mathematics 2021-06-25 Daniel Vitas

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…

Discrete Mathematics · Computer Science 2016-04-11 Igor Potapov , Pavel Semukhin

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

Group Theory · Mathematics 2019-05-13 W. A. de Graaf , A. S. Detinko , D. L. Flannery

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Symbolic Computation · Computer Science 2014-09-22 Wei Zhou , George Labahn

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

Group Theory · Mathematics 2021-03-24 Igor Protasov

We provide an algorithm that takes as an input a given parametric family of homogeneous polynomials, which is invariant under the action of the general linear group, and an integer $d$. It outputs the ideal of that family intersected with…

Commutative Algebra · Mathematics 2021-10-14 Paul Breiding , Christian Ikenmeyer , Mateusz Michałek , Reuven Hodges

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

Symbolic Computation · Computer Science 2020-01-07 Ludovic Brieulle , Luca De Feo , Javad Doliskani , Jean-Pierre Flori , Éric Schost

If $A$ is a finite-dimensional algebra graded by a group $G$, and $\sigma \in G$, we define a variant of paratrophic matrix associated with $A$ and $\sigma$, and we use it to characterize the $\sigma$-graded Frobenius property for $A$. We…

Rings and Algebras · Mathematics 2025-12-18 Sorin Dascalescu , Constantin Nastasescu , Laura Nastasescu , Paul Rebenciuc

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

Algebraic Geometry · Mathematics 2016-05-26 Jonathan D. Hauenstein , Jose Israel Rodriguez , Frank Sottile

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…

Group Theory · Mathematics 2008-08-01 Pedro Silva , Pascal Weil

For a group $G$ acting on an affine variety $X$, the separating variety is the closed subvariety of $X\times X$ encoding which points of $X$ are separated by invariants. We concentrate on the indecomposable rational linear representations…

Commutative Algebra · Mathematics 2016-02-01 Emilie Dufresne , Martin Kohls

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

Representation Theory · Mathematics 2018-03-06 Vladimir V. Kornyak

Let V_* be the normalized unitary subgroup of the modular group algebra FG of a finite p-group G over a finite field F with the classical involution *. We investigate the isomorphism problem for the group V_*, that asks when the group V_*…

Rings and Algebras · Mathematics 2020-05-20 Zsolt Balogh , Victor Bovdi

Let $SL_{2n}$, $Sp_{2n}$, $E_6 = G^{sc}(E_6)$, $F_4 = G(F_4)$ be simply connected split algebraic groups over an arbitrary field $F$. Algebraic K-theory of affine homogeneous varieties $SL_{2n}/Sp_{2n}$ and $E_6/F_4$ is computed. Moreover,…

Algebraic Geometry · Mathematics 2016-01-12 Maria Yakerson

We present a deterministic algorithm for computing all irreducible factors of degree $\le d$ of a given bivariate polynomial $f\in K[x,y]$ over an algebraic number field $K$ and their multiplicities, whose running time is polynomial in the…

Number Theory · Mathematics 2007-05-23 Martin Avendano , Teresa Krick , Martin Sombra