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

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Let $\mathscr {C}(G,H,\psi)$ be a finite group scheme-theoretical category over an algebraically closed field of characteristic $p\ge 0$ as introduced by the first author. For any indecomposable exact module category over $\mathscr…

We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

This article determines the structure of the group ring $\mathbb{Z}_nG$, where $G$ is a finite group and $\mathbb{Z}_n$ is the ring of integers modulo $n$, such that $n$ is relatively prime to the order of $G$. The decomposition of…

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

We address the problem of classifying complete $\mathbb{C}$-subalgebras of $\mathbb{C}[[t]]$. A discrete invariant for this classification problem is the semigroup of orders of the elements in a given $\mathbb{C}$-subalgebra. Hence we can…

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms…

We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an l-dimensional coordinate…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix…

We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…

Let $\Gamma_2\subseteq \Gamma_1$ be finitely generated subgroups of ${\rm GL}_{n_0}(\mathbb{Z}[1/q_0])$. For $i=1$ or $2$, let $\mathbb{G}_i$ be the Zariski-closure of $\Gamma_i$ in $({\rm GL}_{n_0})_{\mathbb{Q}}$, $\mathbb{G}_i^{\circ}$ be…

We generalize our methodology for computing with Zariski dense subgroups of $\mathrm{SL}(n, \mathbb{Z})$ and $\mathrm{Sp}(n, \mathbb{Z})$, to accommodate input dense subgroups $H$ of $\mathrm{SL}(n, \mathbb{Q})$ and $\mathrm{Sp}(n,…

We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…

In the theory of algebraic groups, parabolic subgroups form a crucial building block in the structural studies. In the case of general linear groups over a finite field $F_q$, given a sequence of positive integers $n_1, ..., n_k$, where…

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…