Related papers: Solving one-sided linear systems over symmetrized …
This paper studies a system of linear equations, denoted as $Ax = b$, which is horizontally partitioned (rows in $A$ and $b$) and stored over a network of $m$ devices connected in a fixed directed graph. We design a fast distributed…
In the framework of semiclassical resonances, we make more precise the link between polynomial estimates of the extension of the resolvent and propagation of the singularities through the trapped set. This approach makes it possible to…
This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many…
In this paper we study the convergence of the max-consensus protocol. Tropical algebra is used to formulate the problem. Necessary and sufficient conditions for convergence of the max-consensus protocol over fixed as well as switching…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…
We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…
We develop a purely combinatorial theory of limit linear series on metric graphs. This will be based on the formalisms of hypercube rank functions and slope structures. We provide a full classification of combinatorial limit linear series…
We deal with interval parametric systems of linear equations and the goal is to solve such systems, which basically comes down to finding an enclosure for a parametric solution set. Obviously we want this enclosure to be as tight as…
Matrix factorization problems over various semirings naturally arise in different contexts of modern pure and applied mathematics. These problems are very hard in general and cause computational difficulties in applications. We give a…
We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…
In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end.
We introduce rational semimodules over semirings whose addition is idempotent, like the max-plus semiring, in order to extend the geometric approach of linear control to discrete event systems. We say that a subsemimodule of the free…
We initiate the theory of a quadratic form $q$ over a semiring $R$. As customary, one can write $$q(x+y) = q(x) + q(y)+ b(x,y),$$ where $b$ is a companion bilinear form. But in contrast to the ring-theoretic case, the companion bilinear…
Continuing the study of the structure of semirings, we turn to the spectrum of prime congruences. Joo and Mincheva developed an elegant theory in the special case of idempotent semirings, which is generalized here to ``semiring pairs,''…
We consider the solution of complex symmetric shifted linear systems. Such systems arise in large-scale electronic structure simulations and there is a strong need for the fast solution of the systems. With the aim of solving the systems…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We explore several facets of tropical subrepresentations of a linear representation of a group over the tropical semifield $\mathbb{T}$. A key role in the study of tropical subrepresentations is played by two types of modules over a…
In this paper, given a linear system of equations A x = b, we are finding locations in the plane to place objects such that sending waves from the source points and gathering them at the receiving points solves that linear system of…