18,690 research outputs found

    The Cayley-Menger determinant is irreducible for n≥3n\geq 3

    Full text link
    We prove that the Cayley-Menger determinant of an nn-dimensional simplex is an absolutely irreducible polynomial for n≥3.n\geq3. We also study the irreducibility of polynomials associated to related geometric constructions.Comment: 7 pages, 4 figure

    The Labour Market Effects of Immigration

    Get PDF
    This briefing discusses the impacts of immigration on the labour market in the UK, focusing on wages and employment
    • …
    corecore