Related papers: Constructing New Realisable Lists from Old in the …

Given a diagonalizable $N\times N$ matrix $H$, whose non-degenerate spectrum consists of $p$ pairs of complex conjugate eigenvalues and additional $N-2p$ real eigenvalues, we determine all metrics $M$, of all possible signatures, with…

An invertible matrix is called a Perron similarity if it diagonalizes an irreducible, nonnegative matrix. Each Perron similarity gives a nontrivial polyhedral cone, called the spectracone, and polytope, called the spectratope, of realizable…

In the well-known complexity class NP are combinatorial problems, whose optimization counterparts are important for many practical settings. These problems typically consider full knowledge about the input. In practical settings, however,…

Given a countable Turing ideal $\mathcal{I} \subseteq \omega^{\omega}$, we say that $x$ is a list (resp. weak list) of $\mathcal{I}$ if $\mathcal{I}=\{x^{[n]} : n \in \omega\}$ (resp. if $\mathcal{I} \subseteq \{x^{[n]} :n \in \omega\}$).…

We propose NEP_MiniMax, a novel computational method for solving nonlinear eigenvalue problems (NEPs) $T(\lambda)\mathbf{u}= 0$ on compact continua $\Omega \subset \mathbb{C}$. The method combines two key components: (1) a rational minimax…

Perfect ideals $I$ of grade $3$ in a local ring $(R,\mathfrak{m},\Bbbk)$ can be classified based on multiplicative structures on $\text{Tor}^R_{\bullet}(R/I,\Bbbk)$. The classification is incomplete in the sense that it remains open which…

The linear ordering problem (LOP), which consists in ordering M objects from their pairwise comparisons, is commonly applied in many areas of research. While efforts have been made to devise efficient LOP algorithms, verification of whether…

We consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the infinite set of 1CSP instances, with a fixed demand n, into…

This paper introduces a novel neural network for efficiently solving Structured Inverse Eigenvalue Problems (SIEPs). The main contributions lie in two aspects: firstly, a unified framework is proposed that can handle various SIEPs…

Let $A=(a_{ij})$ be an $n$-by-$n$ matrix. For any real number $\mu$, we define the polynomial $$P_\mu(A)=\sum_{\sigma\in S_n} a_{1\sigma(1)}\cdots a_{n\sigma(n)}\,\mu^{\ell(\sigma)}\; ,$$ as the $\mu$-permanent of $A$, where $\ell(\sigma)$…

The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

A sequence $a=(a_n)_{n=1}^\infty$ of non-negative integers is called realizable if there is a self-map $T:X\to X$ on a set $X$ such that $a_n$ is equal to the number of periodic points of $T$ in $X$ of (not necessarily exact) period $n$,…

Let $\sigma_n(\cdot)$ denote the least singular value of a $n \times n$ matrix. It is well-known that $\mathbb{P}[\sigma_n(A) \le \varepsilon] \le \varepsilon n$ if $A$ is drawn from the real Ginibre ensemble of $n \times n$ matrices and…

An integer program (IP) with a finite number of feasible solutions may have an unbounded linear programming relaxation if it contains irrational parameters, due to implicit constraints enforced by the irrational numbers. We show that those…

Let $A$ be an irreducible (entrywise) nonnegative $n\times n$ matrix with eigenvalues $$\rho, b+ic,b-ic, \lambda_4,\cdots,\lambda_n,$$ where $\rho$ is the Perron eigenvalue. It is shown that for any $t \in [0, \infty)$ there is a…

We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…

Inverse reinforcement learning (IRL) aims to recover the reward function of an expert agent from demonstrations of behavior. It is well-known that the IRL problem is fundamentally ill-posed, i.e., many reward functions can explain the…

A tensor $\mathcal T\in \mathbb T(\mathbb C^n,m+1)$, the space of tensors of order $m+1$ and dimension $n$ with complex entries, has $nm^{n-1}$ eigenvalues (counted with algebraic multiplicities). The inverse eigenvalue problem for tensors…

An new eigenvalue $\mathbb R$-linear problem arisen in the theory of metamaterials is stated and constructively investigated for circular non-overlapping inclusions. An asymptotic formula for eigenvalues is deduced when the radii of…