18,073 research outputs found

    On the existence of complete disjoint NP-pairs

    Get PDF
    Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. The question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with access to a very weak oracle (a tally NP-oracle). In addition, we exhibit candidates for complete NP-pairs and apply our results to a recent line of research on the construction of hard tautologies from pseudorandom generators

    On certain finiteness questions in the arithmetic of modular forms

    Get PDF
    We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard concerning p-adic coefficient fields of Hecke eigenforms. Specifically, we conjecture that for fixed N, m, and prime p with p not dividing N, there is only a finite number of reductions modulo p^m of normalized eigenforms on \Gamma_1(N). We consider various variants of our basic finiteness conjecture, prove a weak version of it, and give some numerical evidence.Comment: 25 pages; v2: one of the conjectures from v1 now proved; v3: restructered parts of the article; v4: minor corrections and change

    Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination

    Full text link
    This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting mathematical structure. In particular we try to indicate some dynamical and combinatorial aspects of cut elimination, as well as its connections to complexity theory. We discuss two concrete examples where one can see the structure of short proofs with cuts, one concerning feasible numbers and the other concerning "bounded mean oscillation" from real analysis
    corecore