Related papers: Computing Linear Matrix Representations of Helton-…

Classical vector analysis is the predominant formalism used by engineers of computational electromagnetism, despite the fact that manifold as a theoretical concept has existed for a century. This paper discusses the benefits of manifolds…

In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each…

In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

This paper deals with holomorphic self-maps of the complex projective plane and the algebraic relations among the eigenvalues of the derivatives at the fixed points. These eigenvalues are constrained by certain index theorems such as the…

Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions…

We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…

We consider a 3-parameter family of linear special double confluent Heun equations introduced and studied by V.M.Buchstaber and S.I.Tertychnyi, which is an equivalent presentation of a model of Josephson junction in superconductivity.…

In this work we develop a method for computing mathematically rigorous enclosures of some one dimensional manifolds of heteroclinic orbits for nonlinear maps. Our method exploits a rigorous curve following argument build on high order…

A numerical scheme for computing arc-length parametrized curves of low bending energy that are confined to convex domains is devised. The convergence of the discrete formulations to a continuous model and the unconditional stability of an…

We show that one can define through the symmetry approach a procedure to check the linearizability of a difference equation via a point or a discrete Cole-Hopf transformation. If the equation is linearizable the symmetry provides the…

Statistical-physics calculations in machine learning and theoretical neuroscience often involve lengthy derivations that obscure physical interpretation. Here, we give concise, non-replica derivations of several key results and highlight…

In this note, we study linear determinantal representations of smooth plane cubics over finite fields. We give an explicit formula of linear determinantal representations corresponding to rational points. Using Schoof's formula, we count…

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…

We study soliton solutions of matrix Kadomtsev-Petviashvili (KP) equations in a tropical limit, in which their support at fixed time is a planar graph and polarizations are attached to its constituting lines. There is a subclass of "pure…

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

The geometric kernel (or simply the kernel) of a polyhedron is the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has been largely addressed in the literature, fewer methods have…