Related papers: Constructive Recognition of Special Linear Groups
We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…
Let $G$ be a finite group and let $cd(G)$ be the set of all irreducible complex character degrees of $G$. It was conjectured by Huppert in Illinois J. Math. 44 (2000) that, for every non-abelian finite simple group $H$, if $cd(G)=cd(H)$…
Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
Recent work has used deep learning to derive symmetry transformations, which preserve conserved quantities, and to obtain the corresponding algebras of generators. In this letter, we extend this technique to derive sparse representations of…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…
Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of…
Filters were introduced by J.B. Wilson in 2013 to generalize work of Lazard with associated graded Lie rings. It holds promise in improving isomorphism tests, but the formulas introduced then were impractical for computation. Here, we…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
This paper considers a video caption generating network referred to as Semantic Grouping Network (SGN) that attempts (1) to group video frames with discriminating word phrases of partially decoded caption and then (2) to decode those…
We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.
The new computational paradigm of conceptual computation has been introduced in the research program of Artificial Mathematical Intelligence. We provide the explicit artificial generation (or conceptual computation) for the fundamental…
Let $\mathcal{G}$ be a finite group scheme over an algebraically closed field $k$ of characteristic ${\rm char}(k)=p\geq 3$. In generalization of the familiar notion from the modular representation theory of finite groups, we define the…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…