Related papers: Low functions of reals
As a first application of a very old theorem, known as Herschel's theorem, we provide direct elementary proofs of several explicit expressions for some numbers and polynomials that are known in combinatorics. The second application deals…
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
We show that the class of $\mathcal{L}$-constructible functions is closed under integration for any $P$-minimal expansion of a $p$-adic field $(K,\mathcal{L})$. This generalizes results previously known for semi-algebraic and sub-analytic…
In this paper, we introduce a method of converting implicit equations to the usual forms of functions locally without differentiability. For a system of implicit equations which are equipped with continuous functions, if there are unique…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a low-degree polynomial. Each rule depends on the function's values at a small number of places. If a function satisfies many…
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
In this paper we develop the functional calculus for elliptic operators on compact Lie groups without the assumption that the operator is a classical pseudo-differential operator. Consequently, we provide a symbolic descriptions of complex…
Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…
Properties of the mappings \begin{align*} C&\mapsto\frac1{(2\pi i)^2}\int_{\Gamma_1}\int_{\Gamma_2}f(\lambda,\mu)\,R_{1,\,\lambda}\,C\, R_{2,\,\mu}\,d\mu\,d\lambda, C&\mapsto\frac1{2\pi i}\int_{\Gamma}g(\lambda)R_{1,\,\lambda}\,C\,…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
In this paper, we analyze various classes of multi-dimensional $\rho$-almost periodic type functions $F : I \times X \rightarrow Y$ and multi-dimensional $(\omega,\rho)$-almost periodic type functions $F : I \times X \rightarrow Y,$ where…
We obtain sufficient conditions for an exponential type entire function not to have zeros in the open lower half-plane. An exact inequality containing the real and imaginary parts of such functions and their derivatives restricted to the…
Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and highly…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
We introduce an algorithm that computes explicit class fields of an imaginary quadratic field $K$ for a given modulus $\mathfrak{f}\subset\mathcal{O}_K$ more efficiently than the use of their classical counterparts. Therein, we prove the…