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

A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

We introduce the abstract concept of supernilpotence in loop theory, and relate it to existing concepts, namely, central nilpotence and nilpotence of the multiplication group. We prove that the class of supernilpotence is greater or equal…

We give a geometric description for the dominant characteristic of a nilpotent orbit in an arbitrary finite-dimensional rational G-module. In particular, we obtain a generalization of a recent result of Gunnells-Sommers, see…

The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP.…

Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which…

In this paper we study the subset sum problem with real numbers. Starting from the given problem, we formulate a quadratic maximization problem over a polytope, P, which is eventually written as a distance maximization to a fixed point over…

The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash},…

In this paper, we give upper bounds for the index of the quotient of the Borel subalgebra of a simple Lie algebra or its nilpotent radical by an ad-nilpotent ideal. For the nilpotent radical quotient, our bound is a generalization of the…

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.

We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…

We use results on inclusions of free products and extensions of completely positive maps to determine the maximal $C^*$-envelope for upper triangular $3 \times 3$ matrices. We consider these same results in the context of larger upper…

Conventional ways to solve optimization problems on low-rank matrix sets which appear in great number of applications ignore its underlying structure of an algebraic variety and existence of singular points. This leads to appearance of…

Let $G$ be a simple simply-connected algebraic group over an algebraically closed field $k$ of characteristic $p>0$ with $\mathfrak{g}={\rm Lie}(G)$. We discuss various properties of nilpotent orbits in $\mathfrak{g}$, which have previously…

In practice, deep neural networks are often able to easily interpolate their training data. To understand this phenomenon, many works have aimed to quantify the memorization capacity of a neural network architecture: the largest number of…

The index of a complex Lie algebra is the minimal codimension of its coadjoint orbits. Let us suppose $\g$ semisimple, then its index, ${\rm ind} \g$, is equal to its rank, ${\rm rk \g}$. The goal of this paper is to establish a simple…

We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring…