Related papers: On Arroyo-Figueroa's Proof that $\mathrm{P} \neq \…
We prove existence of the tau-function for the multi-component CKP hierarchy and find how it is related to the tau-function of the multi-component KP hierarchy.
Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…
We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…
This paper has been withdrawn by the author due to an error in the main proof (thanks to Carlos D'Andrea)
We provide the following result and its discrete equivalent: Let $f \colon I^n \to \mathbb{R}^{n-1}$ be a continuous function. Then, there exist a point $p \in \mathbb{R}^{n-1}$ and a compact subset $S \subset…
An artificially designed Turing Machine algorithm $\mathbf{M}_{}^{o}$ generates the instances of the satisfiability problem, and check their satisfiability. Under the assumption $\mathcal{P}=\mathcal{NP}$, we show that $\mathbf{M}_{}^{o}$…
Although whether P equals NP is an important, open problem in computer science, and although Jaeger's 2008 paper, "Solving the P/NP Problem Under Intrinsic Uncertainty" (arXiv:0811.0463) presents an attempt at tackling the problem by…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
In the present paper, a subclass of analytic and bi-univalent functions by means of (p; q)- Lucas polynomials is introduced. Certain coefficients bounds for functions belonging to this subclass are obtained. Furthermore, the Fekete-Szego…
We show that ESO universal Horn logic (existential second logic where the first order part is a universal Horn formula) is insufficient to capture P, the class of problems decidable in polynomial time. This statement is true in the presence…
We construct the p-adic zeta function for a one-dimensional (as a p-adic Lie extension) non-commutative p-extension of a totally real number field such that the finite part of its Galois group is a pgroup with exponent p. We first calculate…
We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results.…
We prove that for any FAb compact $p$-adic analytic group $G$, its representation zeta function is a finite sum of terms $n_{i}^{-s}f_{i}(p^{-s})$, where $n_{i}$ are natural numbers and $f_{i}(t)\in\mathbb{Q}(t)$ are rational functions.…
We present a formula for the connected \(n\)-point functions of a tau-funtion of the BKP hierarchy by embedding BKP hierarchy into KP hierarchy. This formula is different from the one given by Wang and Yang. We prove that these two formulae…
In this note, we consider meromorphic univalent functions $f(z)$ in the unit disc with a simple pole at $z=p\in(0,1)$ which have a $k$-quasiconformal extension to the extended complex plane $\hat{\mathbb C},$ where $0\leq k < 1$. We denote…
This note states and proves a representation theorem for regular quantity functions, based on the theory of quantity spaces, thereby giving a new perspective on dimensional analysis and the classical $\pi$ theorem.
Erd\H{o}s \cite{MR168482} proved that the Continuum Hypothesis (CH) is equivalent to the existence of an uncountable family $\mathcal{F}$ of (real or complex) analytic functions, such that $\big\{ f(x) \ : \ f \in \mathcal{F} \big\}$ is…
Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…
In this paper the Erdos-Rado theorem is generalized to the class of well founded trees. We define an equivalence relation on the class rs(infty)^{< aleph_0} (finite sequences of decreasing sequences of ordinals) with aleph_0 equivalence…