Related papers: Determination Problems for Orbit Closures and Matr…

There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…

From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…

Given two elements of a vector space acted on by a reductive group, we ask whether they lie in the same orbit, and if not, whether one lies in the orbit closure of the other. We develop techniques to optimize the orbit and orbit closure…

Fix a module M over a local ring R and a group action G on M, not necessarily R-linear. To understand how large is the G-orbit of an element z\in M one looks for the large submodules of M lying in Gz. We provide the corresponding…

In this paper we study the orbit closure problem for a reductive group $G\subseteq GL(X)$ acting on a finite dimensional vector space $V$ over $\C$. We assume that the center of $GL(X)$ lies within $G$ and acts on $V$ through a fixed…

For several objects of interest in geometric complexity theory, namely for the determinant, the permanent, the product of variables, the power sum, the unit tensor, and the matrix multiplication tensor, we introduce and study a fundamental…

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

We consider matrices with entries in a local ring, Mat(m,n,R). Fix a group action, G on Mat(m,n,R), and a subset of allowed deformations, \Sigma\subseteq Mat(m,n,R). The standard question of Singularity Theory is the…

In this paper, we study the configuration space of orbits, a generalization of the configuration space of points but for algebraic varieties that are acted by an algebraic reductive group. The main objective of this work is to study the…

The orbit polytope for a finite group G acting linearly and freely on a sphere S is used to construct a cellularized fundamental domain for the action. A resolution of the integers over G results from the associated G-equivariant…

The main problem is to understand and to find periodic symmetric orbits in the $n$-body problem, in the sense of finding methods to prove or compute their existence, and more importantly to describe their qualitative and quantitative…

In exploratory factor analysis, rotation techniques are employed to derive interpretable factor loading matrices. Factor rotations deal with equality-constrained optimization problems aimed at determining a loading matrix based on measure…

Let $k$ be a field, let $G$ be a reductive algebraic group over $k$, and let $V$ be a linear representation of $G$. Geometric invariant theory involves the study of the $k$-algebra of $G$-invariant polynomials on $V$, and the relation…

Let $G$ be the group $GL_r(C) \times (C^\times)^n$. We conjecture that the finely-graded Hilbert series of a $G$ orbit closure in the space of $r$-by-$n$ matrices is wholly determined by the associated matroid. In support of this, we prove…

We study closures of conjugacy classes in the symmetric matrices of the orthogonal group and we determine which one are normal varieties. In contrast to the result for the symplectic group where all classes have normal closure, there is…

The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

This paper presents a novel formulation and solution of orbit determination over finite time horizons as a learning problem. We present an approach to orbit determination under very broad conditions that are satisfied for n-body problems.…

Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…