Log in

Relevant bibliographies by topics / Decomposition of Groups

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Decomposition of Groups'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Decomposition of Groups.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Decomposition of Groups"

1

GUTIERREZ, MAURICIO, and ADAM PIGGOTT. "RIGIDITY OF GRAPH PRODUCTS OF ABELIAN GROUPS." Bulletin of the Australian Mathematical Society 77, no. 2 (2008): 187–96. http://dx.doi.org/10.1017/s0004972708000105.

Full text

Abstract:

AbstractWe show that if G is a group and G has a graph-product decomposition with finitely generated abelian vertex groups, then G has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a directly indecomposable cyclic group, and a unique decomposition in which each vertex group is a finitely generated abelian group and the graph satisfies the T0 property. Our results build on results by Droms, Laurence and Radcliffe.

APA, Harvard, Vancouver, ISO, and other styles

2

Bagchi, Susmit. "Projective and Non-Projective Varieties of Topological Decomposition of Groups with Embeddings." Symmetry 12, no. 3 (2020): 450. http://dx.doi.org/10.3390/sym12030450.

Full text

Abstract:

In general, the group decompositions are formulated by employing automorphisms and semidirect products to determine continuity and compactification properties. This paper proposes a set of constructions of novel topological decompositions of groups and analyzes the behaviour of group actions under the topological decompositions. The proposed topological decompositions arise in two varieties, such as decomposition based on topological fibers without projections and decomposition in the presence of translated projections in topological spaces. The first variety of decomposition introduces the co

APA, Harvard, Vancouver, ISO, and other styles

3

Shahriari, Shahriar. "Groups isomorphic via decomposition." Advances in Applied Mathematics 11, no. 1 (1990): 35. http://dx.doi.org/10.1016/0196-8858(90)90003-h.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Führ, Hartmut, and Azita Mayeli. "Homogeneous Besov Spaces on Stratified Lie Groups and Their Wavelet Characterization." Journal of Function Spaces and Applications 2012 (2012): 1–41. http://dx.doi.org/10.1155/2012/523586.

Full text

Abstract:

We establish wavelet characterizations of homogeneous Besov spaces on stratified Lie groups, both in terms of continuous and discrete wavelet systems. We first introduce a notion of homogeneous Besov spaceB˙p,qsin terms of a Littlewood-Paley-type decomposition, in analogy to the well-known characterization of the Euclidean case. Such decompositions can be defined via the spectral measure of a suitably chosen sub-Laplacian. We prove that the scale of Besov spaces is independent of the precise choice of Littlewood-Paley decomposition. In particular, different sub-Laplacians yield the same Besov

APA, Harvard, Vancouver, ISO, and other styles

5

Brunker, Don, та Denis Higgs. "Primary Decomposition for Σ-Groups". Canadian Mathematical Bulletin 31, № 4 (1988): 399–403. http://dx.doi.org/10.4153/cmb-1988-057-2.

Full text

Abstract:

AbstractA Σ-group is an abelian group on which is given a collection of infinite sums having properties suggested by those of absolutely convergent series in R or C. It is shown that the usual decomposition of a torsion abelian group into its p-components carries over to the case of Σ-groups when the property of being torsion is replaced by an appropriate uniform version. For a certain class of Σ-groups, it turns out that being torsion is already sufficient for primary decomposition to hold.

APA, Harvard, Vancouver, ISO, and other styles

6

Thaheem †, A. B. "Direct sum decomposition of groups." International Journal of Mathematical Education in Science and Technology 36, no. 1 (2005): 126–28. http://dx.doi.org/10.1080/00207390412331317068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chastkofsky, Leonard. "Decomposition Numbers of Chevalley Groups." Journal of Algebra 240, no. 2 (2001): 589–607. http://dx.doi.org/10.1006/jabr.2000.8746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

DUNCAN, ANDREW J., and VLADIMIR N. REMESLENNIKOV. "AUTOMORPHISMS OF PARTIALLY COMMUTATIVE GROUPS II: COMBINATORIAL SUBGROUPS." International Journal of Algebra and Computation 22, no. 07 (2012): 1250074. http://dx.doi.org/10.1142/s0218196712500749.

