Related papers: On the complexity of Chow and Hurwitz forms
In this paper, we prove a decomposition result for the Chow groups of projectivizations of coherent sheaves of homological dimension $\le 1$. In this process, we establish the decomposition of Chow groups for the cases of Cayley's trick and…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
We develop a constructive process which determines all extreme points of the unit ball of the space of $m$--linear forms, $m\geq1.$ Our method provides a full characterization of the geometry of that space through finitely many elementary…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
A proof for a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power…
Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…
The Chow rank of a form is the length of its smallest decomposition into a sum of products of linear forms. For a generic form, this corresponds to finding the smallest secant variety of the Chow variety which fills the ambient space. We…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
In this work we study, in greater detail than before, J.H. Conway's topographs for integral binary quadratic forms. These are trees in the plane with regions labeled by integers following a simple pattern. Each topograph can display the…
Hurwitz numbers count ramified genus $g$, degree $d$ coverings of the projective line with with fixed branch locus and fixed ramification data. Double Hurwitz numbers count such covers, where we fix two special profiles over $0$ and…
The Beilinson-Bloch type conjectures predict that the low degree rational Chow groups of intersections of quadrics are one dimensional. This conjecture was proved by Otwinowska. Making use of homological projective duality and the recent…
A theorem of Chow concerns homomorphisms of two abelian varieties under a primary field extension base change. In this paper we generalize Chow's theorem to semi-abelian varieties. This contributes to different proofs of a well-known result…
We use localization to describe the restriction map from equivariant Chow cohomology to ordinary Chow cohomology for complete toric varieties in terms of piecewise polynomial functions and Minkowski weights. We compute examples showing that…
In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formulas) with equality. Given a logic $\mathbf{\mathcal{L}}$, the…
An efficient integral equation based solver is constructed for the electrostatic problem on domains with cuboidal inclusions. It can be used to compute the polarizability of a dielectric cube in a dielectric background medium at virtually…
We prove sum formulas for double polylogarithms of Hurwitz type, that is, involving a shifting parameter $b$ in the denominator. These formulas especially imply well-known sum formulas for double zeta values, and sum formulas for double…