Related papers: The quadratic assignment problem is easy for Robin…

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…

Let $p,q$ be coprime integers such that $|p|+|q|>2$. We characterize the matrices $A\in\mathcal{M}_n(\mathbb{C})$ such that $A^p$ and $A^q$ are similar. If $A$ is invertible, we prove that $A$ is a polynomial in $A^p$ and $A^q$. To achieve…

It is known that difference equations generated as the Newton-Raphson iteration for quadratic equations are solvable in closed form, and the solution can be constructed from linear three-term recurrence relations with constant coefficients.…

The Birkhoff polytope is defined to be the convex hull of permutation matrices, $P_{\sigma}\ \forall \sigma\in S_n$. We define a second-order permutation matrix $P^{[2]}_{\sigma}$ in $\mathbb{R}^{n^2\times n^2}$ corresponding to a…

This paper studies two structured approximation problems: (1) Recovering a corrupted low-rank Toeplitz matrix and (2) recovering the range of a Fourier matrix from a single observation. Both problems are computationally challenging because…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…

In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the…

A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…

Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB. It is known that QAP tai256c can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint…

We propose an algebraic viewpoint of the problem of deformation quantization of the so called almost Poisson algebras, which are algebras with a commutative associative product and an antisymmetric bracket which is a bi-derivation but does…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

The rational covariance extension problem to determine a rational spectral density given a finite number of covariance lags can be seen as a matrix completion problem to construct an infinite-dimensional positive-definite Toeplitz matrix…

We develop an inverse scattering transform formalism for the "good" Boussinesq equation on the line. Assuming that the solution exists, we show that it can be expressed in terms of the solution of a $3 \times 3$ matrix Riemann-Hilbert…

Let K be an infinite field and let R be a K-algebra endowed with a homogeneous polynomial norm N of degree n. If N satisfies a formal analogue of the Cayley-Hamilton Theorem the we will show that R is a quotient of the ring of the…

We consider a class of nonlinear elliptic problems associated with models in biophysics, which are described by the Poisson-Boltzmann equation (PBE). We prove mathematical correctness of the problem, study a suitable class of…

We give a short and elementary proof of a $(q, \mu, \nu)$-deformed Binomial distribution identity arising in the study of the $(q, \mu, \nu)$-Boson process and the $(q, \mu, \nu)$-TASEP. This identity found by Corwin in [4] was a key…

Solving the Lexicographic Bottleneck Assignment Problem (LexBAP) typically relies on centralised computation with order quartic complexity. We consider the Sequential Bottleneck Assignment Problem (SeqBAP), which yields a greedy solution to…

Let $A$ be an $n\times n$ real Toeplitz matrix satisfying $A+A^{\top}=2\mathbb J_n$, where $\mathbb J_n$ is the all-ones matrix.If $A_r(i,j)$ denotes the $r\times r$ contiguous submatrix of $A$ consisting of rows $i,i+1,\dots,i+r-1$ and…

There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…