Newton polytopes, increments, and roots of systems of matrix functions for finite-dimensional representations (Q2486716): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Basis property of subsystems of eigen- and associated vectors of a selfadjoint operator pencil / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polytope algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theory on toric varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4883843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Hilbert polynomial of a spherical variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Lefschetz theorem for valuations, complex integral geometry, and unitarily invariant valuations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convexity, the Weyl group and the Iwasawa decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential analytic sets / rank
 
Normal rank

Latest revision as of 15:07, 10 June 2024

scientific article
Language Label Description Also known as
English
Newton polytopes, increments, and roots of systems of matrix functions for finite-dimensional representations
scientific article

    Statements

    Newton polytopes, increments, and roots of systems of matrix functions for finite-dimensional representations (English)
    0 references
    5 August 2005
    0 references
    Consider finite-dimensional holomorphic representations of a Lie group and a system of matrix functions associated with this representation. The author computes the asymptotic root distribution for this system. It can be expressed via the increments of the representations involved. If the group is, in addition, reductive, then the number of equations in the system can be arbitrary between 1 and the dimension of the group, as is pointed out. In the reductive case, the results can be obtained by concepts of convex geometry. The computations show also a new approach to some already known formulas in this context, e.g., for the density of the solution variety of a system of exponential equations.
    0 references
    0 references
    asymptotic root distribution
    0 references
    convex geometry
    0 references
    Newton polytopes
    0 references
    0 references