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

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

Which groups can occur as the group of units in a ring? Such groups are called realizable. Though the realizable members of several classes of groups have been determined (e.g., cyclic, odd order, alternating, symmetric, finite simple,…

Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…

One strategy to solve a nonlinear eigenvalue problem $T(\lambda)x=0$ is to solve a polynomial eigenvalue problem (PEP) $P(\lambda)x=0$ that approximates the original problem through interpolation. Then, this PEP is usually solved by…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Inverse reinforcement learning (IRL) is the task of finding a reward function that generates a desired optimal policy for a given Markov Decision Process (MDP). This paper develops an information-theoretic lower bound for the sample…

We consider the inverse eigenvalue problem of constructing a substochastic matrix from the given spectrum parameters with the corresponding eigenvector constraints. This substochastic inverse eigenvalue problem (SstIEP) with the specific…

This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact…

In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…

A novel matching based heuristic algorithm designed to detect specially formulated infeasible zero-one IPs is presented. The algorithm input is a set of nested doubly stochastic subsystems and a set E of instance defining variables set at…

The problem of classification into symmetry integrable classes is solved for a family of second order nonlinear evolution equations labeled by arbitrary functions. Four nonequivalent symmetry integrable classes are thus obtained and the…

Given a set $V$, a subset $S$, and a permutation $\pi$ of $V$, we say that $\pi$ permutes $S$ if $\pi (S) \cap S = \emptyset$. Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S_i \subseteq V ~~(i=1,\ldots ,m)$, we say that $\cS$…

A map is called a {\it $p$-map} if it has a prime $p$-power vertices. An orientably-regular (resp. A regular ) $p$-map is called {\it solvable} if the group $G^+$ of all orientation-preserving automorphisms (resp. the group $G$ of…

We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply…

Recently is has been proved that if $\sigma\in GL_n(R)$ where $R$ is an commutative ring and $n\geq 3$, then each of the elementary transvections $t_{kl}(\sigma_{ij})~(i\neq j,k\neq l)$ is a product of eight $E_n(R)$-conjugates of $\sigma$…

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

A ring $R$ is called right SSP (SIP) if the sum (intersection) of any two direct summands of $R_{R}$ is also a direct summand. Left sides can be defined similarly. The following are equivalent: (1) $R$ is right SSP. (2) $R$ is right C3 and…

Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with…

We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational…