English
Related papers

Related papers: On Arroyo-Figueroa's Proof that $\mathrm{P} \neq \…

200 papers

I show that a hypergeometric function ${}_{p}F_q(a_1,\ldots,a_p;b_1,\ldots,b_q;\,\cdot\,)$ with $p \le q$ belongs to the Laguerre--P\'olya class $LP^+$ for arbitrarily large $b_{p+1},\ldots,b_q > 0$ if and only if, after a possible…

Classical Analysis and ODEs · Mathematics 2022-06-23 Alan D. Sokal

We show that one-way functions exist if and only if there exists an efficient distribution relative to which almost-optimal compression is hard on average. The result is obtained by combining a theorem of Ilango, Ren, and Santhanam and one…

Computational Complexity · Computer Science 2025-01-24 Marius Zimand

Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…

Computational Geometry · Computer Science 2021-06-03 Dibyayan Chakraborty , Kshitij Gajjar

In this article we obtain new irrationality measures for values of functions which belong to a certain class of hypergeometric functions including shifted logarithmic functions, binomial functions and shifted exponential functions. We…

Number Theory · Mathematics 2023-10-12 Makoto Kawashima , Anthony Poëls

In this work we provide effective bounds and classification results for rational $\QQ$-factorial Fano varieties with a complexity-one torus action and Picard number one depending on the invariants dimension and Picard index. This…

Algebraic Geometry · Mathematics 2012-11-26 Elaine Herppich

Standard probability theory has been extremely successful but there are some conceptually possible scenarios, such as fair infinite lotteries, that it does not model well. For this reason alternative probability theories have been…

Logic · Mathematics 2016-08-10 Hazel Brickhill , Leon Horsten

We prove an analogue of the Ikehara theorem for positive non-increasing functions convergent to zero, generalising the results postulated in Diekmann, Kaper (1978, Nonlinear Anal. 2(6), 721--737) and Carr, Chmaj (2004, Proc. AMS 132(8),…

Complex Variables · Mathematics 2018-04-30 Dmitri Finkelshtein , Pasha Tkachov

In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thus, positive Turing and Turing reducibility to NP differ sharply…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra

This paper presents how to make use of the advantage of round-off error effect in some research areas. The float-point operation complies with the reproduce theorem without the external random perturbation. The computation uncertainty…

Cryptography and Security · Computer Science 2007-11-26 P. F. Wang , J. P. Li

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some linear methods of this approximation for univariate functions in the class induced by the convolution…

Numerical Analysis · Mathematics 2021-11-05 Dinh Dũng , Vu Nhat Huy

We show that, if PA has no non-standard models, then P=/=NP. We then give an elementary proof that PA has no non-standard models.

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which is itself a subset of FP. Counting perfect matchings is…

Computational Complexity · Computer Science 2009-05-15 Frank Ferraro , Garrett Hall , Andrew Wood

In this paper, we take a closer look at Czerwinski's "${\rm P}\neq{\rm NP}$ relative to a ${\rm P}$-complete oracle" [Cze23]. There are (uncountably) infinitely-many relativized worlds where ${\rm P}$ and ${\rm NP}$ differ, and it is…

Computational Complexity · Computer Science 2023-12-08 Michael C. Chavrimootoo , Tran Duy Anh Le , Michael P. Reidy , Eliot J. Smith

This work proposes a unified theory of regularity in one hypercomplex variable: the theory of $T$-regular functions. In the special case of quaternion-valued functions of one quaternionic variable, this unified theory comprises…

Complex Variables · Mathematics 2026-04-10 Riccardo Ghiloni , Caterina Stoppato

In this paper we introduce a class of functions contained in the disc algebra $\mathcal{A}(D)$. We study functions $f \in \mathcal{A}(D)$, which have the property that the continuous periodic function $u = Ref|_{\mathbb{T}}$, where…

Classical Analysis and ODEs · Mathematics 2018-10-11 Alexandros Eskenazis

The purpose of the present paper is to show that in certain classes of real (or complex) functions, the Bernoulli polynomials are essentially the only ones satisfying the Raabe functional equation. For the class of the real $1$-periodic…

Classical Analysis and ODEs · Mathematics 2023-03-28 Bakir Farhi

The aim of this paper is twofold. Firstly we present our main discovery arising from experiments which is the tauberian concept of functions of good variation (FGV). Secondly we propose to use these FGV for proving RH is true via some…

Number Theory · Mathematics 2017-01-31 Benoit Cloitre

Let $\Omega^o$ and $\Omega^i$ be open bounded subsets of $\mathbb{R}^n$ of class $C^{1,\alpha}$ such that the closure of $\Omega^i$ is contained in $\Omega^o$. Let $f^o$ be a function in $C^{1,\alpha}(\partial\Omega^o)$ and let $F$ and $G$…

Analysis of PDEs · Mathematics 2015-01-23 M. Dalla Riva , G. Mishuris

This short note present a "proof" of $P\neq NP$. The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).

Computational Complexity · Computer Science 2021-10-15 Tianrong Lin

The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…

Computational Complexity · Computer Science 2025-02-04 Klaus Meer , Adrian Wurm
‹ Prev 1 4 5 6 7 8 10 Next ›