Related papers: The Horn problem and planar networks
A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…
Central configurations give rise to self-similar solutions to the Newtonian $N$-body problem, and play important roles in understanding its complicated dynamics. Even the simple question of whether or not there are finitely many planar…
In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…
An analytical solution to the Hill problem Hamiltonian expanded about the libration points has been obtained by means of perturbation techniques. In order to compute the higher orders of the perturbation solution that are needed to capture…
Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…
Extending our method for investigating Real cobordism (which was recently used by Hill, Hopkins and Ravenel in their solution of the Kervaire invariant 1 problem), we investigate the $RO(G)$-graded homotopy groups of a (non-complete)…
A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…
We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…
We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…
We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…
Boundary value problems for integrable nonlinear evolution PDEs formulated on the finite interval can be analyzed by the unified method introduced by one of the authors and used extensively in the literature. The implementation of this…
We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian.…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
Computing polynomial form of the colored HOMFLY-PT for non-arborescent knots obtained from three or more strand braids is still an open problem. One of the efficient methods suggested for the three-strand braids relies on the eigenvalue…
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 series of three articles, we give an exposition of various results and open problems in three areas of algebraic and geometric combinatorics: totally non-negative matrices, representations of the symmetric group, and hyperplane…
Given a planar graph $G$ and an integer $b$, OrthogonalPlanarity is the problem of deciding whether $G$ admits an orthogonal drawing with at most $b$ bends in total. We show that OrthogonalPlanarity can be solved in polynomial time if $G$…
This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Problems, which was…
Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…
We consider a decision-making problem to evaluate absolute ratings of alternatives from the results of their pairwise comparisons according to two criteria, subject to constraints on the ratings. We formulate the problem as a bi-objective…