Related papers: Sign sequences of log-atomic numbers
Conway's surreal numbers were aptly named by Knuth. This note examines how far one can get towards implementing surreals and the arithmetic operations on them so that they execute efficiently. Lazy evaluation and recursive data structures…
Why do natural and interesting sequences often turn out to be log-concave? We give one of many possible explanations, from the viewpoint of "standard conjectures". We illustrate with several examples from combinatorics.
Several authors have conjectured that Conway's field of surreal numbers, equipped with the exponential function of Kruskal and Gonshor, can be described as a field of transseries and admits a compatible differential structure of Hardy-type.…
This paper presents the log-concavity of the $m$-gonal figurate number sequences. The author gives and proves the recurrence formula for $m$-gonal figurate number sequences and its corresponding quotient sequences which are found to be…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
Germs of real-valued functions, surreal numbers, and transseries are three ways to enrich the real continuum by infinitesimal and infinite quantities. Each of these comes with naturally interacting notions of ordering and derivative. The…
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
For any ordinal $\alpha > 0$, we show how to define a hyperexponential $E_{\omega^{\alpha}}$ and a hyperlogarithm $L_{\omega^{\alpha}}$ on the class $\mathbf{No}^{>, \succ}$ of positive infinitely large surreal numbers. Such functions are…
Conway's field No of surreal numbers comes both with a natural total order and an additional "simplicity relation" which is also a partial order. Considering No as a doubly ordered structure for these two orderings, an isomorphic copy of No…
We study subfields of surreal numbers, called hyperseries fields, that are suited to be equipped with derivations and composition laws. We show how to define embeddings on hyperseries fields that commute with transfinite sums and all…
A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in…
Log-periodic amplitudes appear in the critical behavior of a large class of systems, in particular when a discrete scale invariance is present. Here we show how to compute these critical amplitudes perturbatively when they originate from a…
It seems reasonable that a toroid can be thought of approximately as a solenoid bent into a circle. The correspondence of the inductances of these two objects gives an approximation for the natural logarithm in terms of the average of two…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
We consider arithmetic sequences, here defined as ordered lists of positive integers. Any such a sequence can be cast onto a quantum state, enabling the quantification of its `surprise' through von Neumann entropy. We identify typical…
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…
We show that log canonical thresholds of fixed dimension are standardized. More precisely, we show that any sequence of log canonical thresholds in fixed dimension $d$ accumulates in a way which is i) either similar to how standard and…
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set…
In this paper, we study power series with coefficients equal to a product of a generic sequence and an explicitly given function of a positive parameter expressible in terms of the Pochhammer symbols. Four types of such series are treated.…