Does Advice Help to Prove Propositional Tautologies?

One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as their range. Motivated by provability consequences in bounded arithmetic, Cook and Krajíček [5] have recently started the investigation of proof systems which are computed by poly-time functions using advice. While this yields a more powerful model, it is also less directly applicable in practice. In this note we investigate the question whether the usage of advice in propositional proof systems can be simplified or even eliminated. While in principle, the advice can be very complex, we show that proof systems with logarithmic advice are also computable in poly-time with access to a sparse NP-oracle. In addition, we show that if advice is ”not very helpful” for proving tautologies, then there exists an optimal propositional proof system without advice. In our main result, we prove that advice can be transferred from the proof to the formula, leading to an easier computational model. We obtain this result by employing a recent technique by Buhrman and Hitchcock [4]

Asymptotics of Sobolev orthogonal polynomials for symmetrically coherent pairs of measures with compact support

AbstractWe study the strong asymptotics for the sequence of monic polynomials Qn(x), orthogonal with respect to the inner product (f,g)s=∫ f(x)g(x)dμ1(x)+σ ∫ f′(x)g′(x)dμ2(x), σ > 0, with x outside of the support of the measure μ2. We assume that μ1 and μ2 are symmetric and compactly supported measures on R satisfying a coherence condition. As a consequence, the asymptotic behaviour of (Qn,Qn)s and of the zeros of Qn is obtained

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

Cook and Krajíček [9] have obtained the following Karp-Lipton result in bounded arithmetic: if the theory proves , then collapses to , and this collapse is provable in . Here we show the converse implication, thus answering an open question from [9]. We obtain this result by formalizing in a hard/easy argument of Buhrman, Chang, and Fortnow [3]. In addition, we continue the investigation of propositional proof systems using advice, initiated by Cook and Krajíček [9]. In particular, we obtain several optimal and even p-optimal proof systems using advice. We further show that these p-optimal systems are equivalent to natural extensions of Frege systems

Ladders operators for general discrete Sobolev orthogonal polynomials

We consider a general discrete Sobolev inner product involving the Hahn difference operator, so this includes the well--known difference operators $\mathscr{D}_{q}$ and $\Delta$ and, as a limit case, the derivative operator. The objective is twofold. On the one hand, we construct the ladder operators for the corresponding nonstandard orthogonal polynomials and we obtain the second--order difference equation satisfied by these polynomials. On the other hand, we generalise some related results appeared in the literature as we are working in a more general framework. Moreover, we will show that all the functions involved in these constructions can be computed explicitly

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.

In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP∩coNP, UP, BPP, disjoint NP-pairs etc.), these ques-tions have been intensively studied during the last years, and a number of characterizations have been obtained. Here we provide new character-izations for Q1 and Q2 that apply to almost all promise classes C and languages L, thus creating a unifying framework for the study of these practically relevant questions. While questions Q1 and Q2 are left open by our results, we show that they receive affirmative answers when a small amount on advice is avail-able in the underlying machine model. This continues a recent line of research on proof systems with advice started by Cook and Kraj́ıček [6]

Some asymptotics for Sobolev orthogonal polynomials involving Gegenbauer weights

AbstractWe consider the Sobolev inner product 〈f,g〉=∫−11f(x)g(x)(1−x2)α−12dx+∫f′(x)g′(x)dψ(x),α>−12, where dψ is a measure involving a Gegenbauer weight and with mass points outside the interval (−1,1). We study the asymptotic behaviour of the polynomials which are orthogonal with respect to this inner product. We obtain the asymptotics of the largest zeros of these polynomials via a Mehler–Heine type formula. These results are illustrated with some numerical experiments

Identification and characterization of bacteria with antibacterial activities isolated from seahorses (Hippocampus guttulatus)

1 tabla, 1 figuraThis study was financed by the Spanish Ministry of Science and Technology (Hippocampus CGL2005-05927-C03-01). J.L.B. was supported by a postdoctoral I3P contract from the Spanish Council for Scientific Research (CSIC). Y.J.S. was granted by the Erasmus program (29154-IC-1-2007-1-PT-ERASMUS-EUC-1).Peer reviewe

Asymptotics for Jacobi–Sobolev orthogonal polynomials associated with non-coherent pairs of measures

AbstractWe consider the Sobolev inner product 〈f,g〉=∫−11f(x)g(x)dψ(α,β)(x)+∫f′(x)g′(x)dψ(x), where dψ(α,β)(x)=(1−x)α(1+x)βdx with α,β>−1, and ψ is a measure involving a rational modification of a Jacobi weight and with a mass point outside the interval (−1,1). We study the asymptotic behaviour of the polynomials which are orthogonal with respect to this inner product on different regions of the complex plane. In fact, we obtain the outer and inner strong asymptotics for these polynomials as well as the Mehler–Heine asymptotics which allow us to obtain the asymptotics of the largest zeros of these polynomials. We also show that in a certain sense the above inner product is also equilibrated