Results 1 to 10 of about 1,005,052 (311)
The Asymptotic Number of Binary Codes and Binary Matroids [PDF]
12 ...
Marcel Wild
+9 more sources
Towards Formulation of a Complex Binary Number System
For years complex numbers have been treated as distant relatives of real numbers despite their widespread applications in the fields of electrical and computer engineering.
Tariq Jamil, David Blest, Amer Al-Habsi
doaj +3 more sources
Fast Solutions for Large Reynold’s Number in a Closed-Loop Thermosyphon with Binary Fluid [PDF]
In this work, we analyze the asymptotic behavior of the solutions for a thermosyphon model where a binary fluid is considered, a fluid containing a soluble substance, and the Reynold’s number is large.
Ángela Jiménez-Casas+1 more
doaj +2 more sources
Binary trees with the largest number of subtrees
AbstractThis paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(1–3) (2002) 127–137] and Jelen and Triesch [Superdominance order and distance of trees with bounded ...
Hua Wang, László A. Székely
openaire +3 more sources
High-Order Multipole and Binary Love Number Universal Relations
Using a data set of approximately 2 million phenomenological equations of state consistent with observational constraints, we construct new equation-of-state-insensitive universal relations that exist between the multipolar tidal deformability parameters
Daniel A. Godzieba, David Radice
doaj +1 more source
Calculation of Fourier-Galois transforms in reduced binary number systems [PDF]
The paper proposes a new method for calculating Fourier-Galois transforms (number-theoretical transforms), which are a modular analog of the discrete Fourier transform.
Vladimir Chernov
doaj +1 more source
Expected Number of Distinct Subsequences in Randomly Generated Binary Strings [PDF]
When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a straightforward way to compute the number of distinct subsequences in a fixed
Yonah Biers-Ariel+2 more
doaj +1 more source
Supercongruences involving Apéry-like numbers and binomial coefficients
Let $ \{S_n\} $ be the Apéry-like sequence given by $ S_n = \sum_{k = 0}^n\binom nk\binom{2k}k\binom{2n-2k}{n-k} $. We show that for any odd prime $ p $, $ \sum_{n = 1}^{p-1}\frac {nS_n}{8^n}{\equiv} (1-(-1)^{\frac{p-1}2})p^2\ (\text{ mod}\ {p^3}) $. Let
Zhi-Hong Sun
doaj +1 more source
Weber number and the outcome of binary collisions between quantum droplets
A theoretical analysis of binary collisions of quantum droplets under feasible experimental conditions is reported. Droplets formed from degenerate dilute Bose gases made up from binary mixtures of ultracold atoms are considered. Reliable expressions for
J. E. Alba-Arroyo+2 more
doaj +1 more source
Finding binary words with a given number of subsequences [PDF]
We relate binary words with a given number of subsequences to continued fractions of rational numbers with a given denominator. We deduce that there are binary strings of length $O(\log n \log \log n)$ with exactly $n$ subsequences; this can be improved to $O(\log n)$ under assumption of Zaremba's conjecture.
arxiv +1 more source