On the algebra of binary codes representing close-packed stacking sequences

Ernesto Estevez-Rams1, Cristy Azanza-Ricardo, Jorge Martínez García

  • 1Institute for Materials and Reagents (IMRE), University of Havana, San Lazaro y L, CP 10400, C. Habana, Cuba. estevez@imre.oc.uh.cu

Related Concept Videos

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
Arithmetic Sequences01:30

Arithmetic Sequences

An arithmetic sequence is a structured arrangement of numbers where each term is derived by adding a constant value, known as the common difference, to the previous term. This consistent pattern allows for the efficient computation of any term within the sequence as well as the cumulative sum of multiple terms. The formula for finding the nth term of an arithmetic sequence is:Here, aₙ represents the nth term of the sequence, a is the first term, d is the common difference, and n is the term...
Convergence of Sequences01:26

Convergence of Sequences

A sequence is a function defined on the natural numbers that assigns a value to each index. It can be understood as an ordered list of terms generated one after another. In mathematical analysis, an important question is whether the terms of a sequence approach a single real number as the index becomes very large. When this happens, the sequence is said to converge, and the value approached is called the limit. From a graphical perspective, convergence means that the plotted terms approach a...
Geometric Sequences01:30

Geometric Sequences

In systems where values diminish by a constant proportion at each stage, the resulting sequence follows a geometric structure. Each new value in the sequence is obtained by applying a fixed multiplier to the preceding term. This regular, proportional decline type is often used to represent processes involving gradual loss, such as energy dissipation or reduction in amplitude over time.When analyzing the total effect of such a process across unlimited iterations, the series of values is referred...
Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Basic Discrete Time Signals01:16

Basic Discrete Time Signals

The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...