Related papers: A Canonical Form for Max Plus Symmetric Matrices a…
This paper provides closed-form formulas for a multidimensional two-sided matching problem with transferable utility and heterogeneity in tastes. When the matching surplus is quadratic, the marginal distributions of the characteristics are…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…
We consider an isomorphism between the idempotent convexity based on the maximum and the addition operations and the idempotent measure convexity on the maximum and the multiplication operations. We use this isomorphism to investigate…
In this Master's thesis, we consider the problem of classifying, up to conjugation by linear symplectomorphisms, linear canonical relations (lagrangian correspondences) from a finite-dimensional symplectic vector space to itself. We give an…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…
In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
This work builds on earlier work of the first three authors where a notion of congruence modules in higher codimension is introduced. The main new results are a criterion for detecting regularity of local rings in terms of congruence…
We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
We give a new method to prove in a uniform and easy way various transformation formulas for Gauss hypergeometric functions. The key is Jacobi's canonical form of the hypergeometric differential equation. Analogy for $q$-hypergeometric…
We study the uniqueness properties of classical semiconjugations for analytic self-maps of the disk, by characterizing them as canonical solutions to certain functional equations. As a corollary, we obtain a complete description of all…
General nonconvex optimization problems are studied by using the canonical duality-triality theory. The triality theory is proved for sums of exponentials and quartic polynomials, which solved an open problem left in 2003. This theory can…
We prove that, for any theory defined over a space-time with boundary, the symplectic form derived in the covariant phase space is equivalent to the one derived from the canonical formalism.
We give canonical matrices of bilinear or sesquilinear forms UxV-->C, (V/U)xV-->C, in which V is a vector space over the field C of complex numbers and U is its subspace.
In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…
We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…