arXiv subjects

Gregor Kemper

Publications and source records attributed to Gregor Kemper.

22 records · Page 2Linked to original sources

arXiv2007

Computing invariants of algebraic group actions in arbitrary characteristic

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and unipotent, so the invariant ring need not be finitely generated. For this case, we develop an algorithm which computes K[X]^G in terms of a so-called colon-operation. From this, generators of K[X]^G can be obtained in finite time if it is finitely generated. Under the additional hypothesis that K[X] is factorial, we present an algorithm that finds a quasi-affine variety whose coordinate ring is K[X]^G. Along the way, we develop some techniques for dealing with non-finitely generated algebras. In particular, we introduce the finite generation locus ideal.

math.AC↗

arXiv2004

On Reconstructing Configurations of Points in ${\mathbb P}^2$ from a Joint Distribution of Invariants

Consider the diagonal action of the projective group $\PGL_3$ on $n$ copies of ${\mathbb P}^2$. In addition, consider the action of the symmetric group $Σ_n$ by permuting the copies. In this paper we find a set of generators for the invariant field of the combined group $Σ_n \times \PGL_3$. As the main application, we obtain a reconstruction principle for point configurations in ${\mathbb P}^2$ from their sub-configurations of five points. Finally, we address the question of how such reconstruction principles pass down to subgroups.

math.AC↗

arXiv2003

Which Point Configurations are Determined by the Distribution of their Pairwise Distances?

In a previous paper we showed that, for any $n \ge m+2$, most sets of $n$ points in $\RR^m$ are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there are some exceptional point configurations which are not reconstructible from the distribution of distances in the above sense. In this paper, we present a reconstructibility test with running time $O(n^{11})$. The cases of orientation preserving rigid motions (rotations and translations) and scalings are also discussed.

math.MG↗

arXiv2003

On reconstructing n-point configurations from the distribution of distances or areas

One way to characterize configurations of points up to congruence is by considering the distribution of all mutual distances between points. This paper deals with the question if point configurations are uniquely determined by this distribution. After giving some counterexamples, we prove that this is the case for the vast majority of configurations. In the second part of the paper, the distribution of areas of sub-triangles is used for characterizing point configurations. Again it turns out that most configurations are reconstructible from the distribution of areas, though there are counterexamples.

math.AC↗