Expected Number of Distinct Subsequences in Randomly Generated Binary Strings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 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
AIMS Mathematics, 2022 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
Scientific Reports, 2022 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
"Exotic" binary number systems for rings of Gauss and Eisenstein integers [PDF]
Компьютерная оптика, 2018 The paper considers nonstandard binary number systems for rings of Gauss and Eisenstein integers. The principal difference ("exoticism") of such number systems from the canonical number systems introduced by I.
Vladimir Chernov
doaj +1 more source
Bayesian inference for compact binary coalescences with bilby: validation and application to the first LIGO–Virgo gravitational-wave transient catalogue [PDF]
Monthly notices of the Royal Astronomical Society, 2020 Gravitational waves provide a unique tool for observational astronomy. While the first LIGO–Virgo catalogue of gravitational-wave transients (GWTC-1) contains 11 signals from black hole and neutron star binaries, the number of observations is ...
I. Romero-Shaw +62 more
semanticscholar +1 more source
High-Speed Binary-to-Residue Converter Design Using 2-Bit Segmentation of the Input Word
Scientific Journal of Gdynia Maritime University, 2022 In this paper a new approach to the design of the high-speed binary-to-residue converter is proposed that allows the attaining of high pipelining rates by eliminating memories used in modulo m generators. The converter algorithm uses segmentation of the
Robert Smyk, Maciej Czyżak
doaj +1 more source
Function argument number identification in stripped binary under PPC and MIPS instruction set
网络与信息安全学报, 2020 The identification of the number of function argument contributes to the recovery of the function prototype and is the basis for data flow analysis and other security analysis.In order to improve the accuracy of the recognition of the number of function ...
Xiaokang YIN +3 more
doaj +3 more sources
Binary Companions of Evolved Stars in APOGEE DR14: Search Method and Catalog of ∼5000 Companions [PDF]
Astronomical Journal, 2018 Multi-epoch radial velocity measurements of stars can be used to identify stellar, substellar, and planetary-mass companions. Even a small number of observation epochs can be informative about companions, though there can be multiple qualitatively ...
A. Price-Whelan +12 more
semanticscholar +1 more source
Stability of Characteristics of Physical Random Number Generators
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, 2023 The development of technologies leads to the need of revising the methods used to obtain cryptographic keys. The randomness parameters of sequences generated by physical random sequence generators are affected by the physical parameters of the recording ...
M. O. Pikuza +2 more
doaj +1 more source
On the binary expansions of algebraic numbers [PDF]
Journal de Théorie des Nombres de Bordeaux, 2004 Using concepts from additive number theory and results on binary evaluations and partial series, the authors prove that for a real algebraic number \(y\) of degree \(D> 1\) the number \(\#(|y|, N)\) of 1-bits in the expansion of \(|y|\) through bit position \(N\) is greater than \(CN^{1/D}\), where \(C> 0\) is a number depending only on \(y\), and \(N\)
Bailey, David H. +3 more
openaire +4 more sources