Related papers: Algorithms for group actions in arbitrary characte…

Let $A$ be a finite group acting by automorphisms on the finite group $G$. We introduce the commuting graph $\Gamma (G,A)$ of this action and study some questions related to the structure of $G$ under certain graph theoretical conditions on…

Properties of a given symmetry group G are very important in investigation of a physical system invariant under its action. In the case of finite spin systems (magnetic rings, some planar macromolecules) the symmetry group is isomorphic…

We give a geometric characterization of finite rational groups. In particular, we prove that a finite group is rational if and only if there exists a finite geometry $\Gamma$ of type $I$ and action of $G$ on $\Gamma$ as a group of…

Let k be an algebraically closed field of arbitrary characteristic. First we give explicit bases for the highest weight vectors for the action of GL_r x GL_s on the coordinate ring k[Mat_{rs}^m] of m-tuples of r x s-matrices. It turns out…

Many geometric learning problems require invariants on heterogeneous product spaces, i.e., products of distinct spaces carrying different group actions, where standard techniques do not directly apply. We show that, when a group $G$ acts…

For a discrete metric space (or more generally a large scale space) $X$ and an action of a group $G$ on $X$ by coarse equivalences, we define a type of coarse quotient space $X_G$, which agrees up to coarse equivalence with the orbit space…

Let k be a local field and G the set of k-points of a connected semisimple algebraic k-group of rank one. We describe all torsion-free discrete subgroups of G\times G acting properly discontinuously on G by left and right multiplication. To…

Let $k$ be a number field, $\mathbf{G}$ an algebraic group defined over $k$, and $\mathbf{G}(k)$ the group of $k$-rational points in $\mathbf{G}.$ We determine the set of functions on $\mathbf{G}(k)$ which are of positive type and…

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…

We give a criterion for the rigidity of actions on homogeneous spaces. Let $G$ be a real Lie group, $\Lambda$ a lattice in $G$, and $\Gamma$ a subgroup of the affine group Aff$(G)$ stabilizing $\Lambda$. Then the action of $\Gamma$ on…

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

Let X be a normal affine T-variety of complexity at most one over a perfect field k, where T stands for the split algebraic torus. Our main result is a classification of additive group actions on X that are normalized by the T-action. This…

Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…

The strategies adopted by individuals to select relevant information to pass on are central to understanding problem solving by groups. Here we use agent-based simulations to revisit a cooperative problem-solving scenario where the task is…

In this paper we present an algorithm for efficiently counting fixed points in a finite monoid $M$ under a conjugacy-like action. We then prove a formula for the character table of $M$ in terms of fixed points and radical, which allows for…

This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the second computes the group $[\Sigma X,Y]^*$ of pointed…

Let R be an affine PI-algebra over an algebraically closed field k and let G be an affine algebraic k-group that acts rationally by algebra automorphisms on R. For R prime and G a torus, we show that R has only finitely many G-prime ideals…