Results 1 to 10 of about 2,228,479 (146)
The number of binary rotation words [PDF]
RAIRO - Theoretical Informatics and Applications, 2014 We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be O(n^4). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov in ...
Frid, Anna E., Jamet, Damien
openaire +8 more sources
The Asymptotic Number of Binary Codes and Binary Matroids [PDF]
SIAM Journal on Discrete Mathematics, 2005 12 ...
openaire +4 more sources
On the number of lambda terms with prescribed size of their De Bruijn representation [PDF]
, 2015 John Tromp introduced the so-called 'binary lambda calculus' as a way to encode lambda terms in terms of binary words. Later, Grygiel and Lescanne conjectured that the number of binary lambda terms with $m$ free indices and of size $n$ (encoded as binary
Gittenberger, Bernhard +1 more
core +2 more sources
Generalised divisor sums of binary forms over number fields [PDF]
, 2016 Estimating averages of Dirichlet convolutions $1 \ast \chi$, for some real Dirichlet character $\chi$ of fixed modulus, over the sparse set of values of binary forms defined over $\mathbb{Z}$ has been the focus of extensive investigations in recent years,
Frei, Christopher, Sofos, Efthymios
core +2 more sources
The asymptotic induced matching number of hypergraphs: balanced binary strings [PDF]
, 2019 We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$.
Arunachalam, Srinivasan +2 more
core +2 more sources
Binary Representation of Natural Numbers [PDF]
Formalized Mathematics, 2018 Summary Binary representation of integers [5], [3] and arithmetic operations on them have already been introduced in Mizar Mathematical Library [8, 7, 6, 4]. However, these articles formalize the notion of integers as mapped into a certain length tuple of boolean values.
openaire +2 more sources
The critical number of dense triangle-free binary matroids
, 2016 We show that, for each real number $\epsilon > 0$ there is an integer $c$ such that, if $M$ is a simple triangle-free binary matroid with $|M| \ge (\tfrac{1}{4} + \epsilon) 2^{r(M)}$, then $M$ has critical number at most $c$.
Geelen, Jim, Nelson, Peter
core +1 more source
Sloping Binary Numbers: A New Sequence Related to the Binary Numbers
, 2005 If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th term and the n-th missing term, and discuss a number of related sequences.
Applegate, David +3 more
openaire +3 more sources
Binary Number Sorter-Patent [PDF]
, 1970 Binary number sorter for arranging numbers in order of ...
Anderson, T. O.
core +1 more source
Dynamics and Interactions of Binaries and Neutron Stars in Globular Clusters [PDF]
, 1994 We model the dynamics of test binaries in isotropic, multi-mass models of galactic globular clusters. The evolution of binary orbits through the cluster potentials is modeled, including second order diffusion terms, and probabilities for close encounters
Phinney, E. S., Sigurdsson, Steinn
core +3 more sources