相关论文: Deciding finiteness of matrix groups in positive c…
In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…
The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…
We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups…
In this paper we determine automorphism groups of cyclic algebraic curves defined over finite fields of any characteristic.
We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
Let $\mathscr{C}$ be a classical group defined over a finite field. We present comprehensive theoretical solutions to the following closely related problems: 1) List a representative for each conjugacy class of $\mathscr{C}$. 2) Given $x…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We introduce various probablistic finiteness conditions for profinite groups related to positive finite generation (PFG). We investigate completed group rings which are PFG as modules, and use this to answer a question of Kionke and the…
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…
We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix.…
Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…
The chief aim of this paper is to describe a procedure which, given a $d$-dimensional absolutely irreducible matrix representation of a finite group over a finite field $\mathbb{E}$, produces an equivalent representation such that all…
We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…