Mengoli's mathematical ideas in Leibniz's excerpts

In the seventeenth century many changes occurred in the practice of mathematics. An essential change was the establishment of a symbolic language, so that the new language of symbols and techniques could be used to obtain new results. Pietro Mengoli (1626/7–86), a pupil of Cavalieri, considered the use of symbolic language and algebraic procedures essential for solving all kinds of problems. Following the algebraic research of Viète, Mengoli constructed a geometry of species, Geometriae Speciosae Elementa (1659), which allowed him to use algebra in geometry in complementary ways to solve quadrature problems, and later to compute the quadrature of the circle in his Circolo (1672). In a letter to Oldenburg as early as 1673, Gottfried Wilhelm Leibniz (1646–1716) expressed an interest in Mengoli's works, and again later in 1676, when he wrote some excerpts from Mengoli's Circolo. The aim of this paper is to show how in these excerpts Leibniz dealt with Mengoli's ideas as well as to provide new insights into Leibniz's mathematical interpretations and commentsPeer ReviewedPostprint (author's final draft

Sampling algebraic sets in local intrinsic coordinates

Numerical data structures for positive dimensional solution sets of polynomial systems are sets of generic points cut out by random planes of complimentary dimension. We may represent the linear spaces defined by those planes either by explicit linear equations or in parametric form. These descriptions are respectively called extrinsic and intrinsic representations. While intrinsic representations lower the cost of the linear algebra operations, we observe worse condition numbers. In this paper we describe the local adaptation of intrinsic coordinates to improve the numerical conditioning of sampling algebraic sets. Local intrinsic coordinates also lead to a better stepsize control. We illustrate our results with Maple experiments and computations with PHCpack on some benchmark polynomial systems.Comment: 13 pages, 2 figures, 2 algorithms, 2 table

Computability and analysis: the legacy of Alan Turing

We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 page

Finding Near-Optimal Independent Sets at Scale

The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates kernelization techniques to compute large independent sets in huge sparse networks. A recent exact algorithm has shown that large networks can be solved exactly by employing a branch-and-reduce technique that recursively kernelizes the graph and performs branching. However, one major drawback of their algorithm is that, for huge graphs, branching still can take exponential time. To avoid this problem, we recursively choose vertices that are likely to be in a large independent set (using an evolutionary approach), then further kernelize the graph. We show that identifying and removing vertices likely to be in large independent sets opens up the reduction space---which not only speeds up the computation of large independent sets drastically, but also enables us to compute high-quality independent sets on much larger instances than previously reported in the literature.Comment: 17 pages, 1 figure, 8 tables. arXiv admin note: text overlap with arXiv:1502.0168