Related papers: Signed-Bit Representations of Real Numbers
When digital data are transmitted over a noisy channel, it is important to have a mechanism allowing recovery against a limited number of errors. Normally, a user string of 0's and 1's, called bits, is encoded by adding a number of…
We define radix representations for vectors in Z^n analogously with radix representations in Z, and give a sufficient condition for a matrix A:Z^n -> Z^n to yield a radix representation with a given canonical digit set. We relate our…
The theory of quantum mechanics is examined using non-standard real numbers, called quantum real numbers (qr-numbers), that are constructed from standard Hilbert space entities. Our goal is to resolve some of the paradoxical features of the…
We develop a numerical approach to cohomology. Essentially, vector spaces and linear maps are replaced by real numbers, which represent dimensions of vector spaces and ranks of linear maps. We use this to refine ideas of Van der Geer and…
It is shown how to endow a hierarchy of sets of binary patterns with the structure of an abstract,normed C*-algebra. In the course we also recover an intermediate connection with the words of a Dyck language and Tempereley-Lieb algebras for…
Exact real computation is an alternative to floating-point arithmetic where operations on real numbers are performed exactly, without the introduction of rounding errors. When proving the correctness of an implementation, one can focus…
A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the prime numbers decomposition of M. Representations that exhibit the factorization of M into two relatively prime numbers: the kq…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…
The elements of a deterministic quantum theory are developed, which reformulates and extends standard quantum theory. The proposed theory is `realistic' in the sense that in it, a general M-level quantum state is represented by a single…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
Semilinear maps are a generalization of linear maps between vector spaces where we allow the scalar action to be twisted by a ring homomorphism such as complex conjugation. In particular, this generalization unifies the concepts of linear…
We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
A bitset is a set that encodes for a binary number. Bitsets are at the basis of a beautiful theory of recombination with n-loci and here we begin from scratch and advance to include the derivation of the fundamental results about the…
This article describes a technique of using a trigonometric function and combinatorial calculations to code or transform any finite sequence of binary numbers (0s and 1s) of any length to a unique set of three Real numbers. In reverse,…
We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…
This note is concerned with the zeros of holomorphic Hecke cusp forms of large weight on the modular surface. The zeros of such forms are symmetric about three geodesic segments and we call those zeros that lie on these segments, real. Our…