Related papers: Determination Problems for Orbit Closures and Matr…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
Given the implicit equation $F(x,y,t,s)$ of a family of algebraic plane curves depending on the parameters $t,s$, we provide an algorithm for studying the topology types arising in the family. For this purpose, the algorithm computes a…
We consider the actions of different groups G on the space M of m x n matrices with entries in the formal power series ring K[[x1,..., xs]], K an arbitrary field. G acts on M by analytic change of coordinates, combined with the…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated application of a linear transformation. Similarly, the continuous…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
This is the author's second paper treating the double coset problem for classical groups. Let $G$ be an algebraic group over an algebraically closed field $K$. The double coset problem consists of classifying the pairs $H,J$ of closed…
We consider the following problem: given $d \times d$ rational matrices $A_1, \ldots, A_k$ and a polyhedral cone $\mathcal{C} \subset \mathbb{R}^d$, decide whether there exists a non-zero vector whose orbit under multiplication by $A_1,…
Always dealing with an arbitrary field we consider the variety $(k^{n\times n})^{p}$ under the action of $GL_{n}$ by simultaneous similarity. We define discrete and continuous invariants which completely determine the orbits. The discrete…
Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated…
We consider faithful actions of simple algebraic groups on self-dual irreducible modules, and on the associated varieties of totally singular subspaces, under the assumption that the dimension of the group is at least as large as the…
We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…
We study an action of ${\rm Aut}(F_n)$ on $\mathbb{R}^{2^n-1}$ by trace maps, defined using the traces of $n$-tuples of matrices in $\mathrm{SL}(2,\mathbb{C})$ having real traces. We determine the finite orbits for this action. These orbits…
In this work we obtain sufficient conditions for a variety with a torus action of complexity one to have a finite number of automorphism group orbits.
We consider the problem of the determination of the isotropy classes of the orbit spaces of all the real linear groups, with three independent basic invariants satisfying only one independent relation. The results are obtained in the $\hat…
The orbits in $\Gamma_{\infty}(3) \backslash \Gamma(3)$ are in bijection with sets of invariants satisfying certain relations. We explain how wedge product matrices give an alternative definition of the invariants of matrix orbits. This new…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
In the paper "Aquino, C., Jim\'enez, R., Mijangos, M., Morales Mel\'endez, Q.: On Invariant (co)homology of a group, preprint" are introduced two groups generated by the orbits of an action of a group on another group by automorphisms. One…