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

Let $\Theta$ denote the supremum of the real parts of the zeros of the Riemann zeta function. We demonstrate that $\Theta=1$, which entails the existence of infinitely many Riemann zeros off the critical line (thus disproving the Riemann…

For a finite dimensional algebra $A$ with $0 < \phi dim (A) = m < \infty$ we prove that there always exist modules $M$ and $N$ such that $\phi(M) = m-1$ and $\phi (N) = 1$. On the other hand, we see an example of an algebra that not every…

We prove some finiteness theorems for the Picard functor of an algebraic stack, in the spirit of SGA 6, exp. XII and XIII. In particular, we give a stacky version of Raynaud's relative representability theorem, we give sufficient conditions…

Let $A(K)$ be the algebra of continuous functions on a compact set $K\subset\mathbb C$ which are analytic on the interior of $K$, and $R(K)$ the closure (with the uniform convergence on $K$) of the functions that are analytic on a…

We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show…

Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…

In this paper we shall use realization theory to prove new results about a class of holomorphic functions on an annulus \[R_\delta \stackrel{\rm def}{=} \{z \in \mathbb{C}: \delta <|z|<1\},\] where $0<\delta<1$. The class of functions in…

We construct a new class of operators that act on symmetric functions with two deformation parameters $q$ and $t$. Our combinatorial construction associates each operator with a specific lattice path, whose steps alternate between moving up…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

We give a self-contained and short proof for the existence, uniqueness and measurability of so called $p$-harmonious functions. The proofs only use elementary analytic tools. As a consequence, we obtain existence, uniqueness and…

In this article using elementary school level Geometry we observe an alternative proof of Pythagorean Theorem from Heron's Formula.

We explore a class of meromorphic functions on elliptic curves, termed \emph{elliptic orthogonal a-polynomials} ($a$-EOPs), which extend the classical notion of orthogonal polynomials to compact Riemann surfaces of genus one. Building on…

Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…

We prove a Green--Tao theorem for multiplicative functions.

In this article we consider a method of proving a class of inequalities of the form (1). The method is based on the precise approximations of the sine and cosine functions by Maclaurin polynomials of given order. By using this method we…

In this paper we proved a theorems of existence and uniqueness of solutions of differential equation of second order with fractional derivative in the Kipriyanov sense in lower terms. As a domain of definition of the functions we consider…

Theorems crucial in elementary real function theory have proofs in which compactness arguments are used. Despite the introduction in relatively recent literature of each new highly elegant compactness argument, or of an equivalent, this…

We study the class of functions on Lipschitz-graph domains satisfying a differential-oscillation condition and show that such functions are $\epsilon$-approximable. As a consequence we obtain the quantitative Fatou theorem in the spirit of…

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…

We consider several weak type estimates for singular operators using the Bellman function approach. We disprove the $A_1$ conjecture, thus strengthening the counterexamples built by Reguera--Thiele. We show a certain logarithmic blow-up for…