Community Research and Development Information Service - CORDIS


AFMIDMOA Report Summary

Project ID: 339109
Funded under: FP7-IDEAS-ERC
Country: Netherlands

Mid-Term Report Summary - AFMIDMOA (Applying Fundamental Mathematics in Discrete Mathematics, Optimization, and Algorithmics)

The project has solved problems of De la Harpe and Jaeger concerning counting graph homomorphisms, of Szegedy concerning edge-colouring models, of Lovász concerning graph limits, of Chmutkov et al. concerning the weight system from the exceptional Lie algebra G_2, and of Erdös and Pach in Ramsey theory.
Moreover, the application of algebraic geometry and representation theory to partition functions was extended so as to include the symplectic group, R-matrices, virtual link invariants, and weight systems for the Vassiliev knot invariants.
With an extended semidefinite programming method based on Young tableaux several bounds on error-correcting codes were improved.
With an improved technique with combinatorial groups a polynomial-time algorithm was designed for finding partially disjoint paths in a directed planar graph.

Reported by

Follow us on: RSS Facebook Twitter YouTube Managed by the EU Publications Office Top