In this paper, we solve the additive ρ-functional inequalities ‖f(x+ y)− f(x)− f(y)‖ ≤ ∥∥∥∥ρ(2f (x+ y 2 ) − f(x)− f(y) )∥∥∥∥ , (1) ∥∥∥∥2f (x+ y 2 ) − f(x)− f(y) ∥∥∥∥ ≤ ‖ρ (f(x+ y)− f(x)− f(y))‖ , (2) where ρ is a fixed non-Archimedean number with |ρ| < 1 or ρ is a fixed complex number with |ρ| < 1. Using the direct method, we prove the Hyers-Ulam stability of the additive ρ-functional inequalit...

Earlier work (Hammond, 1988a, b) on dynamically consistent “consequentialist” behaviour in decision trees was unable to treat zero probability events satisfactorily. Here the rational probability functions considered in Hammond (1994), as well as other non-Archimedean probabilities, are incorporated into decision trees. As before, the consequentialist axioms imply the existence of a preference ...

An interesting question posed by Paul Erdös around 1950 pertains to the maximal number of points in n-dimensional Euclidean Space so that no subset of three points can be picked that form an obtuse angle. An unexpected and surprising solution was presented around a decade later. Interestingly enough the solution relies in its core on properties of measures in n-dimensional space. Beyond its int...

We prove that, for any fixed base x ≥ 2 and sufficiently large prime q, no perfect q-th powers can be written with 3 or 4 digits 1 in base x. This is a particular instance of rather more general results, whose proofs follow from a combination of refined lower bounds for linear forms in Archimedean and non-Archimedean logarithms.

In the paper, we study behaviour of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behaviour of the system w.r.t. variety of word transformations performed by the system: We call a system completely transitive if, given arbitrary pair a, b of finite words that have equal lengths, the system A, while evolution during (discrete...