Related papers: Minimal length in an orbit closure as a semiclassi…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.

We establish a novel connection between the minimal nilpotent orbit $\mathbb{O}_n$ in $\mathfrak{sl}_n$ and the minimal nilpotent orbit closure $\overline{\mathbf{O}}_n$ in $\mathfrak{so}_{2n+2}$, which differs from the shared-orbit…

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

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…

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Covariant or invariant functions under a compact linear group can be expressed in terms of functions defined in the orbit space of the group. The semialgebraic relations defining the orbit spaces of all finite coregular real linear groups…

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

We evaluate the variance of coefficients of the characteristic polynomial for binary quantum graphs using a dynamical approach. This is the first example where a spectral statistic can be evaluated in terms of periodic orbits for a system…

Understanding the difference between group orbits and their closures is a key difficulty in geometric complexity theory (GCT): While the GCT program is set up to separate certain orbit closures, many beautiful mathematical properties are…

The current paper is devoted to the investigation of the influence of nested invariant cone structure on the dynamics, in the context of non-autonomous (time almost periodic)cases. We first prove that the nested invariant cone structure can…

Polynomial invariants of a group action often appear only in high degree, and in many representations the invariant ring imposes severe degree constraints before any nontrivial invariants can occur. In contrast, the larger class of unitary…

Inspired by a twist maps theorem of Mather we study recurrent invariant sets that are ordered like rigid rotation under the action of the lift of a bimodal circle map $g$ to the $k$-fold cover. For each irrational in the interior of the…

According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…

The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

We generalize the notion of length to an ordinal-valued invariant defined on the class of finitely generated modules over a Noetherian ring. A key property of this invariant is its semi-additivity on short exact sequences. We show how to…

The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the…

The main theme of the paper is the dynamics of Hamiltonian diffeomorphisms of ${\mathbb C}{\mathbb P}^n$ with the minimal possible number of periodic points (equal to $n+1$ by Arnold's conjecture), called here Hamiltonian pseudo-rotations.…

Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…

Let $\G$ be a semisimple algebraic group over a number field $K$, $\mathcal{S}$ a finite set of places of $K$, $K_\mathcal{S}$ the direct product of the completions $K_v, v \in \mathcal{S}$, and $\OO$ the ring of $\mathcal{S}$-integers of…