Topological classification of trigonometric polynomials and combinatorics of graphs with an equal number of vertices and edges (Q679493): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q238366 / rank
Normal rank
 
Property / author
 
Property / author: Vladimir I. Arnold / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: L'équivalence d'une fonction différentiable et d'un polynôme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complement of the bifurcation variety of a simple singularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of bifurcation diagrams of simple projections onto the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cohomologies of discrete subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bernoulli-Euler updown numbers associated with function singularities, their combinatorics and arithmetics / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02509551 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021681283 / rank
 
Normal rank

Latest revision as of 09:46, 30 July 2024

scientific article
Language Label Description Also known as
English
Topological classification of trigonometric polynomials and combinatorics of graphs with an equal number of vertices and edges
scientific article

    Statements

    Topological classification of trigonometric polynomials and combinatorics of graphs with an equal number of vertices and edges (English)
    0 references
    25 October 1998
    0 references
    With each meromorphic function (which is assumed to be -- except at critical points -- an \(m\)-to-one holomorphic mapping of a compact connected Riemann surface onto the Riemann sphere, with a total of \(n\) finite critical values), an edge labelled graph on \(m\) vertices and \(n\) edges is associated. The graph itself reflects in a natural way the ramification of the meromorphic function; the edge labelling is a 1-1 mapping from the edge set to \(\{ 1,2,\dots,n\}\). The Coxeter permutation of such a labelled graph is the permutation of its vertex set defined as the product \(\sigma_1\dots\sigma_n\) where \(\sigma_i\) is the transposition which permutes the endvertices of the edge labelled \(i\). The author surveys some of the connections between meromorphic functions, their edge labelled graphs, and the corresponding Riemann surfaces. Laurent polynomials are then studied in detail. Typical results: The manifold of classes of topological equivalence of Laurent polynomials with poles of order \(p\) and \(q\) and with \(p+q\) distinct critical values is naturally covered by the manifolds of bipolynomials of bidegree \((p,q)\) with \(p+q\) distinct critical values and naturally covers the complement of the swallow tail in the space \(C^{p+q-1}\) with multiplicity \(M(p,q)=p^pq^q(p+q-1)!/p!q!\). The same manifold is an Eilenberg-MacLane space \(K(\pi,1)\) for the corresponding subgroup of index \(M(p,q)\) in the braid group on \(n\) strings. Results of the above type have implications in combinatorics and graph theory, because the topological classification of the above mappings is equivalent to the enumeration of the connected graphs on \(n\) vertices with \(n\) labelled edges (i.e., edge labelled unicyclic graphs of order \(n\)). For example, it follows that the number of edge labelled \((n,n)\) graphs whose Coxeter permutation consists of two cycles of lengths \(p\) and \(q\) is equal to \(M(p,q)\).
    0 references
    meromorphic function
    0 references
    Riemann surface
    0 references
    Laurent polynomial
    0 references
    edge labelled graph
    0 references
    Coxeter permutation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references