Group Theory: New Applications
https://www.maplesoft.com/applications/category.aspx?cid=142
en-us2019 Maplesoft, A Division of Waterloo Maple Inc.Maplesoft Document SystemSat, 20 Apr 2019 10:40:07 GMTSat, 20 Apr 2019 10:40:07 GMTNew applications in the Group Theory categoryhttps://www.maplesoft.com/images/Application_center_hp.jpgGroup Theory: New Applications
https://www.maplesoft.com/applications/category.aspx?cid=142
Mathematics for Chemistry
https://www.maplesoft.com/applications/view.aspx?SID=154267&ref=Feed
This interactive electronic textbook in the form of Maple worksheets comprises two parts.
<BR><BR>
Part I, mathematics for chemistry, is supposed to cover all mathematics that an instructor of chemistry might hope and expect that his students would learn, understand and be able to apply as a result of sufficient courses typically, but not exclusively, presented in departments of mathematics. Its nine chapters include (0) a summary and illustration of useful Maple commands, (1) arithmetic, algebra and elementary functions, (2) plotting, descriptive geometry, trigonometry, series, complex functions, (3) differential calculus of one variable, (4) integral calculus of one variable, (5) multivariate calculus, (6) linear algebra including matrix, vector, eigenvector, vector calculus, tensor, spreadsheet, (7) differential and integral equations, and (8) probability, distribution, treatment of laboratory data, linear and non-linear regression and optimization.
<BR><BR>
Part II presents mathematical topics typically taught within chemistry courses, including (9) chemical equilibrium, (10) group theory, (11) graph theory, (12a) introduction to quantum mechanics and quantum chemistry, (14) applications of Fourier transforms in chemistry including electron diffraction, x-ray diffraction, microwave spectra, infrared and Raman spectra and nuclear-magnetic-resonance spectra, and (18) dielectric and magnetic properties of chemical matter.
<BR><BR>
Other chapters are in preparation and will be released in due course.
<BR><BR>
Last updated on March 19, 2019<img src="https://www.maplesoft.com/view.aspx?si=154267/molecule.PNG" alt="Mathematics for Chemistry" style="max-width: 25%;" align="left"/>This interactive electronic textbook in the form of Maple worksheets comprises two parts.
<BR><BR>
Part I, mathematics for chemistry, is supposed to cover all mathematics that an instructor of chemistry might hope and expect that his students would learn, understand and be able to apply as a result of sufficient courses typically, but not exclusively, presented in departments of mathematics. Its nine chapters include (0) a summary and illustration of useful Maple commands, (1) arithmetic, algebra and elementary functions, (2) plotting, descriptive geometry, trigonometry, series, complex functions, (3) differential calculus of one variable, (4) integral calculus of one variable, (5) multivariate calculus, (6) linear algebra including matrix, vector, eigenvector, vector calculus, tensor, spreadsheet, (7) differential and integral equations, and (8) probability, distribution, treatment of laboratory data, linear and non-linear regression and optimization.
<BR><BR>
Part II presents mathematical topics typically taught within chemistry courses, including (9) chemical equilibrium, (10) group theory, (11) graph theory, (12a) introduction to quantum mechanics and quantum chemistry, (14) applications of Fourier transforms in chemistry including electron diffraction, x-ray diffraction, microwave spectra, infrared and Raman spectra and nuclear-magnetic-resonance spectra, and (18) dielectric and magnetic properties of chemical matter.
<BR><BR>
Other chapters are in preparation and will be released in due course.
<BR><BR>
Last updated on March 19, 2019https://www.maplesoft.com/applications/view.aspx?SID=154267&ref=FeedTue, 30 May 2017 04:00:00 ZProf. John OgilvieProf. John OgilvieTips and Techniques: Working with Finitely Presented Groups in Maple
https://www.maplesoft.com/applications/view.aspx?SID=153852&ref=Feed
This Tips and Techniques article introduces Maple's facilities for working with finitely presented groups. A finitely presented group is a group defined by means of a finite number of generators, and a finite number of defining relations. It is one of the principal ways in which a group may be represented on the computer, and is virtually the only representation that effectively allows us to compute with many infinite groups.<img src="https://www.maplesoft.com/view.aspx?si=153852/thumb.jpg" alt="Tips and Techniques: Working with Finitely Presented Groups in Maple" style="max-width: 25%;" align="left"/>This Tips and Techniques article introduces Maple's facilities for working with finitely presented groups. A finitely presented group is a group defined by means of a finite number of generators, and a finite number of defining relations. It is one of the principal ways in which a group may be represented on the computer, and is virtually the only representation that effectively allows us to compute with many infinite groups.https://www.maplesoft.com/applications/view.aspx?SID=153852&ref=FeedTue, 25 Aug 2015 04:00:00 ZMaplesoftMaplesoftSymmetry of two-dimensional hybrid metal-dielectric photonic crystal within MAPLE
https://www.maplesoft.com/applications/view.aspx?SID=151383&ref=Feed
<p>Hybrid structures were made by assembling monolayers (MLs) of closely packed colloidal microspheres on a metal-coated glass substrate . In fact, this architecture is one of several realizations of hybrid plasmonic-photonic crystals (PHs), which differ in photonic crystals dimensionality and metal ﬁlm corrugation [1,2].</p>
<p>The main challenge to us were exploring of those properties of structures which are caused by their space symmetry. In particular, it was necessary to establish the so-called "rules of selection", i.e. the list of the allowed transitions between electronic states of different symmetry and energy that can be induced by light of varying polarization. Additional interest for us was to demonstrate the possibilities of MAPLE within this specific field.</p><img src="https://www.maplesoft.com/view.aspx?si=151383/440fb9a2994e797b26c18564d860131b.gif" alt="Symmetry of two-dimensional hybrid metal-dielectric photonic crystal within MAPLE" style="max-width: 25%;" align="left"/><p>Hybrid structures were made by assembling monolayers (MLs) of closely packed colloidal microspheres on a metal-coated glass substrate . In fact, this architecture is one of several realizations of hybrid plasmonic-photonic crystals (PHs), which differ in photonic crystals dimensionality and metal ﬁlm corrugation [1,2].</p>
<p>The main challenge to us were exploring of those properties of structures which are caused by their space symmetry. In particular, it was necessary to establish the so-called "rules of selection", i.e. the list of the allowed transitions between electronic states of different symmetry and energy that can be induced by light of varying polarization. Additional interest for us was to demonstrate the possibilities of MAPLE within this specific field.</p>https://www.maplesoft.com/applications/view.aspx?SID=151383&ref=FeedThu, 05 Sep 2013 04:00:00 ZOlga V. DvornikOlga V. DvornikVisualizing a Parallel Field in a Curved Manifold
https://www.maplesoft.com/applications/view.aspx?SID=35113&ref=Feed
<p>My PhD thesis was in relativistic cosmology, a study that took me into differential geometry, continuous group theory, and tensor calculus. One of the most difficult concepts in all this was the notion of parallel transport of a vector from one tangent space to another. Of course, the image I had in my head was a basketball for a manifold, and a vector in a tangent plane on this (unit) sphere. The manifold sat in an enveloping R<sup>3</sup>, and I struggled mightily to visualize the difference between the transported field appearing parallel to the surface observer and Euclidean parallelism as seen by an external observer. The Kantian imperative is true - it's natural to imagine the vectors in R<sup>3</sup>, but devilishly difficult to visualize the difference between Euclidean parallelism and parallel transport in an intrinsically curved space.</p><img src="https://www.maplesoft.com/view.aspx?si=35113/thumb.jpg" alt="Visualizing a Parallel Field in a Curved Manifold" style="max-width: 25%;" align="left"/><p>My PhD thesis was in relativistic cosmology, a study that took me into differential geometry, continuous group theory, and tensor calculus. One of the most difficult concepts in all this was the notion of parallel transport of a vector from one tangent space to another. Of course, the image I had in my head was a basketball for a manifold, and a vector in a tangent plane on this (unit) sphere. The manifold sat in an enveloping R<sup>3</sup>, and I struggled mightily to visualize the difference between the transported field appearing parallel to the surface observer and Euclidean parallelism as seen by an external observer. The Kantian imperative is true - it's natural to imagine the vectors in R<sup>3</sup>, but devilishly difficult to visualize the difference between Euclidean parallelism and parallel transport in an intrinsically curved space.</p>https://www.maplesoft.com/applications/view.aspx?SID=35113&ref=FeedThu, 28 Jan 2010 05:00:00 ZDr. Robert LopezDr. Robert LopezTinygroups
https://www.maplesoft.com/applications/view.aspx?SID=6566&ref=Feed
The tinygroups package can be used to access basic information about small algebraic groups in Maple. It is a Maple version of the basic information of the "smallgroups" package for the GAP computer algebra system. Whereas the "smallgroups" package provides for groups up to size 2000, the tinygroups package only provides for groups up to size 60.
To install the package, download the file "tinygroups.m" into your Maple library directory.<img src="https://www.maplesoft.com/view.aspx?si=6566//applications/images/app_image_blank_lg.jpg" alt="Tinygroups" style="max-width: 25%;" align="left"/>The tinygroups package can be used to access basic information about small algebraic groups in Maple. It is a Maple version of the basic information of the "smallgroups" package for the GAP computer algebra system. Whereas the "smallgroups" package provides for groups up to size 2000, the tinygroups package only provides for groups up to size 60.
To install the package, download the file "tinygroups.m" into your Maple library directory.https://www.maplesoft.com/applications/view.aspx?SID=6566&ref=FeedFri, 22 Aug 2008 00:00:00 ZDavid PritchardDavid PritchardInterface to the QaoS databases of algebraic objects
https://www.maplesoft.com/applications/view.aspx?SID=1668&ref=Feed
<p>The Maple package QaoS contains procedures for querying the QaoS databases for algebraic objects in Berlin. Currently a database of all transitive groups up to degree 30 and a database of more than a million number fields of degree up to 9 are available. There are procedures for accessing invariants of the query results. The results of a query can then be used in Maple.</p><img src="https://www.maplesoft.com/view.aspx?si=1668/Command line.JPG" alt="Interface to the QaoS databases of algebraic objects" style="max-width: 25%;" align="left"/><p>The Maple package QaoS contains procedures for querying the QaoS databases for algebraic objects in Berlin. Currently a database of all transitive groups up to degree 30 and a database of more than a million number fields of degree up to 9 are available. There are procedures for accessing invariants of the query results. The results of a query can then be used in Maple.</p>https://www.maplesoft.com/applications/view.aspx?SID=1668&ref=FeedThu, 29 Sep 2005 00:00:00 ZSebastian PauliSebastian PauliThe Application of Quasigroup Fields in Designing Efficient Hash Functions
https://www.maplesoft.com/applications/view.aspx?SID=4435&ref=Feed
Two eminent specialists on quasigroups, Dénes and Keedwell, onced augured the advent of a new era in cryptology, consisting in the application of non-associative algebraic systems. Nevertheless, at present, very few researchers use these tools and in many cases it seems unreasonable and reckless. For example, constructing one-way functions, algorithms are usually designed, in which computations are performed using regular algebraic systems as groups, rings and fields, simple boolean operations, modular arithmetic, and cyclic permutations. Such an approach may simplify cryptanalysis. However, computations of the value of cryptographic one-way function should be easy, but taking into account the security, an algorithm describing the hash function should involve rather an algebraic system, which is strongly recalcitrant, and the behaviour of which is unforeseeable. A quasigroup field, as an algebraic system, has such favorable properties. Thus quasigroup fields can be easily applied in designing both unkeyed and keyed hash functions, iterated or not-iterated as well, that is why in this contribution it will be shown how to do it.<img src="https://www.maplesoft.com/view.aspx?si=4435/1237.jpg" alt="The Application of Quasigroup Fields in Designing Efficient Hash Functions" style="max-width: 25%;" align="left"/>Two eminent specialists on quasigroups, Dénes and Keedwell, onced augured the advent of a new era in cryptology, consisting in the application of non-associative algebraic systems. Nevertheless, at present, very few researchers use these tools and in many cases it seems unreasonable and reckless. For example, constructing one-way functions, algorithms are usually designed, in which computations are performed using regular algebraic systems as groups, rings and fields, simple boolean operations, modular arithmetic, and cyclic permutations. Such an approach may simplify cryptanalysis. However, computations of the value of cryptographic one-way function should be easy, but taking into account the security, an algorithm describing the hash function should involve rather an algebraic system, which is strongly recalcitrant, and the behaviour of which is unforeseeable. A quasigroup field, as an algebraic system, has such favorable properties. Thus quasigroup fields can be easily applied in designing both unkeyed and keyed hash functions, iterated or not-iterated as well, that is why in this contribution it will be shown how to do it.https://www.maplesoft.com/applications/view.aspx?SID=4435&ref=FeedTue, 04 Nov 2003 14:27:14 ZProf. Czeslaw KoscielnyProf. Czeslaw KoscielnySubgroup lattice plotting in 3-D
https://www.maplesoft.com/applications/view.aspx?SID=3907&ref=Feed
This routine is intended to show how one can program one's own plotting routines using the PLOT3D structure in Maple. The example we have chosen is to plot a subgroup lattice in 3-dimensions. But this code can serve as an example for how to plot an arbitrary graph G = V,E
<img src="https://www.maplesoft.com/view.aspx?si=3907//applications/images/app_image_blank_lg.jpg" alt="Subgroup lattice plotting in 3-D" style="max-width: 25%;" align="left"/>This routine is intended to show how one can program one's own plotting routines using the PLOT3D structure in Maple. The example we have chosen is to plot a subgroup lattice in 3-dimensions. But this code can serve as an example for how to plot an arbitrary graph G = V,E
https://www.maplesoft.com/applications/view.aspx?SID=3907&ref=FeedWed, 20 Jun 2001 00:00:00 ZMichael MonaganMichael MonaganElliptic group procedures
https://www.maplesoft.com/applications/view.aspx?SID=3541&ref=Feed
This worksheet covers the procedures for computing the order of certain EC groups, and of points in such groups. It also covers the Hellman-Pohlig-Silver discrete logarithm algorithm for elliptic curve groups with an example. <img src="https://www.maplesoft.com/view.aspx?si=3541//applications/images/app_image_blank_lg.jpg" alt="Elliptic group procedures " style="max-width: 25%;" align="left"/>This worksheet covers the procedures for computing the order of certain EC groups, and of points in such groups. It also covers the Hellman-Pohlig-Silver discrete logarithm algorithm for elliptic curve groups with an example. https://www.maplesoft.com/applications/view.aspx?SID=3541&ref=FeedMon, 18 Jun 2001 00:00:00 ZMarion SheepersMarion SheepersGroup theory via Rubiks Cube
https://www.maplesoft.com/applications/view.aspx?SID=3449&ref=Feed
An application of Maple's group package to answering various questions about the small Rubik's cube. Maple has a group theory package that can be used to generate and manipulate finite groups. Do you remember the pocket Rubik's cube? If you don't, it's a Rubik's cube with only two smaller cubes on each edge. We can represent the permutation group generated by the three cube twist on the coloured stickers as follows. Maple uses a permutation notation to represent groups. Each list of lists on the next command line is a permutation, with each sublist a cycle. The group is generated by these 3 permutations on 21 elements.
<img src="https://www.maplesoft.com/view.aspx?si=3449//applications/images/app_image_blank_lg.jpg" alt="Group theory via Rubiks Cube" style="max-width: 25%;" align="left"/>An application of Maple's group package to answering various questions about the small Rubik's cube. Maple has a group theory package that can be used to generate and manipulate finite groups. Do you remember the pocket Rubik's cube? If you don't, it's a Rubik's cube with only two smaller cubes on each edge. We can represent the permutation group generated by the three cube twist on the coloured stickers as follows. Maple uses a permutation notation to represent groups. Each list of lists on the next command line is a permutation, with each sublist a cycle. The group is generated by these 3 permutations on 21 elements.
https://www.maplesoft.com/applications/view.aspx?SID=3449&ref=FeedMon, 18 Jun 2001 00:00:00 ZMaplesoftMaplesoft