相关论文: Legendre pair of length $77$ using complementary b…

Any link that is the closure of a positive braid has a natural Legendrian representative. These were introduced in an earlier paper, where their Chekanov--Eliashberg contact homology was also evaluated. In this paper we re-phrase and…

The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2Z4-additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain…

We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of…

This paper is an investigation of a procedure for constructing lattices by means of taking the sum of a pair of isometric lattices. We present various general results pertaining to this construction and discuss several examples of it…

The recent gravitational wave measurements have demonstrated the existence of stellar mass black hole binaries. It is essential for our understanding of massive star evolution to identify the contribution of binary evolution to the…

In this paper we express the difference of two complementary Beatty sequences, as the sum of two Beatty sequences closely related to them. In the process we introduce a new Algorithm that generalizes the well known Minimum Excluded…

We are interested in the quantitative analysis of the compaction ratio for two classical families of trees: recursive trees and plane binary increasing trees. These families are typical representatives of tree models with a small depth.…

We prove that there are at least as many exact embedded Lagrangian fillings as seeds for Legendrian links of affine type $\tilde{\mathsf{D}} \tilde{\mathsf{E}}$. We also provide as many Lagrangian fillings with certain symmetries as seeds…

A new notion of bent sequence related to Hadamard matrices was introduced recently, motivated by a security application ( Sol\'e et al, 2021). We study the self dual class in length at most $196.$ We use three competing methods of…

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 systematically derive the Lax pair formulation for both discrete and continuum integrable classical theories with consistent boundary conditions.

We report results on various techniques which allow to compute the expansion into Legendre (or in general Gegenbauer) polynomials in an efficient way. We describe in some detail the algebraic/symbolic approach already presented in Ref.1 and…

We present an algorithm for searching regular expression matches in compressed text. The algorithm reports the number of matching lines in the uncompressed text in time linear in the size of its compressed version. We define efficient data…

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

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 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…

Spectroscopic observations of binary stars in globular clusters are essential to shed light on the poorly constrained period, eccentricity, and mass ratio distributions and to develop an understanding of the formation of peculiar stellar…

In this paper we study a family of binary Legendre sequences and its family complexity. Family complexity is a pseudorandomness measure introduced by Ahlswede et.~al.~in 2003. A lower bound on the family complexity of a family based on the…

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

In this article, I examine several observational trends regarding protoplanetary disks, debris disks and exoplanets in binary systems in an attempt to constrain the physical mechanisms of planet formation in such a context. Binaries wider…