Related papers: Algorithms for computing with nilpotent matrix gro…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
In this note, we give explicit expressions of Gauss sums for general (resp. special) linear groups over finite fields, which involves Gauss sums (resp. Kloosterman sums). The key ingredient is averaging such sums over Borel subgroups. As…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
We calculate the higher homotopy groups of the Deligne-Getzler infinity-groupoid associated to a nilpotent L-infinity algebra. As an application, we present a new approach to the rational homotopy theory of mapping spaces.
In this paper, we establish the theory of nilpotent hypergroups and study some properties of nilpotent hypergroups and provided some structural characterizations of nilpotent hypergroups.
We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…
The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…
We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups
Processes to automate the selection of appropriate algorithms for various matrix computations are described. In particular, processes to check for, and certify, various matrix properties of black box matrices are presented. These include…
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
The purpose of this paper is twofold. First, we define the new spaces and investigate some topological and structural properties. Also, we compute dual spaces of new spaces which are help us in the characterization of matrix mappings.…
The condition of nilpotency is studied in the general linear Lie algebra $\mathfrak{gl}_{n}(\mathbb{K})$ and the symplectic Lie algebra $\mathfrak{sp}_{2m}(\mathbb{K})$ over an algebraically closed field of characteristic 0. In particular,…
We give a new, geometric proof of the section conjecture for fixed points of finite group actions on projective curves of positive genus defined over the field of complex numbers, as well as its natural nilpotent analogue. As a part of our…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
We investigate linearity of amalgams of subgroups of algebraic groups along intersections with algebraic subgroups. In the process, we establish linearity of certain "doubles" of linear groups, and obtain new examples of finitely generated…
We propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups by the members of a central series, eventually to its image…
Optimal experimental designs are probability measures with finite support enjoying an optimality property for the computation of least squares estimators. We present an algorithm for computing optimal designs on finite sets based on the…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…