Related papers: Smith Form Equivalence for Several Classes of Mult…
Many psychological theories can be operationalized as linear inequality constraints on the parameters of multinomial distributions (e.g., discrete choice analysis). These constraints can be described in two equivalent ways: Either as the…
Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…
We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…
V.I. Arnold [Russian Math. Surveys 26(2) (1971) 29-43] constructed a miniversal deformation of a square complex matrix under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it…
We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum…
Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…
In this paper we study multiplicity and qualitative behavior of solutions for semilinear elliptic problems with neumann boundary condition and asymptotically linear smooth nonlinearity. We provide sufficient conditions on the number of…
Fitted probabilities from widely used Bayesian multinomial probit models can depend strongly on the choice of a base category, which is used to uniquely identify the parameters of the model. This paper proposes a novel identification…
Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…