Related papers: On the complexity of Chow and Hurwitz forms
We develop a theory of abstract arithmetic Chow rings where the role of the fibers at infinity is played by a complex of abelian groups that computes a suitable cohomology theory. This theory allows the construction of many variants of the…
In the previous three papers in this series, [WKO1]-[WKO3] (arXiv:1405.1956, arXiv:1405.1955, and to appear), Z. Dancso and I studied a certain theory of "homomorphic expansions" of "w-knotted objects", a certain class of knotted objects in…
We introduce a theory of multigraded Cayley-Chow forms associated to subvarieties of products of projective spaces. Two new phenomena arise: first, the construction turns out to require certain inequalities on the dimensions of projections;…
This survey grew out of notes accompanying a cycle of lectures at the workshop Modern Trends in Gromov-Witten Theory, in Hannover. The lectures are devoted to interactions between Hurwitz theory and Gromov-Witten theory, with a particular…
Double Hurwitz numbers count branched covers of the projective line with fixed branch points, with simple branching required over all but two points 0 and infinity, and the branching over 0 and infinity specified by partitions of the degree…
This work presents an extension of the Construction $\pi_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
New formulas are given for Chow forms, discriminants and resultants arising from (not necessarily normal) toric varieties of codimension 2. Exact descriptions are also given for the secondary polygon and for the Newton polygon of the…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
We study the Chow motive (with rational coefficients) of a hypersurface X in the projective space by using the variety F(X) of l-dimensional planes contained in X. If the degree of X is sufficiently small we show that the primitive part of…
We obtain estimates for the number of integral solutions in large balls, of inequalities of the form $|Q(x, y)| < \epsilon$, where $Q$ is an indefinite binary quadratic form, in terms of the Hurwitz continued fraction expansions of the…
We define the Chow ring of the classifying space of a linear algebraic group. In all the examples where we can compute it, such as the symmetric groups and the orthogonal groups, it is isomorphic to a natural quotient of the complex…
Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
Hurwitz numbers count covers of curves satisfying fixed ramification data. Via monodromy representation, this counting problem can be transformed to a problem of counting factorizations in the symmetric group. This and other beautiful…
This note develops some fundamental properties of resultants and related notions. It represents my own personal exploration of this domain, which I found more instructive than seeking answers in the standard literature. Consequently,…
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…
Hurwitz (1887) defined a continued fraction algorithm for complex numbers which is better behaved in many respects than a more "natural" extension of the classical continued fraction algorithm to the complex plane would be. Although the…
The paper provides results regarding the computational complexity of hybrid system identification. More precisely, we focus on the estimation of piecewise affine (PWA) maps from input-output data and analyze the complexity of computing a…
We consider a generalized Riemann-Hurwitz formula as it may be applied to rational maps between projective varieties having an indeterminacy set and fold-like singularities. The case of a holomorphic branched covering map is recalled. Then…