相关论文: Combinatorial identities for binary necklaces from…
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear…
During the OGLE-2 operation, Soszynski et al. (2003) found 3 LMC candidates for an RR Lyr-type component in an eclipsing binary system. Two of those have orbital periods that are too short to be physically plausible and hence have to be…
We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…
We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…
Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear codes.
We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
The monography presents a new algorithm for finding the clique of maximal length in a nonseparable graph. The algorithm is based on the properties of the representation of a clique as a subset of the set of cycles with a length of three,…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
Three-graded root systems can be arranged into nested sequences. One exceptional sequence provides a natural means to recover some structures and symmetries familiar in the context of particle physics.
Thirty eight long-period (P>10 days), apparently contact binary stars discovered by the OGLE-II project in the SMC appear to be Beta Lyrae-type systems with ellipsoidal variations of the cool components dominating over eclipse effects in…
In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of…
We have derived accurate and homogeneous Lithium abundances in 49 main sequence binary systems belonging to the Hyades Open Cluster by using a deconvolution method to determine individual magnitudes and colors for the primary and secondary…
We discuss reflections identities of harmonic sums up to weight three. The need for this kind of identities emerges in analysis of the general structure of eigenvalue of the BFKL equation. The reflection identities decompose a product of…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…
A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…
Close binary stars are binary stars where the component stars are close enough such that they can exchange mass and/or energy. They are subdivided into semi-detached, overcontact or ellipsoidal binary stars. A challenging problem in the…
We analyze the precision of the characteristic polynomial of an $n\times n$ p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p^N), we give a criterion (checkable in time…
We extend the notion of $y$-variables (coefficients) in cluster algebras to cluster scattering diagrams. Accordingly, we extend the dilogarithm identity associated with a period in a cluster pattern to the one associated with a loop in a…