scholarly journals Domino Fibonacci Tableaux

10.37236/1071 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Naiomi Cameron ◽  
Kendra Killpatrick
Keyword(s):  
Domino Tableaux ◽  
Spin Property ◽  
Insertion Algorithm ◽  
Fibonacci Lattice ◽  
Colored Permutations

In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley's Fibonacci lattice $Z(2)$, and define domino Fibonacci tableaux. We give an insertion algorithm which takes colored permutations to pairs of tableaux $(P,Q)$ of domino Fibonacci shape. We then define a notion of spin for domino Fibonacci tableaux for which the insertion algorithm preserves the color-to-spin property. In addition, we give an evacuation algorithm for standard domino Fibonacci tableaux which relates the pairs of tableaux obtained from the domino insertion algorithm to the pairs of tableaux obtained from Fomin's growth diagrams.

scholarly journals Skew domino Schensted algorithm and sign-imbalance

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Jang Soo Kim
Keyword(s):  
Generating Function ◽  
Weighted Sum ◽  
Domino Tableaux ◽  
Spin Property ◽  
International Audience ◽  
Comme Application ◽  
Special Case

International audience Using growth diagrams, we define a skew domino Schensted algorithm which is a domino analogue of the "Robinson-Schensted algorithm for skew tableaux'' due to Sagan and Stanley. The color-to-spin property of Shimozono and White is extended. As an application, we give a simple generating function for a weighted sum of skew domino tableaux whose special case is a generalization of Stanley's sign-imbalance formula. The generating function gives a method to calculate the generalized sign-imbalance formula. Nous définissons, à partir de diagrammes de croissances, un algorithme de Schensted pour les dominos gauches. Cet algorithme est un analogue de l'algorithme de Schensted pour les tableaux gauches dû à Sagan et Stanley. Nous généralisons la propriété couleur-à-spin de Shimozono et White. Comme application, nous présentons une fonction génératrice simple pour une somme pondérée de tableaux de dominos gauches qui, dans un cas particulier, généralise la formule de "sign-imbalance'' de Stanley. La fonction génératrice donne aussi lieu à une méthode permettant de calculer la formule de "sign-imbalance''.

Conformal and G1 Continuous Connection of NURBS Curves

2013 ◽  
Vol 756-759 ◽  
pp. 3826-3830
Author(s):  
Pei Sen Deng ◽  
Shao Ping Chen ◽  
Jun Cheng Shen
Keyword(s):  
Knot Insertion ◽  
Nurbs Curve ◽  
Nurbs Curves ◽  
Insertion Algorithm ◽  
Vector Rotation

This paper converts a NURBS curve to piecewise rational Bézier curves by knot insertion algorithm, and then discusses the algorithm of continuous connection of NURBS curves. Meanwhile, explores the method to keep the same shape of the NURBS curves after connecting through the point translation and vector rotation theory. Finally, gives an instance to verify the validity of the algorithm.

scholarly journals Using Protein Clusters from Whole Proteomes to Construct and Augment a Dendrogram

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Yunyun Zhou ◽  
Douglas R. Call ◽  
Shira L. Broschat
Keyword(s):  
Open Source Software ◽  
Protein Profile ◽  
Correlation Filter ◽  
New Taxon ◽  
Optimal Alignment ◽  
Gram Negative ◽  
Protein Clusters ◽  
Bacterial Plasmids ◽  
Insertion Algorithm ◽  
Ab Initio Approach

In this paper we present a new ab initio approach for constructing an unrooted dendrogram using protein clusters, an approach that has the potential for estimating relationships among several thousands of species based on their putative proteomes. We employ an open-source software program called pClust that was developed for use in metagenomic studies. Sequence alignment is performed by pClust using the Smith-Waterman algorithm, which is known to give optimal alignment and, hence, greater accuracy than BLAST-based methods. Protein clusters generated by pClust are used to create protein profiles for each species in the dendrogram, these profiles forming a correlation filter library for use with a new taxon. To augment the dendrogram with a new taxon, a protein profile for the taxon is created using BLASTp, and this new taxon is placed into a position within the dendrogram corresponding to the highest correlation with profiles in the correlation filter library. This work was initiated because of our interest in plasmids, and each step is illustrated using proteomes from Gram-negative bacterial plasmids. Proteomes for 527 plasmids were used to generate the dendrogram, and to demonstrate the utility of the insertion algorithm twelve recently sequenced pAKD plasmids were used to augment the dendrogram.

Structure factor of a dimerized Fibonacci lattice

2002 ◽  
Vol 66 (6) ◽  
Author(s):  
R. K. Moitra ◽  
Arunava Chakrabarti ◽  
S. N. Karmakar
Keyword(s):  
Structure Factor ◽  
Fibonacci Lattice

Geometrical and Topological Issues in NMT-Based Modeling

1992 ◽  
Author(s):  
Mukul Saxena ◽  
Rajan Srivatsan ◽  
Jonathan E. Davis
Keyword(s):  
Data Structure ◽  
Geometric Modeling ◽  
Modeling Environment ◽  
Insertion Algorithm ◽  
The Face ◽  
Euler Operators ◽  
Application Specific ◽  
Model Topology

Abstract The Non-Manifold Topology (NMT) Radial Edge data structure, along with the supporting set of Euler operators, provides a versatile environment for modeling non-manifold domains. The operators provide the basic tools to construct and manipulate model topology. However, an implementation of the base functionality in a geometric modeling environment raises some geometry-related issues that need to be addressed to ensure the topological validity of the underlying model. This paper focuses on those issues and emphasizes the use of geometry in the implementation of topological operators. Enhancements to the topology manipulation operations are also discussed. Specifically, this paper describes (i) a geometry-based algorithm for face insertion within the Radial Edge data structure, (ii) a manifestation of the face-insertion algorithm to resolve topological ambiguities that arise in the design of topological glue operators, and (iii) enhancements to the topology deletion operators to meet application-specific requirements.

Sign in / Sign up

Export Citation Format

Share Document