On the existence of complete disjoint NP-pairs

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

A survey on signature-based Gr\"obner basis computations

This paper is a survey on the area of signature-based Gr\"obner basis algorithms that was initiated by Faug\`ere's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures. We show how to classify the various known variants by 3 different orderings. For this we give translations between different notations and show that besides notations many approaches are just the same. Moreover, we give a general description of how the idea of signatures is quite natural when performing the reduction process using linear algebra. This survey shall help to outline this field of active research.Comment: 53 pages, 8 figures, 11 table

A Characterization of Reduced Forms of Linear Differential Systems

A differential system $[A] : \; Y'=AY$, with $A\in \mathrm{Mat}(n, \bar{k})$ is said to be in reduced form if $A\in \mathfrak{g}(\bar{k})$ where $\mathfrak{g}$ is the Lie algebra of the differential Galois group $G$ of $[A]$. In this article, we give a constructive criterion for a system to be in reduced form. When $G$ is reductive and unimodular, the system $[A]$ is in reduced form if and only if all of its invariants (rational solutions of appropriate symmetric powers) have constant coefficients (instead of rational functions). When $G$ is non-reductive, we give a similar characterization via the semi-invariants of $G$. In the reductive case, we propose a decision procedure for putting the system into reduced form which, in turn, gives a constructive proof of the classical Kolchin-Kovacic reduction theorem.Comment: To appear in : Journal of Pure and Applied Algebr

Solution of polynomial Lyapunov and Sylvester equations

A two-variable polynomial approach to solve the one-variable polynomial Lyapunov and Sylvester equations is proposed. Lifting the problem from the one-variable to the two-variable context gives rise to associated lifted equations which live on finite-dimensional vector spaces. This allows for the design of an iterative solution method which is inspired by the method of Faddeev for the computation of matrix resolvents. The resulting algorithms are especially suitable for applications requiring symbolic or exact computation

The classification problem for automorphisms of C*-algebras

We present an overview of the recent developments in the study of the classification problem for automorphisms of C*-algebras from the perspective of Borel complexity theory.Comment: 21 page

Disjoint NP-pairs from propositional proof systems

For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P). Moreover we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist

Predicativity and parametric polymorphism of Brouwerian implication

A common objection to the definition of intuitionistic implication in the Proof Interpretation is that it is impredicative. I discuss the history of that objection, argue that in Brouwer's writings predicativity of implication is ensured through parametric polymorphism of functions on species, and compare this construal with the alternative approaches to predicative implication of Goodman, Dummett, Prawitz, and Martin-L\"of.Comment: Added further references (Pistone, Poincar\'e, Tabatabai, Van Atten