English
Related papers

Related papers: Computing the Zariski closure of a finitely genera…

200 papers

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…

Group Theory · Mathematics 2009-09-25 John Cannon , George Havas

We present a quantum algorithm for solving the hidden subgroup problem in the general linear group over a finite field where the hidden subgroup is promised to be a conjugate of the group of the invertible lower triangular matrices. The…

Quantum Physics · Physics 2011-05-24 Gábor Ivanyos

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

Numerical Analysis · Mathematics 2016-02-03 Daniel A. Brake , Jonathan D. Hauenstein , Alan C. Liddell

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

Group Theory · Mathematics 2020-03-16 Marius Tărnăuceanu

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

Rings and Algebras · Mathematics 2007-05-23 K. R. Goodearl , E. S. Letzter

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

Group Theory · Mathematics 2015-08-12 Alexei Myasnikov , Andrey Nikolaev , Alexander Ushakov

Let $K$ be a henselian valued field with ${\cal O}_K$ its valuation ring, $\Gamma$ its value group, and $\boldsymbol{k}$ its residue field. We study the definable subsets of ${\cal O}_K$ and algebraic groups definable over ${\cal O}_K$ in…

Logic · Mathematics 2023-07-13 Chen Ling , Ningyuan Yao

A linear parameterization of group GL(N, C) formed by direct products of matrices with in advance known symmetry properties is offered. Initial conditions of the given approach and the proposal on realization for are discussed. The concrete…

General Mathematics · Mathematics 2012-01-27 A. Lavrenov

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

Rings and Algebras · Mathematics 2019-12-30 Yuri Bahturin , Alberto Elduque , Mikhail Kochetov

A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.

Combinatorics · Mathematics 2007-05-23 A. D. Mednykh

We study a family of complex representations of the group GL(n,O), where O is the ring of integers of a non-archimedean local field F. These representations occur in the restriction of the Grassmann representation of GL(n,F) to its maximal…

Representation Theory · Mathematics 2012-10-08 Uri Bader , Uri Onn

Our main result is that the image of the quantum representation of a central extension of the mapping class group of the genus $g\geq 3$ closed orientable surface at a prime $p\geq 5$ is a Zariski dense discrete subgroup of some higher rank…

Group Theory · Mathematics 2016-04-08 Louis Funar

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

Group Theory · Mathematics 2019-01-07 Sushil Bhunia

The purpose of this paper is to investigate the finite group which appears in the study of the Type II $\mathbf{Z}_4$-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the…

Representation Theory · Mathematics 2017-06-08 Masashi Kosuda , Manabu Oura

Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…

Rings and Algebras · Mathematics 2015-09-24 Ural Bekbaev

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Algebraic Geometry · Mathematics 2015-05-27 Adam S. Sikora

The algorithm of computing generalized Green functions of a finite reductive group contains some unkonwn scalars occuring from the F_q structure of irreducible local systems on unipotent classes on G. In this paper, we determine such…

Representation Theory · Mathematics 2007-05-23 Toshiaki Shoji

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

Group Theory · Mathematics 2024-05-08 Mihai-Silviu Lazorec

Let $P_3(\mathbf{C}^{\infty})$ be the space of complex cubic polynomials in infinitely many variables. We show that this space is $\mathbf{GL}_{\infty}$-noetherian, meaning that any $\mathbf{GL}_{\infty}$-stable Zariski closed subset is cut…

Algebraic Geometry · Mathematics 2018-03-16 Harm Derksen , Rob H. Eggermont , Andrew Snowden