Related papers: On the maximum nilpotent orbit which intersects th…

In general, a nilpotent orbit closure in a complex simple Lie algebra \g, does not have a crepant resolution. But, it always has a Q-factorial terminalization by the minimal model program. According to B. Fu, a nilpotent orbit closure has a…

The Deligne--Simpson problem is an existence problem for connections with specified local behavior. Almost all previous work on this problem has restricted attention to connections with regular or unramified singularities. Recently, the…

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…

The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show…

In this article, we study the intersection (or union) of the convex hull of N confocal paraboloids (or ellipsoids) of revolution. This study is motivated by a Minkowski-type problem arising in geometric optics. We show that in each of the…

When a linear system Ax = y is solved by means of iterative methods (mainly CG and GMRES) and the convergence rate is slow, one may consider a preconditioner P. The use of such preconditioner changes the spectrum of the matrix defining the…

Nilpotent Leibniz algebras with isomorphic maximal subalgebras are considered. The algebras are classified for coclass zero, one, and two. The results are field dependent.

Let g be a finite dimensional Lie algebra over an algebraically closed field k of characteristic zero. We collect some general results on the Poisson center of S(g), including some simple criteria regarding its polynomiality, and also on…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

Hereby we complete the proof of integrability of the Lax systems, based on pseudo-Riemannian coset manifolds G/H^{*}, we recently presented in a previous paper [arXiv:0903.2559]. Supergravity spherically symmetric black hole solutions have…

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

Let $k$ be the algebraic closure of a finite field, $G$ a Chevalley group over $k$, $U$ the maximal unipotent subgroup of $G$. To each orthogonal subset $D$ of the root system of the group $G$ and each set $\xi$ of $|D|$ non-zero scalars…

Let g be a semisimple Lie algebra over an algebraically closed field K of characteristic 0 and O be a nilpotent orbit in g. Then Orb is a symplectic algebraic variety and one can ask whether it is possible to quantize $\Orb$ (in an…

This study investigates tridiagonal near-Toeplitz matrices in which the Toeplitz part is strictly diagonally dominant. The focus is on determining the exact inverse of these matrices and establishing upper bounds for the infinite norms of…

In this paper we study centrally symmetric Birkhoff billiard tables. We introduce a closed invariant set $\mathcal{M}_\mathcal{B}$ consisting of locally maximizing orbits of the billiard map lying inside the region $\mathcal{B}$ bounded by…

We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…

In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…

We study the maximum set coverage problem in the massively parallel model. In this setting, $m$ sets that are subsets of a universe of $n$ elements are distributed among $m$ machines. In each round, these machines can communicate with each…