Related papers: Matrix-valued Laurent polynomials, parametric line…
A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of…
The paper concerns the solvability by quadratures of linear differential systems, which is one of the questions of differential Galois theory. We consider systems with regular singular points as well as those with (non-resonant) irregular…
In this paper, we study the hardness of solving graph-structured linear systems with coefficients over a finite field $\mathbb{Z}_p$ and over a polynomial ring $\mathbb{F}[x_1,\ldots,x_t]$. We reduce solving general linear systems in…
This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…
A semicoherent system can be described by its structure function or, equivalently, by a lattice polynomial function expressing the system lifetime in terms of the component lifetimes. In this paper we point out the parallelism between the…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We perform a classification of third order integrable systems of evolution equations with respect to higher symmetries. Applying it, we consider polynomial systems that are 0-homogeneous under a suitable weighting of variables with main…
A generalization of modularity, called block modularity, is defined. This is a quality function which evaluates a label assignment against an arbitrary block pattern. Therefore, unlike standard modularity or its variants, arbitrary network…
In this paper, we investigate when system identification is statistically easy or hard, in the finite sample regime. Statistically easy to learn linear system classes have sample complexity that is polynomial with the system dimension. Most…
Linear systems are the bedrock of virtually all numerical computation. Machine learning poses specific challenges for the solution of such systems due to their scale, characteristic structure, stochasticity and the central role of…
The identification of electrical, mechanical, and biological systems using data can benefit greatly from prior knowledge extracted from physical modeling. Parametric continuous-time identification methods can naturally incorporate this…
In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…
Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data.…
We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…
The T and Y-systems are ubiquitous structures in classical and quantum integrable systems. They are difference equations having a variety of aspects related to commuting transfer matrices in solvable lattice models, q-characters of…
The theory of persistence modules on the commutative ladders $CL_n(\tau)$ provides an extension of persistent homology. However, an efficient algorithm to compute the generalized persistence diagrams is still lacking. In this work, we view…
Bilinear systems emerge in a wide variety of fields as natural models for dynamical systems ranging from robotics to quantum dots. Analyzing controllability of such systems is of fundamental and practical importance, for example, for the…
A plane algebraic curve whose Newton polygone contains d lattice points can be given by d points it passes through. Then the coefficients of its equation Poisson commute having been regarded as functions of coordinates of those points. It…
Some new developments in constrained Lax integrable systems and their applications to physics are reviewed. After summarizing the tau function construction of the KP hierarchy and the basic concepts of the symmetry of nonlinear equations,…