相关论文: On the maximum nilpotent orbit which intersects th…
We present two methods for computing the rational singular locus of the closure of a nilpotent orbit in a complex semisimple Lie algebra and give a number of interesting examples.
Moment polytopes of tensors, the study of which is deeply rooted in invariant theory, representation theory and symplectic geometry, have found relevance in numerous places, from quantum information (entanglement polytopes) and algebraic…
The nilpotent cone of a simple Lie algebra is partitioned into locally closed subvarieties called special pieces, each containing exactly one special orbit. Lusztig conjectured that each special piece is the quotient of some smooth variety…
According to a well-known theorem of Brieskorn and Slodowy, the intersection of the nilpotent cone of a simple Lie algebra with a transverse slice to the subregular nilpotent orbit is a simple surface singularity. At the opposite extremity…
Let $\Aa_t$ be the directed quiver of type $\Aa$ with $t$ vertices. For each dimension vector $d$ there is a dense orbit in the corresponding representation space. The principal aim of this note is to use just rank conditions to define the…
We consider the multi-objective optimization problem of choosing the bottom left block-entry of a block lower triangular matrix to minimize the ranks of all block sub-matrices. We provide a proof that there exists a simultaneous…
A result of Barnea and Isaacs states that if $L$ is a finite dimensional nilpotent Lie algebra with exactly two distinct centralizer dimensions, then nilpotency class of $L$ is either $2$ or $3$. In this article, we classify all such finite…
In this paper we establish a kind of bijection between the orbits of a polygonal outer billiards system and the orbits of a related (and simpler to analyze) system called the pinwheel map. One consequence of the result is that the outer…
Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…
We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…
We prove that any finite W-algebra U(g,e) admits a one-dimensional representation fixed by the action of the component group of the centraliser of e. As a consequence, for any nilpotent orbit O in g there exists a multiplicity-free (and…
We study the closure of the locus of radical ideals in the multigraded Hilbert scheme associated with a standard graded polynomial ring and the Hilbert function of a homogeneous coordinate ring of points in general position in projective…
Supernilpotence is a generalization of nilpotence using a recently developed theory of higher-arity commutators for universal algebras. Many important structural properties have been shown to be associated with supernilpotence, and the…
This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…
The aim of this paper is to investigate two classical problems related to nilpotent center conditions and bifurcation of limit cycles in switching polynomial systems. Due to the difficulty in calculating the Lyapunov constants of switching…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…
Our main goal in this paper is to study the number of small-amplitude isolated periodic orbits, so-called limit cycles, surrounding only one equilibrium point a class of polynomial Kolmogorov systems. We denote by $\mathcal M_{K}(n)$ the…
We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix…
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…
In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…