Related papers: Periods and elementary real numbers
Recently, degenerate Cauchy numbers and polynomials are introduced in [10]. In this paper, we study the degenerate Cauchy numbers and polynomials which are different from the previous degenerate Cauchy numbers and polynomials. In addition,…
Aperiodic tilings are non-periodic tilings defined by local rules. They are widely used to model quasicrystals, and a central question is to understand which of the non-periodic tilings are actually aperiodic. Among tilings, those by rhombi…
We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We…
Elementary particles, i.e. the basic constituents of nature, are characterized by quantum recurrences in time. The flow of time of every physical system can be therefore decomposed in elementary cycles of time. This allows us to enforce the…
We deal with entropy solutions to the Cauchy problem for the isentropic compressible Euler equations in the space-periodic case. In more than one space dimension, the methods developed by De Lellis-Sz\'ekelyhidi enable us to show failure of…
We consider algebras with basis numerated by elements of a group $G.$ We fix a function $f$ from $G\times G$ to a ground field and give a multiplication of the algebra which depends on $f$. We study the basic properties of such algebras. In…
Frauchiger and Renner recently cast doubt on the universal applicability of Quantum Mechanics [1]. In the following, it is pointed out that their conclusion of one of three common-sense conditions, demanded for Quantum Mechanics, being…
We introduce a new formalisation of languages, called keyboards. We consider a set of elementary operations (writing/erasing a letter, going to the right or to the left,...) and we define a keyboard as a set of finite sequences of such…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
Polynomial series approximations are a central theme in approximation theory due to their utility in an abundance of numerical applications. The two types of series, which are featured most prominently, are Taylor series expansions and…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
Students of quantum mechanics encounter discrete quantum numbers in a somewhat incoherent and bewildering number of ways. For each physical system studied, quantum numbers seem to be introduced in its own specific way, some enumerating from…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
We discuss various results and questions around the Grothendieck period conjecture, which is a counterpart, concerning the de Rham-Betti realization of algebraic varieties over number fields, of the classical conjectures of Hodge and Tate.…
We extend the Cauchy residue theorem to a large class of domains including differential chains that represent, via canonical embedding into a space of currents, divergence free vector fields and non-Lipschitz curves. That is, while the…
The work is devoted to the development of numerical methods for computing "formal solutions" of interval systems of linear algebraic equations. These solutions are found in Kaucher interval arithmetic, which extends and completes the…
The origin and nature of time in complex systems is explored using quantum (or 'Feynman') clocks and the signals produced by them. Networks of these clocks provide the basis for the evolution of complex systems. The general concept of…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…