相关论文: The Binary Mole
This paper introduces a binary encoding that supports arbitrarily large, small and precise decimals. It completely preserves information and order. It does not rely on any arbitrary use-case-based choice of calibration and is readily…
The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…
We compute the rate of change of mass and angular momentum of a black hole, namely tidal heating, in an eccentric orbit. The change is caused due to the tidal field of the orbiting companion. We compute the result for both the spinning and…
We present low and high resolution long-slit spectra of three bipolar planetary nebulae (PNe) with bright central cores: A79, He2-428 and M1-91. He2-428 and M1-91 have high density (from 10^3.3 to 10^6.5 cm^-3) unresolved nebular cores that…
A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…
In this note we study the number of quantum queries required to identify an unknown multilinear polynomial of degree d in n variables over a finite field F_q. Any bounded-error classical algorithm for this task requires Omega(n^d) queries…
The aim of this article is to count the $n$-tuples of positive integers $(a_{1},\ldots,a_{n})$ solutions of the equation $\begin{pmatrix} a_{n} & -1 \\[4pt] 1 & 0 \end{pmatrix} \begin{pmatrix} a_{n-1} & -1 \\[4pt] 1 & 0 \end{pmatrix} \cdots…
Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…
In this paper we completely classify the circulant weighing matrices of weight 16 and odd order. It turns out that the order must be an odd multiple of either 21 or 31. Up to equivalence, there are two distinct matrices in CW(31,16), one…
We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.
We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…
An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…
We provide the first-ever calculation of the number of inequivalent monotone Boolean functions of 9 variables, which is equal to 789,204,635,842,035,040,527,740,846,300,252,680.
This paper introduces the Adaptive Base Representation (ABR) Theorem and proposes a novel number system that offers a structured alternative to the binary number system for digital computers. The ABR number system enables each decimal…
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…
The realm of strong classical gravity and perhaps even quantum gravity are waiting to be explored. In this letter we consider the recently detected triple system composed of two stars and a non-accreting black hole. Using published…
A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…
We present the first comprehensive fitting formula for exchange reactions of arbitrary mass ratios. In a comparison with numerical results, this expression is shown to be accurate in the hard binary limit to within 25\% for most mass…
Suppose $\Omega, A \subseteq \RR\setminus\Set{0}$ are two sets, both of mixed sign, that $\Omega$ is Lebesgue measurable and $A$ is a discrete set. We study the problem of when $A \cdot \Omega$ is a (multiplicative) tiling of the real line,…
Dynamic unary encoding takes unary encoding to the next level. Every n-bit binary string is an encoding of dynamic unary and every n-bit binary string is encodable by dynamic unary. By utilizing both forms of unary code and a single bit of…