English
Related papers

Related papers: Algorithm to Compute Orbit Zariski Closure in Affi…

200 papers

Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…

Rings and Algebras · Mathematics 2015-09-24 Ural Bekbaev

The purpose of this paper is to exhibit infinite families of conjugate projective curves in a number field whose complement have the same abelian fundamental group, but are non-homeomorphic. In particular, for any $d>3$ we find Zariski…

Algebraic Geometry · Mathematics 2019-11-28 Enrique Artal Bartolo , Jose I. Cogolludo-Agustin , Jorge Martín-Morales

The orbit decomposition is given under the automorphism group on the real split Jordan algebra of all hermitian matrices of order three corresponding to any real split composition algebra, or the automorphism group on the complexification,…

Differential Geometry · Mathematics 2011-04-07 Akihiro Nishio , Osami Yasukura

Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We…

Algebraic Geometry · Mathematics 2015-07-08 Jan Draisma , Rob H. Eggermont

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

Group Theory · Mathematics 2019-05-14 A. S. Detinko , D. L. Flannery , E. A. O'Brien

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

History and Overview · Mathematics 2024-07-18 Sergey Kurapov , Maxim Davidovsky

Motivated by applications to equivariant neural networks and cryo-electron microscopy we consider the problem of recovering the generic orbit in a representation of a finite group from invariants of low degree. The main result proved here…

Representation Theory · Mathematics 2025-03-04 Dan Edidin , Josh Katz

A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…

Discrete Mathematics · Computer Science 2007-05-23 Bertrand Nouvel , Eric Remila

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…

Group Theory · Mathematics 2025-12-23 Arjun Agarwal , Rachel Chen , Rohan Garg , Jared Kettinger

We compute the presentations of fundamental groups of the complements of a class of rational cuspidal projective plane curves classified by Flenner, Zaidenberg, Fenske and Saito. We use the Zariski-Van Kampen algorithm and exploit the…

Algebraic Geometry · Mathematics 2015-09-15 A. Muhammed Uludağ

We compute the mapping class group orbits in the homotopy set of framings of a compact connected oriented surface with non-empty boundary. In the case $g > 1$ the computation is some modification of Johnson's results and certain arguments…

Geometric Topology · Mathematics 2017-03-30 Nariya Kawazumi

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…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen , Gregor Kemper

Let V be a finite dimensional vector space over the two element field. We compute orbits for the linear action of groups generated by transvections with respect to a certain class of bilinear forms on V. In particular, we compute orbits…

Algebraic Geometry · Mathematics 2007-05-23 Ahmet Seven

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

Group Theory · Mathematics 2017-07-21 Avinoam Mann

We describe an algorithm, meant to be very general, to compute a presentation of the group of units of an order in a (semi)simple algebra over Q. Our method is based on a generalisation of Vorono\"i's algorithm for computing perfect forms,…

Number Theory · Mathematics 2014-07-24 Oliver Braun , Renaud Coulangeon , Gabriele Nebe , Sebastian Schoennenbeck

For an unknown finite group $G$ of automorphisms of a finite-dimensional Hilbert space, we find sharp bounds on the number of generic $G$-orbits needed to recover $G$ up to group isomorphism, as well as the number needed to recover $G$ as a…

Representation Theory · Mathematics 2024-11-27 Dustin G. Mixon , Brantley Vose

Let $S$ be a finitely generated abelian semigroup of invertible linear operators on a finite dimensional real or complex vector space $V$. We show that every coarsely dense orbit of $S$ is actually dense in $V$. More generally, if the orbit…

Functional Analysis · Mathematics 2013-02-20 Herbert Abels , Antonios Manoussos

We formulate a strengthening of the Zariski dense orbit conjecture for birational maps of dynamical degree one. So, given a quasiprojective variety $X$ defined over an algebraically closed field $K$ of characteristic $0$, endowed with a…

Dynamical Systems · Mathematics 2022-02-15 Jason Bell , Dragos Ghioca

In this paper we give an explicit solution to Zariski's moduli problem for plane branches. We compute (in an algorithmic way) the set of K\"{a}hler differentials of an irreducible germ of holomorphic plane curve. We show that there is a…

Algebraic Geometry · Mathematics 2024-12-11 Pedro Fortuny Ayuso , Javier Ribón

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Computational Complexity · Computer Science 2020-05-21 Jeffrey Finkelstein