Related papers: The Binary Mole
This thesis describes a numerical study of binary boson stars within the context of an approximation to general relativity. The approximation we adopt places certain restrictions on the dynamical variables of general relativity (conformal…
The state of the searches for isolated black holes, non-accreting black holes in binary systems and, finally, the accreting black holes in the X-ray binaries is presented. The third category is, by far, the most important source of…
We show that there exist exactly 203 positive integers $N$ such that for some integer $d \geq 2$ this number is a $d$-digit palindrome base 10 as well as a $d$-digit palindrome for some base $b$ different from 10. To be more precise, such…
The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the…
The orbital eccentricity of a merging binary black hole leaves an imprint on the associated gravitational-wave signal that can reveal whether the binary formed in isolation or in a dynamical environment, such as the core of a dense star…
We give an explicit construction of length-$n$ binary codes capable of correcting the deletion of two bits that have size $2^n/n^{4+o(1)}$. This matches up to lower order terms the existential result, based on an inefficient greedy choice…
For a positive integer sequence $\boldsymbol{a}=(a_1, \dots, a_{N+1})$, Sylvester's denumerant $E(\boldsymbol{a}; t)$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N+1} a_i x_i = t$ for a nonnegative integer $t$. It has…
The discrepancy between abundances computed using optical recombination lines (ORLs) and collisionally excited lines (CELs) is a major unresolved problem in nebular astrophysics. We show here that the largest abundance discrepancies are…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
A binary partition of a positive integer $n$ is a partition of $n$ in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary partitions of $n$. This is an ordering of the set of binary…
We study black hole MACHO binary formation through three-body interactions in the early universe at $t\sim 10^{-5}$s. The probability distribution functions of the eccentricity and the semimajor axis of binaries as well as of the…
It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…
Let $M$ be a submanifold of ${\Bbb P}^N$ of dimension $n>2$. Suppose that $(M,{\Cal O}_M(1))\cong{\Bbb P}({\Cal E}),{\Cal O}(1))$ for some vector bundle ${\Cal E}$ on a surface $S$. Then $N\ge 2n-1$ by Barth-Lefschetz Theorem. We are…
The detection of orbital eccentricity for a binary black hole system via gravitational waves is a key signature to distinguish between the possible binary origins. The identification of eccentricity has been difficult so far due to the…
V405 And is a fast-rotating (P=0.465d) grazing eclipsing binary with two active components. Using multicolor photometric monitoring and radial velocity measurements, we find that the primary and the secondary components have masses of 0.49…
It is well known that the numbers $(2m)! (2n)!/m! n! (m+n)!$ are integers, but in general there is no known combinatorial interpretation for them. When $m=0$ these numbers are the middle binomial coefficients $\binom{2n}{n}$, and when $m=1$…
In this article we compute the number of invertible $2\times 2$ matrices with integer entries modulo $n$ whose permanents are congruent modulo $n$ to a given integer $x$.
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its unbiased black-box complexity was previously shown to be at…
A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…