Full text

Abstract:

We define several "standard" subgroups of the automorphism group Aut (G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut (G). If C is the commutation graph of G, we show how Aut (G) decomposes in terms of the connected components of C: obtaining a particularly clear decomposition theorem in the special case where C has no isolated vertices. If C has no vertices of a type we call dominated then we give a semi-direct decomposition of Aut (G) into a subgroup of locally conjugating automorphisms by the subgroup stabilizing a

APA, Harvard, Vancouver, ISO, and other styles

9

PARIS, LUIS. "IRREDUCIBLE COXETER GROUPS." International Journal of Algebra and Computation 17, no. 03 (2007): 427–47. http://dx.doi.org/10.1142/s0218196707003779.

Full text

Abstract:

We prove that a non-spherical irreducible Coxeter group is (directly) indecomposable and that an indefinite irreducible Coxeter group is strongly indecomposable in the sense that all its finite index subgroups are (directly) indecomposable. Let W be a Coxeter group. Write W = WX1 × ⋯ × WXb × WZ3, where WX1, … , WXb are non-spherical irreducible Coxeter groups and WZ3 is a finite one. By a classical result, known as the Krull–Remak–Schmidt theorem, the group WZ3 has a decomposition WZ3 = H1 × ⋯ × Hq as a direct product of indecomposable groups, which is unique up to a central automorphism and a

APA, Harvard, Vancouver, ISO, and other styles

10

Kovács, L. G. "Wreath decompositions of finite permutation groups." Bulletin of the Australian Mathematical Society 40, no. 2 (1989): 255–79. http://dx.doi.org/10.1017/s0004972700004366.

Full text

Abstract:

There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding ‘imprimitive wreath decomposition’ concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The result may be heuristically expressed as follows, exploiting the associative nature of the construction. Each finite transitive permutation group may be written, essentially uniquely, as the wreath produ

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Decomposition of Groups"

1

Mathews, Chad Ullery William D. "Mixed groups with decomposition bases and global k-groups." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Summer/Theses/MATHEWS_CHAD_59.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wilson, James B. "Group decompositions, Jordan algebras, and algorithms for p-groups /." Connect to title online (Scholars' Bank) Connect to title online (ProQuest), 2008. http://hdl.handle.net/1794/8302.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 2008.<br>Typescript. Includes vita and abstract. Includes bibliographical references (leaves 121-125). Also available online in Scholars' Bank; and in ProQuest, free to University of Oregon users.

APA, Harvard, Vancouver, ISO, and other styles

3

Pearce, Geoffrey. "Transitive decompositions of graphs." University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0087.

Full text

Abstract:

A transitive decomposition of a graph is a partition of the arc set such that there exists a group of automorphisms of the graph which preserves and acts transitively on the partition. This turns out to be a very broad idea, with several striking connections with other areas of mathematics. In this thesis we first develop some general theory of transitive decompositions, and in particular we illustrate some of the more interesting connections with certain combinatorial and geometric structures. We then give complete, or nearly complete, structural characterisations of certain classes of transi

APA, Harvard, Vancouver, ISO, and other styles

4

Hogan, Ian. "The Brauer Complex and Decomposition Numbers of Symplectic Groups." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1489766963453771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chaneb, Reda. "Basic sets and decomposition matrices of finite groups of Lie type in small characteristic." Thesis, Université de Paris (2019-....), 2019. http://www.theses.fr/2019UNIP7166.

Full text

Abstract:

Cette thèse se concentre sur les aspects modulaires de la théorie des représentations. Plus précisément, nous nous intéressons aux ensembles basiques des blocs unipotents des groupes finis de type de Lie qui vérifient une propriété d’ « unitriangularité ». Dans la première partie de cette thèse , en nous inspirant des travaux de Lusztig sur le paramétrage des représentations unipotentes en caractéristique 0, nous introduisons une méthode pour compter les représentations modulaires irréductibles contenues dans les blocs unipotents. Nous conjecturons que cette méthode est valable pour tout les g

APA, Harvard, Vancouver, ISO, and other styles

6

Williams, Adrian Leonard. "Some more decomposition numbers for modular representations of symmetric groups." Thesis, Imperial College London, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313541.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Combe, Noémie. "On a new cell decomposition of a complement of the discriminant variety : application to the cohomology of braid groups." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0140.

Full text

Abstract:

Cette thèse concerne principalement deux objets classiques étroitement liés: d'une part la variété des polynômes complexes unitaires de degré $d>1$ à une variable, et à racines simples (donc de discriminant différent de zéro), et d'autre part, les groupes de tresses d'Artin avec d brins. Le travail présenté dans cette thèse propose une nouvelle approche permettant des calculs cohomologiques explicites à coefficients dans n'importe quel faisceau. En vue de calculs cohomologiques explicites, il est souhaitable d'avoir à sa disposition un bon recouvrement au sens de Čech. L'un des principaux o

APA, Harvard, Vancouver, ISO, and other styles

8

Urenda, Castañeda Julio César. "Multiplicative Reisz decomposition on the ring of matrices over a totally ordered field." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2009. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Fossas, Ariadna. "Sur la géométrie et la combinatoire du groupe T de Thompson." Thesis, Grenoble, 2012. http://www.theses.fr/2012GRENM104/document.

Full text

Abstract:

Cette thèse concerne le groupe T de Thompson. Ce groupe simple infini et finiment présenté est généralement vu comme un sous-groupe du groupe des homéomorphismes dyadiques du cercle unité qui sont linéaires par morceaux et préservent l'orientation («T linéaire par morceaux»). Cependant, T peut aussi être vu comme: 1.- le groupe des classes d'équivalence des paires équilibrées d'arbres binaires finis («T combinatoire»), 2.- un sous-groupe du groupe des homéomorphismes de la droite projective réelle qui préservent l'orientation et sont «PSL(2,Z) par morceaux» («T projectif par morceaux»), et 3.-

APA, Harvard, Vancouver, ISO, and other styles

10

Bastian, Nicholas Lee. "Terwilliger Algebras for Several Finite Groups." BYU ScholarsArchive, 2021. https://scholarsarchive.byu.edu/etd/8897.

Full text

Abstract:

In this thesis, we will explore the structure of Terwilliger algebras over several different types of finite groups. We will begin by discussing what a Schur ring is, as well as providing many different results and examples of them. Following our discussion on Schur rings, we will move onto discussing association schemes as well as their properties. In particular, we will show every Schur ring gives rise to an association scheme. We will then define a Terwilliger algebra for any finite set, as well as discuss basic properties that hold for all Terwilliger algebras. After specializing to the ca

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Decomposition of Groups"

1

Almost completely decomposable groups. Gordon and Breach Science Publishers, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Scott, Peter. Regular neighbourhoods and canonical decompositions for groups. Société Mathématique de France, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

A, Swarup Gadde, ed. Regular neighbourhoods and canonical decompositions for groups. Société Mathématique de France, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Klingen, Norbert. Arithmetical similarities: Prime decomposition and finite group theory. Clarendon Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chacron, M. Decomposing and ordering a certain crossed product. Carleton University, Mathematics and Statistics, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wong, Shek-Tung. The meromorphic continuation and functional equations of cuspidal Eisenstein series for maximal cuspidal groups. American Mathematical Society, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bratteli, Ola. Operator Algebras and Quantum Statistical Mechanics 1: C*- and W*-Algebras Symmetry Groups Decomposition of States. Springer Berlin Heidelberg, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Moeglin, C., and J. L. Waldspurger. Decomposition Spectrale et Series d'Eisenstein (Progress in Mathematics). Birkhauser, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Voisin, Claire. Decomposition of the Diagonal. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691160504.003.0003.

Full text

Abstract:

This chapter explains the method initiated by Bloch and Srinivas, which leads to statements of the following: if a smooth projective variety has trivial Chow groups of k-cycles homologous to 0 for k ≤ c − 1, then its transcendental cohomology has geometric coniveau ≤ c. This result is a vast generalization of Mumford's theorem. A major open problem is the converse of this result. It turns out that statements of this kind are a consequence of a general spreading principle for rational equivalence. Consider a smooth projective family X → B and a cycle Z → B, everything defined over C; then, if a

APA, Harvard, Vancouver, ISO, and other styles

10

Voisin, Claire. Chow groups of large coniveau complete intersections. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691160504.003.0004.

Full text

Abstract:

This chapter first describes how to compute the Hodge coniveau of complete intersections. It then explains a strategy to attack the generalized Hodge conjecture for complete intersections of coniveau 2. The guiding idea is that although the powerful method of the decomposition of the diagonal suggests that computing Chow groups of small dimension is the right way to solve the generalized Hodge conjecture, it might be better to invert the logic and try to compute the geometric coniveau directly. And indeed, this chapter culminates with the proof of the fact that for very general complete inters

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Decomposition of Groups"

1

Efrat, Ido. "Decomposition groups." In Mathematical Surveys and Monographs. American Mathematical Society, 2006. http://dx.doi.org/10.1090/surv/124/15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Onishchik, Arkadij L., and Ernest B. Vinberg. "Levi Decomposition." In Lie Groups and Algebraic Groups. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-74334-4_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bump, Daniel. "The Iwasawa Decomposition." In Lie Groups. Springer New York, 2004. http://dx.doi.org/10.1007/978-1-4757-4094-3_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bump, Daniel. "The Bruhat Decomposition." In Lie Groups. Springer New York, 2004. http://dx.doi.org/10.1007/978-1-4757-4094-3_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bump, Daniel. "The Bruhat Decomposition." In Lie Groups. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8024-2_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Efrat, Ido. "Intersections of decomposition groups." In Mathematical Surveys and Monographs. American Mathematical Society, 2006. http://dx.doi.org/10.1090/surv/124/21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Matzat, B. H. "Braids and Decomposition Groups." In Progress in Mathematics. Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4757-4273-2_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cohen, F. R., and J. Wu. "On Braid Groups, Free Groups, and the Loop Space of the 2-Sphere." In Categorical Decomposition Techniques in Algebraic Topology. Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-7863-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Barndorff-Nielsen, Ole E., Preben Blæsild, and Poul Svante Eriksen. "Matrix Lie groups." In Decomposition and Invariance of Measures, and Statistical Transformation Models. Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4612-3682-5_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nehaniv, Chrystopher L. "Cascade Decomposition of Arbitrary Semigroups." In Semigroups, Formal Languages and Groups. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-011-0149-3_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Decomposition of Groups"

1

Kim, Yong Se, Yong Hee Jung, Byung Gu Kang, and Hyung Min Rho. "Feature-Based Part Similarity Assessment Method Using Convex Decomposition." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/cie-48184.

Full text

Abstract:

Mechanical parts are often grouped into part families based on the similarity of their shapes, to support efficient manufacturing process planning and design modification. This paper presents a similarity assessment technique to support part family classification for machined parts. It exploits the multiple feature decompositions obtained by the feature recognition method using convex decomposition. Convex decomposition provides a hierarchical volumetric representation of a part, organized in an outside-in hierarchy. It provides local accessibility directions, which supports abstract and quali

APA, Harvard, Vancouver, ISO, and other styles

2

FERRARIO, D. L. "TRANSITIVE DECOMPOSITION OF n-BODY SYMMETRY GROUPS." In Proceedings of the International Conference on SPT 2007. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812776174_0009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Li, Simon. "Functional Decomposition of the Clustering Approach for Matrix-Based Structuring." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28768.

Full text

Abstract:

In engineering design, matrices have been commonly used to capture dependency relationships for structure-related problems (e.g., product architecture, process workflow, and team organization). In this context, structuring is considered a group formation process that clusters the design entities and identifies the interactions among the formed groups. To support matrix-based design structuring, this paper proposes a clustering approach that has three phases in the working procedure. Firstly, the coupling analysis is used to assess the coupling strength of any two entities according to the appl

APA, Harvard, Vancouver, ISO, and other styles

4

ZALESSKI, A. E. "DECOMPOSITION NUMBERS FOR PROJECTIVE MODULES OF FINITE CHEVALLEY GROUPS." In Proceedings of the Conference. WORLD SCIENTIFIC, 2011. http://dx.doi.org/10.1142/9789814350051_0029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Konishi, T. "Unitary subgroup space-time codes using Bruhat decomposition and Weyl groups." In IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228193.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sljoka, Adnan, Offer Shai, and Walter Whiteley. "Checking Mobility and Decomposition of Linkages via Pebble Game Algorithm." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48340.

Full text

Abstract:

The decomposition of linkages into Assur graphs (Assur groups) was developed by Leonid Assur in 1914 - to decompose a linkage into fundamental minimal components for the analysis and synthesis of the linkages. In the paper, some new results and new methods are introduced for solving problems in mechanisms, bringing in methods from the rigidity theory community. Using these techniques, an investigation of Assur graphs and the decomposition of linkages has reworked and extended the decomposition using the well developed mathematical concepts from theory of rigidity and directed graphs. We recall

APA, Harvard, Vancouver, ISO, and other styles

7

Tao, Shaozhe, Yifan Sun, and Daniel Boley. "Inverse Covariance Estimation with Structured Groups." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/395.

Full text

Abstract:

Estimating the inverse covariance matrix of p variables from n observations is challenging when n is much less than p, since the sample covariance matrix is singular and cannot be inverted. A popular solution is to optimize for the L1 penalized estimator; however, this does not incorporate structure domain knowledge and can be expensive to optimize. We consider finding inverse covariance matrices with group structure, defined as potentially overlapping principal submatrices, determined from domain knowledge (e.g. categories or graph cliques). We propose a new estimator for this problem setting

APA, Harvard, Vancouver, ISO, and other styles

8

Arikawa, Keisuke. "Analyzing Internal Motion of Proteins From Viewpoint of Robot Kinematics: Formulation of Group Forced Response Method." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70591.

Full text

Abstract:

An analogous relationship exists between the kinematic structures of proteins and robotic mechanisms. Hence, using this analogy, we attempt to understand the internal motions of proteins from the perspective of robot kinematics. In this study, we propose a method called group forced response (GFR) method for predicting the internal motion of proteins on the basis of their three-dimensional structural data (PDB data). In this method, we apply forces in static equilibrium to groups of atoms (e.g., secondary structures, domains, and subunits) and not to specific atoms. Furthermore, we predict the

APA, Harvard, Vancouver, ISO, and other styles

9

Torab, H. "Sensitivity Analysis of Model Coordination Method of Decomposition in Nonlinear Programming." In ASME 1988 Design Technology Conferences. American Society of Mechanical Engineers, 1988. http://dx.doi.org/10.1115/detc1988-0023.

Full text

Abstract:

Abstract A methodology in sensitivity analysis of the Model Coordination Method (MCM) of Decomposition in Nonlinear Programming is discussed. Under the Model Coordination Method, the optimization of an engineering system is divided into two levels. In the first level, each component is analysed and optimized independently. This is done through separation of variables into two groups of local and coordinating variables. At the second level, the coordinating variables are determined so that the interaction between the components provides an optimal performance of the system. This study focuses o

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Lei, Paul M. Jones, Alexei G. Merzlikine, and Yiao-Tee Hsia. "Effect of Molecular Weight (MW) and End-Groups on the Thermal and Lewis-Acid Catalyzed Decomposition of Fomblin Z-Type Lubricants." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-63823.

Full text

Abstract:

The high-temperature stability of disk lubricants has attracted a lot of interest in recent years because smaller head-media spacing may cause head-media contact and thus a local temperature rise. At elevated temperatures, the lubricant may either evaporate or decompose, leading to the eventual failure of the head-media interface. The decomposition might result from heating and/or may be catalyzed by the presence of a Lewis acid site at the head-disk interface (HDI). In this paper, we study how the chemical structure, namely, molecular weight (MW) and end-groups (see Fig. 1), of disk lubricant

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Decomposition of Groups"

1

Saraivanov, Michael. Quantum Circuit Synthesis using Group Decomposition and Hilbert Spaces. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.1108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Weinberg, W. H. (The activation and decomposition of alkanes on group VIII transition metal surfaces: Dynamics, kinetics and spectroscopy). Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/5730531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Weinberg, W. H. [The activation and decomposition of alkanes on group VIII transition metal surfaces: Dynamics, kinetics and spectroscopy]. Progress report. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/10128607.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!