On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:25, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant |
scientific article |
Statements
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (English)
0 references
23 September 2016
0 references
Let \(X\) be a compact topological space endowed with a finite measure. For \(f,g:X\to{\mathbb C}\) measurable and continuous respectively, their zeta Mahler function at a complex point \(t\) roughly speaking is the expectation of \(|f|^t\) with respect to the probability distribution on \(X\) using \(|g|\) as a probability density function. The paper under review explores several extensions and generalizations of this notion to analyze the average behavior of numerical invariants associated to zero-dimensional complete intersection projective algebraic varieties, and numerical solving of polynomial systems. In one of their main results, the arithmetic height of the discriminant variety is being made explicit: Theorem. Let \(\Sigma_{(d)}\) be the discriminant variety defined by those systems \((f_1,\ldots, f_n)\) of homogeneous polynomials in \({\mathbb C}[X_0,\ldots, X_n]\) of respective degrees \((d)=(d_1,\ldots, d_n),\) and denote with \(\text{ht}({\cdot})\) the unitarily invariant height function. Then, \[ \text{ht}(\Sigma_{(d)})=\text{ht}(\text{Disc}_{(d)})=\frac{\prod_{i=1}^nd_i}2\left(\big(\sum_{i=1}^n(d_i-1)\big)\big(\sum_{i=1}^nH_i\big)+\sum_{i=1}^n\log d_i \right), \] where \(\text{Disc}_{(d)}\) is the polynomial defining the discriminant variety \(\Sigma_{(d)},\) and \(H_i=\sum_{j=1}^i\frac{1}{j}.\) Results of this kind can be applied to provide sharper upper bounds for the error probability of some modular arithmetic algorithms.
0 references
polynomial equation solving
0 references
affine and projective varieties
0 references
condition number
0 references
discriminant
0 references
zeta Mahler measure
0 references
co-area formula
0 references