Related papers: Arithmetic crosscorrelation of binary $m$-sequence…

We investigate the long-distance asymptotic behavior of the dimer correlations in the spin-1/2 alternating $XY$chain both at T=0 and at sufficiently low-temperatures. The correlations consist of the dimer long-range order part and the…

We report on a study of eclipse timing variations in contact binary systems, using long-cadence lightcurves in the Kepler archive. As a first step, 'observed minus calculated' (O-C) curves were produced for both the primary and secondary…

Employing the data from orbital periods and masses of extra-solar planets in 166 multiple planetary systems, the period-ratio and mass-ratio of adjacent planet pairs are studied. The correlation between the period-ratio and mass-ratio is…

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\{1, \ldots, n\}$ with $m=m(n)$ edges. We study the cycle and block structure of $P(n,m)$ when $m\sim n/2$. More precisely, we determine…

The time dependence of nonclassical correlations is investigated for two fields (1,2) generated by an ensemble of cold Cesium atoms via the protocol of Duan et al. [Nature Vol. 414, p. 413 (2001)]. The correlation function R(t1,t2) for the…

A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M to be M-, (M-1)- or (M-2)-perfect are described. Some…

This paper presents a new approach to combine cross-correlation functions. The combination is based on a maximum-likelihood approach and uses a non-linear combination scheme. It can be effective for radial-velocity analysis of multi-order…

Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…

The merit factor of a $\{-1, 1\}$ binary sequence measures the collective smallness of its non-trivial aperiodic autocorrelations. Binary sequences with large merit factor are important in digital communications because they allow the…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

We derive formulas for $(i)$ the number of toroidal $n\times n$ binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and $(ii)$ the number of toroidal $n\times n$ binary arrays, allowing rotation and/or…

The existence of the limiting pair correlation for angles between reciprocal geodesics on the modular surface is established. An explicit formula is provided, which captures geometric information about the length of reciprocal geodesics, as…

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when the edges of the graph are pre-sorted. A related problem,…

The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.

Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on interleaving technique and Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., https://doi.org/10.1007/s10623-017-0398-5).…

Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

After $2$-crossing-critical graphs were characterized in 2016, their most general subfamily, large $3$-connected $2$-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their…

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…