Related papers: On the max-algebraic core of a nonnegative matrix

We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…

Let $X=\{x_i\}_{i=1}^m$ be a set of unit vectors in $\RR^n$. The coherence of $X$ is $\coh(X):=\max_{i\not=j}|\langle x_i, x_j\rangle|$. A vector $x\in X$ is said to be isolable if there are no unit vectors $x'$ arbitrarily close to $x$…

We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…

We introduce and study the notion of maximal tracial algebras. We prove several results in a general setting based on dual pairs and multiplier pairs. In a special case that X is a Banach space we determine the abelian subalgebras of B(X)…

The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…

Let $R$ be a commutative ring and $M_n(R)$ be the ring of $n \times n$ matrices with entries from $R$. For each $S \subseteq M_n(R)$, we consider its (generalized) null ideal $N(S)$, which is the set of all polynomials $f$ with coefficients…

Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…

A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified…

In pursuit of a minimal basis for systems with non-ideal bond angles, in this work we try to pinpoint the exact orientation of the major overlapping orbitals along the nearest neighbouring coordination segments in a given system such that…

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…

An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…

Totally positive matrices are related with the shape preserving representations of a space of functions. The normalized B-basis of the space has optimal shape preserving properties. B-splines and rational Bernstein bases are examples of…

The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated…

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…

An element $X$ in the algebra ${\rm M}(n,\mathbb{F})$ of all $n\times n$ matrices over a field $\mathbb{F}$ is said to be $f$-cyclic if the underlying vector space considered as an $\mathbb{F}[X]$-module has at least one cyclic primary…

We investigate the equilibrium and nonequilibrium properties of the core region of vortices in layered superconductors. We discuss the electronic structure of singly and doubly quantized vortices for both s-wave and d-wave pairing symmetry.…

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…

We study minimal reductions of edge ideals of graphs and determine restrictions on the coefficients of the generators of these minimal reductions. We prove that when $I$ is not basic, then $\core{I}\subset \m I$, where $I$ is an edge ideal…