Related papers: Legendre pair of length $77$ using complementary b…
A correlation is a binary vector that encodes all possible positions of overlaps of two words, where an overlap for an ordered pair of words (u,v) occurs if a suffix of word u matches a prefix of word v. As multiple pairs can have the same…
The Legendre-Stirling numbers of the second kind were introduced by Everitt et al. in the spectral theory of powers of the Legendre differential expressions. In this paper, we provide a combinatorial code for Legendre-Stirling set…
We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime $p$ (one is the binary threshold sequences, the other is the Legendre-Fermat quotient sequences) via determining the…
We performed a theoretical investigation on the mixing-length parameter recovery from an eclipsing double-lined binary system. We focused on a syntetic system composed by a primary of mass M = 0.95 Msun and a secondary of M = 0.85 Msun.…
We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the…
In this work, we define a modification of a bordered construction for self-dual codes which utilises $\lambda$-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative…
Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…
In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \geq 1$. We will prove that this generation is exhaustive, that is,…
In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult…
We prove that there are at least seeds many exact embedded Lagrangian fillings for Legendrian links of type $\mathsf{ADE}$. We also provide seeds many Lagrangian fillings with certain symmetries for type $\mathsf{BCFG}$. Our main tools are…
It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
Classical Cepheid stars have been considered since more than a century as reliable tools to estimate distances in the universe thanks to their Period-Luminosity (P-L) relationship. Moreover, they are also powerful astrophysical…
We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…
In this paper we investigate enumeration of some classes of $n$-character strings and binary necklaces. Recall that binary necklaces are necklaces in two colors with length $n$. We prove three results (Theorems 1, 1' and 2) concerning the…
Cepheids provide approaches to determining binary parameters which are often complementary to those for main sequence massive and intermediate mass stars. Specifically, we are using high resolution imaging, radial velocities, and X-ray…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…