Results 31 to 40 of about 2,374,282 (104)
Tukey morphisms between finite relations [PDF]
arXiv, 2023 We investigate Tukey morphisms between binary relations, establishing several fundamental lemmas. We then specialize to finite binary relations, using computational methods to classify all binary relations with at most $6$ points in the domain and codomain up to bimorphism.
arxiv
Polynomial Form of Binary Cyclotomic Polynomials [PDF]
arXiv, 2018 This paper presents a closed form polynomial expression for the binary cyclotomic polynomial. We contrast this against expressions for binary cyclotomic polynomials in (Lam and Leung 1996) and (Lenstra 1979).
arxiv
Homomorphisms of binary Cayley graphs
, 2015 A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic number 3.
Beaudou, Laurent +2 more
core +2 more sources
On the number of 1-perfect binary codes: a lower bound
, 2009 We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.Comment: 5pp(Eng)+7pp(Rus) V2: revised V3: + Russian version ...
Avgustinovich, Sergey, Krotov, Denis
core +1 more source
Sparse binary cyclotomic polynomials [PDF]
J. Number Theory 132 (2012), 410-413, 2011 We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.
arxiv
GEE analysis of clustered binary data with diverging number of covariates
, 2011 Clustered binary data with a large number of covariates have become increasingly common in many scientific disciplines. This paper develops an asymptotic theory for generalized estimating equations (GEE) analysis of clustered binary data when the number ...
Wang, Lan
core +1 more source
The Number of Distinct Subsequences of a Random Binary String [PDF]
arXiv, 2013 We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.
arxiv
Composition of Binary Quadratic Forms over Number Fields
, 2019 In this article, the standard correspondence between the ideal class group of a quadratic number field and the equivalence classes of binary quadratic forms of given discriminant is generalized to any base number field of narrow class number one.
Zemková, Kristýna
core
Code generator matrices as RNG conditioners
, 2017 We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connection between the Walsh spectrum of the resulting random variable and the ...
Meneghetti, Alessio +2 more
core +1 more source
Binary words avoiding xx^Rx and strongly unimodal sequences [PDF]
, 2015 In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxx^R was intermediate between polynomial and exponential.
Currie, James D., Rampersad, Narad
core +1 more source