Related papers: Matrix-valued Laurent polynomials, parametric line…
Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability; but, need to be used with an appropriate preconditioner (e.g.,…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
The theory of matrix models is reviewed from the point of view of its relation to integrable hierarchies. Discrete 1-matrix, 2-matrix, ``conformal'' (multicomponent) and Kontsevich models are considered in some detail, together with the…
We present a technique for translating a black-box machine-learned classifier operating on a high-dimensional input space into a small set of human-interpretable observables that can be combined to make the same classification decisions. We…
A linear parameter must be consumed exactly once in the body of its function. When declaring resources such as file handles and manually managed memory as linear arguments, a linear type system can verify that these resources are used…
Given a parametric lattice with a basis given by polynomials in Z[t], we give an algorithm to construct an LLL-reduced basis whose elements are eventually quasi-polynomial in t: that is, they are given by formulas that are piecewise…
We introduce a class of integrable $l$-field first-order lattices together with corresponding Lax equations. These lattices may be represented as consistency condition for auxiliary linear systems defined on sequences of formal dressing…
In this paper, we address an extension of the Loewner framework for learning quadratic control systems from input-output data. The proposed method first constructs a reduced-order linear model from measurements of the classical transfer…
A linearizable version of multidimensional system of $n$-wave type nonlinear PDEs is proposed. This system is derived using the spectral representation of its solution via the procedure similar to the dressing method for the ISTM-integrable…
We deal with algorithmic techniques for minimal cost input-connectivity while maintaining controllability of linear systems. The input matrix is assumed to be constrained in the sense that the set of states that each input (if present) can…
We present a polynomial-time algorithm that obtains a set of Asymptotic Linear Programs (ALPs) from a given linear system S, such that one of these ALPs admits a feasible solution if and only if S admits a feasible solution. We also show…
We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow to detect the entanglement…
We consider a hierarchy of many-particle systems on the line with polynomial potentials separable in parabolic coordinates. The first non-trivial member of this hierarchy is a generalization of an integrable case of the H\'enon-Heiles…
The Painleve test is very useful to construct not only the Laurent-series solutions but also the elliptic and trigonometric ones. Such single-valued functions are solutions of some polynomial first order differential equations. To find the…
We define and characterize the $f$-matrices associated to Pascal-like matrices that are defined by ordinary and exponential Riordan arrays. These generalize the face matrices of simplices and hypercubes. Their generating functions can be…
We define the concept of weighted lattice polynomial functions as lattice polynomial functions constructed from both variables and parameters. We provide equivalent forms of these functions in an arbitrary bounded distributive lattice. We…
A lattice model of critical dense polymers is solved exactly for finite strips. The model is the first member of the principal series of the recently introduced logarithmic minimal models. The key to the solution is a functional equation in…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
In this paper, we use two-variable Laurent polynomials attached to matrices to encode properties of compositions of sequences. The Lagrange identity in the ring of Laurent polynomials is then used to give a short and transparent proof of a…
The Lax-Sato approach to the hierarchies of Manakov-Santini type is formalized in order to extend it to a more general class of integrable systems. For this purpose some linear operators are introduced, which must satisfy some integrability…