Related papers: Binary sequences with three-valued cross correlati…
We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…
We give a tight bound for the triple intersection numbers of Paley graphs. In particular, we show that any three vertices have a common neighbor in Paley graphs of order larger than 25.
First, we state a generalization of the minimum-distance bound for PIR codes. Then we describe a construction for linear PIR codes using packing designs and use it to construct some new 5-PIR codes. Finally, we show that no encoder (linear…
It is shown that there does not exist a binary projective triply-even code of length $59$. This settles the last open length for projective triply-even binary codes. Therefore, projective triply-even binary codes exist precisely for lengths…
We present new observations of cool <6000K and low mass <1Msun binary systems that have been discovered by searching several modern stellar photometric databases. The search has led to a factor of 10 increase in the number of known cool…
Poissonian pair correlations have sparked interest within the mathematical community, because of their number theoretic properties, and their connections to quantum physics and probability theory, particularly uniformly distributed random…
We have attempted to establish an observational evidence for presence of distant companions which may have acquired and/or absorbed the angular momentum during evolution of multiple systems thus facilitating or enabling formation of contact…
We present results on the exchange cross section for the interaction between a hard binary and a field of single stars, for arbitrary masses. The results are based partly on extensive numerical scattering experiments, and partly on analytic…
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…
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove…
In this paper, we construct Pell matrices, analogous to Fibonacci matrices, to study algebraic properties of Pell numbers via linear algebra. This framework yields identities involving the trace, inverse, and determinant, as well as matrix…
Here we report our study on a low-mass ratio contact binary system NSVS 3198272. We subjected our multi-filter ground-based photometry to the light curve numerical modeling using a modified Wilson-Devinney code. We present three scenarios…
We study the performance of ternary isodual codes which are not self-dual and ternary self-dual codes, as measured by the decoding error probability in bounded distance decoding. We compare the performance of ternary double circulant and…
We present an overview of pulsating stars in close binaries, focusing on the question what role the dupliticity plays in triggering and/or modifying stellar oscillations and on how it can help us to interpret the oscillatory behaviour of…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
In this paper, we give recurrence relations and identities for some integer sequences related to Ward numbers such as Ward-Lah numbers, varied Ward numbers and binomial Ward numbers. Most of the sequences are entered in the On-Line…
We point out a stunning time asymmetry in the short time cross correlations between intra-day and overnight volatilities (absolute values of log-returns of stock prices). While overnight volatility is significantly (and positively)…
Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of…