Related papers: The Critical Exponent is Computable for Automatic …

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

Emergence is a pregnant property in various fields. It is the fact for a phenomenon to appear surprisingly and to be such that it seems at first sight that it is not possible to predict its apparition. That is the reason why it has often…

New expansions for some functions related to the Zeta function in terms of the Pochhammer's polynomials are given (coefficients b(k), d(k), d_(k) and d__(k). In some formal limit our expansion b(k) obtained via the alternating series gives…

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

We prove the finiteness of the Zsigmondy set associated to the critical orbit of f(z) = z^d+c for rational values of c by finding an effective bound on the size of the set. For non-recurrent critical orbits, the Zsigmondy set is explicitly…

Some mathematical theories in physics justify their explanatory superiority over earlier formalisms by the clarity of their postulates. In particular, axiomatic reconstructions drive home the importance of the composition rule and the…

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

We use the optimized perturbation theory, or linear delta expansion, to evaluate the critical exponents in the critical 3d O(N) invariant scalar field model. Regarding the implementation procedure, this is the first successful attempt to…

In an algebraic family of rational maps of $\mathbb{P}^1$, we show that, for almost every parameter for the trace of the bifurcation current of a marked critical value, the critical value is Collet-Eckmann. This extends previous results of…

In this paper we investigate the critical exponents of two families of Pucci's extremal operators. The notion of critical exponent that we have chosen for these fully nonlinear operators whihc are not variational is that of threshold…

The stochastic cellular automaton of Rule 18 defined by Wolfram [Rev. Mod. Phys. 55 601 (1983)] has been investigated by the enhanced coherent anomaly method. Reliable estimate was found for the $\beta$ critical exponent, based on moderate…

The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…

Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an alphabet with $k$ letters, where $\alpha$ is a positive rational number and $k$ is positive integer. We prove that if $\alpha\geq 5$, $k\geq…

In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…

We demonstrate that techniques of Weihrauch complexity can be used to get easy and elegant proofs of known and new results on initial value problems. Our main result is that solving continuous initial value problems is Weihrauch equivalent…

Consider an irreducible finite Coxeter system. We show that for any nonnegative integer n the sum of the nth powers of the Coxeter exponents can be written uniformly as a polynomial in four parameters: h (the Coxeter number), r (the rank),…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

We quantify the set of known exponent pairs $(k, \ell)$ and develop a framework to compute the optimal exponent pair for an arbitrary objective function. Applying this methodology, we make progress on several open problems, including bounds…