Related papers: A short proof for the parameter continuation theor…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
The Hilbert scheme $\mathbf{Hilb}_{p(t)}^{n}$ parametrizes closed subschemes and families of closed subschemes in the projective space $\mathbb{P}^n$ with a fixed Hilbert polynomial $p(t)$. It is classically realized as a closed subscheme…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…
We set up the theory for a distributed algorithm for computing persistent homology. For this purpose we develop linear algebra of persistence modules. We present bases of persistence modules, and give motivation as for the advantages of…
A theorem of Gr\"unbaum, which states that every $m$-polytope is a refinement of an $m$-simplex, implies the following generalization of Tverberg's theorem: if $f$ is a linear function from an $m$-dimensional polytope $P$ to $\mathbb{R}^d$…
We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…
The persistence theory has been employed by several authors in order to study persistence properties of dynamical systems generated by ordinary differential equations or maps across diverse disciplines. In this note, the author discusses a…
Gotzmann's persistence theorem provides a method for determining the Hilbert polynomial of a subscheme of projective space by evaluating the Hilbert function at only two points, irrespective of the dimension of the ambient space. In…
Fourier continuation is an approach used to create periodic extensions of non-periodic functions in order to obtain highly-accurate Fourier expansions. These methods have been used in PDE-solvers and have demonstrated high-order convergence…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
We give a short elementary proof of the main theorem in the paper "Differential calculus on graphon space" by Diao et al. (JCTA 2015), which says that any graphon parameters whose $(N+1)$-th derivatives all vanish must be a linear…
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jablonski,…
Twenty years after the discovery of the F5 algorithm, Gr\"obner bases with signatures are still challenging to understand and to adapt to different settings. This contrasts with Buchberger's algorithm, which we can bend in many directions…
The Quillen-McCord theorem (aka Quillen fiber lemma) gives a sufficient condition on a map between classifying spaces of posetal categories to be a homotopy equivalence. Jonathan Ariel Barmak in his paper [arXiv:1005.0538] gives an…
In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…