Related papers: Left-eigenvectors are certificates of the Orbit Pr…
In this paper, we begin a quantization program for nilpotent orbits of a real semisimple Lie group. These orbits and their covers generalize the symplectic vector space. A complex structure polarizing the orbit and invariant under a maximal…
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a…
Geometric modeling of multivariate reliability polynomials is based on algebraic hypersurfaces, constant level sets, rulings etc. The solved basic problems are: (i) find the reliability polynomial using the Maple and Matlab software…
Matrix (or operator) recovery from linear measurements is a well-studied problem. However, there are situations where only bilinear or quadratic measurements are available. A bilinear or quadratic problem can easily be transformed into a…
For a general formulation of linearised hybrid inverse problems in impedance tomography, the qualitative properties of the solutions are analysed. Using an appropriate scalar pseudo-differential formulation, the problems are shown to permit…
We consider certificates of positivity for univariate polynomials with rational coefficients that are positive over (an interval of)~$\mathbb{R}$. Such certificates take the form of weighted sums of squares (SOS) of polynomials with…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We provide out-of-sample certificates on the controlled invariance property of a given set with respect to a class of black-box linear systems. Specifically, we consider linear time-invariant models whose state space matrices are known only…
Two confluent rewriting systems in noncommutatives polynomials are constructed using the equations allowing the identification of the local coordinates (of second kind) of the graphs of the $\zeta$ polymorphism as being (shuffle or…
We investigate the problem of recovering coefficients in scalar nonlinear ordinary differential equations that can be exactly linearized. This contribution builds upon prior work by Lyakhov, Gerdt, and Michels, which focused on obtaining a…
This paper investigates the eigenvalue problem of integral operators whose kernels can be expressed as a finite sum of pairwise products of single-variable functions, making them separable. By consdiering the matrix form of the separable…
We consider Sturm-Liouville problems with a discontinuity in an interior point, which are motivated by the inverse problems for the torsional modes of the Earth. We assume that the potential on the right half-interval and the coefficient in…
In this paper we study the $\kappa$-word problem for the pseudovariety ${\bf LG}$ of local groups, where $\kappa$ is the canonical signature consisting of the multiplication and the pseudoinversion. We solve this problem by transforming…
Convexification is a core technique in global polynomial optimization. Currently, there are two main approaches competing in theory and practice: the approach of nonlinear programming and the approach based on positivity certificates from…
We consider the inverse optimization problem associated with the polynomial program f^*=\min \{f(x): x\in K\}$ and a given current feasible solution $y\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution.…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
In this paper we provide universal formulas describing Drinfeld-type quantization of inhomogeneous orthogonal groups determined by a metric tensor of an arbitrary signature living in a spacetime of arbitrary dimension. The metric tensor…
Cartan's equivalence method is applied to explicitly construct invariant coframes for four branches, which are used to characterize all non-linearizable third-order ODEs with a four-dimensional Lie symmetry subalgebra under point…
We consider the constrained Linear Inverse Problem (LIP), where a certain atomic norm (like the $\ell_1 $ norm) is minimized subject to a quadratic constraint. Typically, such cost functions are non-differentiable, which makes them not…
Solvability of the rational quantum integrable systems related to exceptional root spaces $G_2, F_4$ is re-examined and for $E_{6,7,8}$ is established in the framework of a unified approach. It is shown the Hamiltonians take algebraic form…