arXiv subjects

Anders Jensen

Publications and source records attributed to Anders Jensen.

11 recordsLinked to original sources

arXiv2018

Solving polynomial systems via homotopy continuation and monodromy

We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy based solvers in terms of decorated graphs. Under the theoretical assumption that monodromy actions are generated uniformly, we show that the expected number of homotopy paths tracked by an algorithm following this framework is linear in the number of solutions. We demonstrate that our software implementation is competitive with the existing state-of-the-art methods implemented in other software packages.

math.AG↗

arXiv2018

On simulation of local fluxes in molecular junctions

We present a pedagogical review of current density simulation in molecular junction models indicating its advantages and deficiencies in analysis of local junction transport characteristics. In particular, we argue that current density is a universal tool which provides more information than traditionally simulated bond currents, especially when discussing inelastic processes. However, current density simulations are sensitive to choice of basis and electronic structure method. We note that discussing local current conservation in junctions one has to account for source term caused by open character of the system and intra-molecular interactions. Our considerations are illustrated with numerical simulations of a benzenedithiol molecular junction.

cond-mat.mes-hall↗

arXiv2017

Complex band structure and electronic transmission

The function of nano-scale devices critically depends on the choice of materials. For electron transport junctions it is natural to characterize the materials by their conductance length dependence, $β$. Theoretical estimations of $β$ are made employing two primary theories: complex band structure and DFT-NEGF Landauer transport. Both reveal information on $β$ of individual states; i.e. complex Bloch waves and transmission eigenchannels, respectively. However, it is unclear how the $β$-values of the two approaches compare. Here, we present calculations of decay constants for the two most conductive states as determined by complex band structure and standard DFT-NEGF transport calculations for two molecular and one semi-conductor junctions. Despite the different nature of the two methods, we find strong agreement of the calculated decay constants for the molecular junctions while the semi-conductor junction shows some discrepancies. The results presented here provide a template for studying the intrinsic, channel resolved length dependence of the junction through complex band structure of the central material in the heterogeneous nano-scale junction.

cond-mat.mes-hall↗

arXiv2017

Computing Tropical Prevarieties in Parallel

The computation of the tropical prevariety is the first step in the application of polyhedral methods to compute positive dimensional solution sets of polynomial systems. In particular, pretropisms are candidate leading exponents for the power series developments of the solutions. The computation of the power series may start as soon as one pretropism is available, so our parallel computation of the tropical prevariety has an application in a pipelined solver. We present a parallel implementation of dynamic enumeration. Our first distributed memory implementation with forked processes achieved good speedups, but quite often resulted in large variations in the execution times of the processes. The shared memory multithreaded version applies work stealing to reduce the variability of the run time. Our implementation applies the thread safe Parma Polyhedral Library (PPL), in exact arithmetic with the GNU Multiprecision Arithmetic Library (GMP), aided by the fast memory allocations of TCMalloc. Our parallel implementation is capable of computing the tropical prevariety of the cyclic 16-roots problem. We also report on computational experiments on the $n$-body and $n$-vortex problems; our computational results compare favorably with Gfan.

cs.MS↗

arXiv2017

Finding binomials in polynomial ideals

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest degree of a binomial cannot be bounded as a function of the number of indeterminates, the degree of the generators, or the Castelnuovo--Mumford regularity. We approach the detection problem by reduction to the Artinian case using tropical geometry. The Artinian case is solved with algorithms from computational number theory.

math.AC↗

arXiv2015

Stable Intersections of Tropical Varieties

We give several characterizations of stable intersections of tropical cycles and establish their fundamental properties. We prove that the stable intersection of two tropical varieties is the tropicalization of the intersection of the classical varieties after a generic rescaling. A proof of Bernstein's theorem follows from this. We prove that the tropical intersection ring of tropical cycle fans is isomorphic to McMullen's polytope algebra. It follows that every tropical cycle fan is a linear combination of pure powers of tropical hypersurfaces, which are always realizable. We prove that every stable intersection of constant coefficient tropical varieties defined by prime ideals is connected through codimension one. We also give an example of a realizable tropical variety that is connected through codimension one but whose stable intersection with a hyperplane is not.

math.AG↗

arXiv2014

Computing tropical curves via homotopy continuation

Exploiting a connection between amoebas and tropical curves, we devise a method for computing tropical curves using numerical algebraic geometry and give an implementation. As an application, we use this technique to compute Newton polygons of $A$-polynomials of knots.

math.AG↗

arXiv2013

Computing Tropical Resultants

We fix the supports A=(A_1,...,A_k) of a list of tropical polynomials and define the tropical resultant TR(A) to be the set of choices of coefficients such that the tropical polynomials have a common solution. We prove that TR(A) is the tropicalization of the algebraic variety of solvable systems and that its dimension can be computed in polynomial time. The tropical resultant inherits a fan structure from the secondary fan of the Cayley configuration of A and we present algorithms for the traversal of TR(A) in this structure. We also present a new algorithm for recovering a Newton polytope from the support of its tropical hypersurface. We use this to compute the Newton polytope of the sparse resultant polynomial in the case when TR(A) is of codimension 1. Finally we consider the more general setting of specialized tropical resultants and report on experiments with our implementations.

math.AG↗

arXiv2009

How to Draw Tropical Planes

The tropical Grassmannian parameterizes tropicalizations of linear spaces, while the Dressian parameterizes all planes in $\TP^{n-1}$. We study these parameter spaces and we compute them explicitly for $n \leq 7$. Planes are identified with matroid subdivisions and with arrangements of trees. These representations are used to draw pictures.

math.CO↗

arXiv2007

Maximal lattice free bodies, test sets and the Frobenius problem

Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for computing the maximal lattice free bodies of an integral matrix A. An important ingredient is a test set for a certain integer program associated with A. This test set may be computed using algebraic methods. As an application we generalize the Scarf-Shallcross algorithm for the three-dimensional Frobenius problem to arbitrary dimension. In this context our method is inspired by the novel algorithm by Einstein, Lichtblau, Strzebonski and Wagon and the Groebner basis approach by Roune.

math.CO↗

arXiv2005

Computing Tropical Varieties

The tropical variety of a $d$-dimensional prime ideal in a polynomial ring with complex coefficients is a pure $d$-dimensional polyhedral fan. This fan is shown to be connected in codimension one. We present algorithmic tools for computing the tropical variety, and we discuss our implementation of these tools in the Gröbner fan software \texttt{Gfan}. Every ideal is shown to have a finite tropical basis, and a sharp lower bound is given for the size of a tropical basis for an ideal of linear forms.

math.AG↗