Enumeration of Extended m-Regular Linear Stacks

Qiang-Hui Guo1, Lisa H Sun1, Jian Wang1

  • 1Center for Combinatorics, LPMC-TJKLC, Nankai University , Tianjin, P.R. China .

Summary

This study introduces extended linear stacks to model protein contact maps, showing their generating function relates to standard linear stacks. This allows deriving asymptotic formulas for protein fold structures.

Related Concept Videos

Stability of structures01:14

Stability of structures

In mechanical engineering, the stability of systems under various forces is critical for designing durable and efficient structures. One fundamental way to explore these concepts is by analyzing systems like two rods connected at a pivot point, O, with a torsional spring of spring constant k at the pivot point. This system is similar in appearance to a scissor jack used to change tires on a car. In this case, the arms of the linkage (equivalent to the rods in this system) are entirely vertical,...
583
Rationalizing Substitutions01:29

Rationalizing Substitutions

Integrals involving non-rational functions are often difficult to evaluate using standard techniques, especially when radicals appear in the integrand. Rationalizing substitution provides a systematic method for simplifying such integrals by converting them into rational forms that are easier to handle.Consider a rod whose linear mass density depends on a constant linear density, a characteristic length, and the distance from the left end of the rod. Determining the total mass requires...
83
Sequences01:29

Sequences

Sequences are fundamental mathematical objects consisting of ordered lists of numbers that follow a specific rule or pattern. Sequences are critical in various mathematical concepts, including calculus, series, and number theory. They can model real-world phenomena such as population growth, financial investments, and physical processes like the diminishing height of a bouncing ball.Each number in a sequence is referred to as a term. Typically, the terms are denoted as a1, a2, a3,…, where...
386
SFG Algebra01:16

SFG Algebra

In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
366
Introduction to Structures01:30

Introduction to Structures

A structure is defined as a system of interconnected members designed to support or transfer forces and successfully withstand the loads acting on them. The internal forces of a structure can be determined by decomposing the structure and analyzing the free-body diagrams of the individual members or of a combination of members. This helps in understanding the structural elements' behavior and ensuring that the structure is stable and can withstand the subjected loads.
There are three main...
1.8K
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...
291