Give me excess of it;” William Shakespeare, Twelfth Night, or What you Will: Act 1, Scene 1, 1–3.
“Music is a secret exercise in arithmetic of the soul, unaware of its act of counting.” Gottfried Leibniz
1. Introduction
Ever since the time of Pythagoras, scientists, philosophers, and mathematicians have been intrigued by the intimate connection between music and mathematics [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27]. This connection is becoming even more relevant today with a rising interest in artificial intelligence, especially as it pertains to pattern recognition, similarity measures, sound and image perceptions, big data, machine learning, neural networks, and so on [
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
42,
43]. The Greek mathematician and philosopher Pythagoras was one of the ancient explorers of the relationship between music and mathematics with the formulation of the diatonic scale system. Although originally these musical notes corresponded to the major diatonic scale comprising the white keys of a piano, the renaissance period witnessed an important metamorphosis made possible by the groundbreaking works of Gioseffo Zarlino and Heinrich Glarean that culminated into the foundations of modern western music theory [
44,
45,
46] of 12-tone system. Zarlino of the renaissance period is credited to have recognized the 12 equal divisions within an octave as opposed to 8, resulting in the metamorphosis from the Pythagorean (6th Century BC: white keys of the piano) to the Zarlino (16th Century CE: 12-tone) scales [
44,
45]. Heinrich Glarean’s [
44] classic 1547 work
Dodekachordon (12-stringed instrument) proposed the existence of 12 modes and not the 8 that was assumed earlier. Consequently, the Aeolian modes (9,10) and Ionian modes (11,12) emerged, where the Aeolian mode corresponds to the natural minor, also known as Natabhairavi in south Indian music and Asaveri Thaat in north Indian music systems. Glarean’s
Dodekachordon was inspired by the connection between the faces of a dodecahedron (See
Figure 1) and musical notes through the introduction of five additional transposed notes (five black keys within an octave of a piano), including the B
b note. As seen in
Figure 1, the dualist of the dodecahedron is the icosahedron, when 12 pentagonal faces of the dodecahedron are mapped into the vertices of the icosahedron. They both belong to the icosahedral point group, I
h, containing 120 symmetry operations. The 12 vertices of the icosahedron form 3 mutually orthogonal golden rectangular planes, as shown in
Figure 1 (Bottom Right). The golden ratio and its inverse that appear in the character values of the T
1,2(g,u) representations of the I
h group provide further insights into the symmetry properties of the 12-tone chromatic scale. Consequently, we have the modern 12-tone chromatic scale system that includes both black and white keys on the piano within an octave. The relationship between an octave and the periodic table of elements in chemistry is well recognized by the formulation of the “Law of Octaves” by Newlands in 1865. The connection between combinatorics and group theory to the periodic table of elements continues to be a topic of several recent studies [
47,
48,
49,
50,
51,
52,
53,
54,
55,
56].
A number of concepts of combinatorics and symmetry find applications in music theory. The Greek etymology of symmetry suggests that the word originated from the Greek word Συμμετρία (symmetria), which means balance, harmony, proportion, cycle, rhythm, and so on. The octave itself refers to a cycle of 8 where the frequencies of the first and 8th notes are double of each other. Consequently, the integer modulo group Zn = {0, 1, 2, …, n − 1} where n = 7, is a symmetry representation of the major notes (white keys) in an octave where if 0 is mapped to C, then n − 1 becomes B natural, and other notes are mapped sequentially in increasing order of pitch. The advent of the 12-tone chromatic scale is an attempt to find symmetry between melody and harmony, where harmony originates from simultaneous notes played in a rational frequency relation, while melody originates from the transposition of notes (or through invoking black keys in relation to the white keys). We would not have several scales evoking emotion, romance, or pathos, such as the harmonic minor, Dorian scale, Hungarian minor, natural minor, etc., without the 12-tone chromatic scale.
Combinatorics is an arm of discrete mathematics that deals with the enumeration, construction, and classification of configurations with a specified set of constraints. The current author [
24] has previously explored the connection between combinatorics and south Indian music theory through the enumeration and construction of non-kinky musical scales arising from the 12-tone chromatic scale with certain constraints that eliminate the occurrence of notes with the same frequency but different names within the 12-tone polyphonic music system. The concept of various types of symmetries of musical scales, including chiral scales, is explored in the present article. Such combinatorial techniques facilitate the enumeration and construction of big data of musical patterns, which can further be explored with machine learning, neural networks, and artificial intelligence. Combinatorics also finds applications in the formulations and solutions of problems in western music theory, such as Babbitt’s partition problems within the 12-tone musical compositions [
12,
13,
14,
15,
16,
17,
18], one of which asks for an algorithm to enumerate all mxm matrices with entries drawn from the set {1, 2, …, n} such that all rows and columns have the sum n. There are other variations to Babbitt’s partitions. These problems of musical theory bear a direct relation to combinatorial Latin squares, magic squares, Hadamard matrices, and balanced block designs, which we discuss in this review. One of the oldest combinatorial problems pertinent to balanced designs dates back to 587 CE, as described in the treatise of
Brhat Samhita by Varahamihira; the problem seeks to construct a combinatorial symmetric design to create a perfume by mixing four substances selected from sixteen different fragrant chemicals using a magic square. Perhaps this is an early demonstration of the use of Hadamard transforms in analytical chemistry. Moreover, as illustrated in this review, the Chautisa yantra on the wall of the 12th Century Parshvanath temple in Khajuraho, India, is a quintessential element of a combinatorial balanced design.
Although spectroscopy is a branch of science that explores the interaction of molecules with electromagnetic radiation, the various spectroscopic signatures of a given molecule bear a direct relationship to the symmetry of the molecule, and consequently, to group theory, representation theory of groups, nonrigid molecular symmetries, combinatorics, and recently, artificial intelligence, as it pertains to molecules [
57,
58,
59,
60,
61,
62,
63,
64,
65,
66,
67,
68,
69,
70,
71,
72,
73,
74,
75,
76,
77,
78]. Several spectroscopic concepts such as frequencies, intensities, blue shift, red shift, signatures, fast Fourier transform, Hadamard transform [
79,
80,
81], harmonics, quantization of energy levels, and so on have applications to music theory, as we show in this review. We explore the combinatorial connections to spectroscopic patterns of molecules such as the Electron Spin Resonance (ESR) spectral patterns, multiple quantum Nuclear Magnetic Resonance (MQ-NMR) spectroscopic patterns, and vibrational spectra with applications to giant fullerenes up to C
150,000 golden-dome fullerene. The review article also attempts to integrate these spectroscopic concepts into music theory through combinatorics and related algebraic concepts, including group theory, combinatorics, and graph theory. All of these interplays of concepts facilitate explorations on the role of artificial intelligence in music theory and music similarity measures.
Pattern recognition plays a vital role in music, as a trained music listener often tries to identify certain patterns or a specific sequence of notes/phrases that occur in a musical composition giving rise to the recognition of the scale or raga. There are recognizable patterns or characteristic features in a musical rendering of a composition which can then form a basis of pattern recognition or machine learning by embedding phrases. This concept has been demonstrated in western music systems by a number of authors, including Longuet-Higgins [
28,
29,
30,
31,
32,
33], who is eminently credited with the formulation of the symmetry groups of nonrigid molecules [
81] as permutation-inversion groups and the symmetry theory of Jahn-Teller distortion in molecules [
82]. A number of authors have explored the connection between India’s two celebrated schools of music, well known as the Hindustani and Carnatic music schools. Machine learning through embedding techniques has been employed to identify similarity measures [
35,
36,
37,
38,
39,
40,
41,
42,
43] in musical compositions of the east. Such measures, including the machine perception of continuous glides from one note to the other, called the meend or jaaru, and other vibrato patterns, called the gamakas or andolams, in eastern music systems can be made possible through machine learning of compositions. Similarity measures play a critical role in many other fields such as drug discovery [
83,
84,
85,
86], quantum similarity measures [
55,
85], molecular similarity measures [
86], electronic holographic measures [
87], quantitative shape similarity measures [
88,
89], topological measures [
90,
91], predictive toxicology [
91], ornithology [
92], neuroscience [
93,
94,
95], and so on.
The central objective of this review is to bring together the various disciplines mentioned above to point out the similarities and how such cross-fertilizations can be symbiotic in promoting interdisciplinary research that synthesizes concepts from combinatorics, group theory, spectroscopy, music theory, and artificial intelligence. Such interdisciplinary developments in the future are extremely important and necessary in order to develop machine learning and artificial intelligence techniques for the machine perception of patterns in various disciplines. The review is organized by first outlining the connections of symmetry, combinatorics, and music theory and, subsequently, their roles in different spectroscopies. We also outline combinatorial techniques such as the Möbius inversion technique, inclusion–exclusion, Sheehan’s version of Pólya’s theorem generalized to all irreducible representations, Hadamard matrices, Latin squares, magic squares, etc., elucidating their varied roles in different disciplines.
2. Combinatorics, Symmetry, Musical Scales and Patterns
We start with the basic definitions of the notes comprising the 12-tone chromatic scale in different systems of music.
Table 1 shows the naming conventions of the 12 notes within an octave in the western music system, mathematical, north Indian, and south Indian music schools. We note that some of the music systems are polyphonic; that is, the note with the same frequency is assigned multiple names. The advantage is that certain combinations of notes close in frequency become allowed under the polyphonic convention while they would be forbidden in a monophonic system. As shown in
Table 1, each of the combinations, R
2 and G
1, R
3 and G
2, D
2 and N
1, D
3 and N
2, is equivalent in the 12-tone chromatic scale. By assigning different names for the same frequency notes, combinations such as R
1 and G
1 and D
1 and N
1 in a scale become allowed, while in a monophonic system, these combinations are forbidden. Consequently, a polyphonic system provides for a greater number of combinations of scales compared to the monophonic music system.
Figure 1 shows the 12-tone chromatic wheel constituted by the frequencies of the 12 notes and the 12 pentagonal faces of a dodecahedron shown adjacent to the wheel. The twelve equal pieces of the pie chart correspond to the relative proportion of the frequencies of the adjacent notes in the scale as derived from the expression:
where F
0 is the base frequency determined by the tuning frequency. Although the symmetry relation among the notes dictates a relative ratio, and hence F
0 can, in principle, be set to any frequency, as done in the two major schools of Indian music system either with a tanpura or a shruti box, most modern pianos are tuned by setting the frequency of the A note above C of the middle octave, denoted as A
4 set to 440 Hz. Once this is set, the frequencies of all notes are determined by expression (1) in an absolute manner. As the symmetric relation among the notes is determined by a relative proportion including the harmony of notes, we show in
Table 2 that with A
4 set to 440 Hz, the next C is at ~523 Hz. Hence the ratio of the two frequencies is 1.189 or more exactly 1.189207 as per Equation (1). Consequently, if the frequency of the static note C is set to 1, then all frequency ratios (pitch) in the 12-tone chromatic scale are obtained by Equation (1), and they are shown in both
Table 2 and
Figure 1. The ratios of frequencies of all successive notes in the 12-tone scale are all the same and equal to 2
(1/12) = 1.059463. Consequently, while the frequency of a note is absolute once the tuning is set, the pitch is relative. We use this concept of frequency ratios in describing the various music scales and in determining both melody and harmony symmetric relations in the various music systems.
Table 2 shows two less common musical scales in the western musical system. The second of the two scales, called the harmonic double major or the Bhairav Thaat or Mayamalavgowla, is the most basic scale employed in the first music lesson in the music systems of India. The scale is also well known in the Arabic or Byzantine musical systems. The use of F
# (M
2) in the Hungarian minor scale, which bears a
frequency relation to the static C (S), together with the notes G
2 and D
1 in relation to the other notes in the scale, evokes melodies of passionate emotions, while at the same time, lending a symmetric harmony; the relative spacing of the notes provides for a combinatorial balance that evokes pathos. Although the scale is common in the Hungarian gypsy and Spanish musical systems, it is less common in classical western music. When F
# is changed to F in the Hungarian minor scale, it becomes the celebrated harmonic minor scale which is common in the western and Spanish music systems, and it is also extensively employed in Bollywood and other music systems of Indian cinema. To illustrate, the relative frequency graphs of three scales are displayed in
Figure 2, while the radial symmetry of four scales is demonstrated in
Figure 3. Note that the third scale in
Figure 2 and
Figure 3 is the Dorian scale, which is extensively used, not only in all Indian schools of music but also in ancient Greek, medieval, and modern jazz. Moreover, a number of pop music compositions such as “Eleanor Rigby” by the Beatles and “The Night The Lights Went Out In Georgia” by Vicki Lawrence are set to the Dorian scale, although in “Eleanor Rigby”, there is a progression into the natural minor. When the Dorian mode is divided into tetrachords, it forms a symmetrical tetrachord, as seen in
Figure 2. For this reason, the Dorian mode gives rise to numerous offspring scales (janya ragas) in both south Indian (Kharaharapriya) and in the north Indian music system, where the Dorian mode becomes the Kaafi Thaat. Evidently, the symmetrical spacing of notes provides for both optimal melody, harmony, and gamakas in all dynamical notes of Kharaharapriya, and consequently, several offspring scales and compositions arise from the scale.
Although harmony is created when notes with certain rational frequency ratios are played simultaneously so as to avoid beats, the irrational number π presents an interesting case study for music compositions. First, the circular symmetry of π itself arises from the ratio of the circumference of a circle to its diameter. Consequently, the digits of π, which do not form any recognizable pattern or sequence, have been of interest in exploring the role of circular or spherical symmetry of music. As outlined in the review article of Maruani et al. [
8], the digits of π have been used in creating western music compositions. Here we exemplify yet another computer-generated music composition derived from the digits of π.
Table 3 shows the first 2048 digits of π, which were converted to integer modulo 7 in order to create a musical composition. The present author created a composition from the digits of π entitled “The soul of π” by mapping 0 to N
3 (B Natural) and the remaining integers 1 through 6 sequentially from S (C) to D
1 (A flat) and thus setting it to the Hungarian minor scale (see the piano keys at the top of
Table 4). All 2048 digits of π were fed into a computer and converted to integer modulo 7 arithmetic, Z
7 = {0,1,2,3,4,5,6} in order to create the composition shown in
Table 4. As we employ integer mod 7 arithmetic, the generated musical composition does not depend on the representations of π in various number systems. Although the notes in
Table 4 that are set to the Hungarian minor scale are derived from the digits of π and are grouped into columns of octets, they can be partitioned into other groups readily. For example, there are more complex rhythmic cycles in the south Indian music system, such as misra or sankeerna chapu, which mean a partition of integer 7 and 9, respectively. Once the rhythmic cycle pattern is chosen, this information can be fed to the computer to generate completely different groups of notes of π for the chosen rhythmic cycle. A principal reason the notes are shown in groups of octets is that it is the most common rhythmic cycle in many musical systems, set in cycles of lengths 8 and 16. Such rhythmic cycles again take the cyclic group patterns either in 8 beats/s or 16 beats/s. Moreover, different speeds such as vilambit (slow; north Indian system), Madhya (medium), drut (fast), or adi-drut (very fast) can be readily created by splitting or coalescing the columns in
Table 4 to fit into one of the tempos. The symmetric and melodic nature of the Hungarian minor scale readily lends itself to harmony by choosing notes in rational symmetric proportions for a perfect harmony without creating beats. The digits of π can be readily set to other melodic scales such as the harmonic minor, Dorian, or natural minor by replacing some of the notes in the composition in
Table 4.
3. Combinatorial Techniques
3.1. The Principle of Inclusion & Exclusion with Applications to the Enumeration of Music Scales
The principle of inclusion and exclusion [
96,
97] is a combinatorial technique that seeks to enumerate configurations with constraints or enumerations of configurations when certain combinations are forbidden. This becomes especially relevant in music theory in the context of the enumeration of musical scales, as shown by the author [
24]. There are several combinatorial problems such as the problem of derangement, the
problem of ménage, the hat-check problem,
problème des rencontres, and so on that require the inclusion–exclusion technique. We briefly outline the technique, also known as the sieve formula, with applications to the enumeration of ragas of the south Indian school of music.
Suppose {P
1, P
2, P
3, … P
n} is a set of constraints arising from the grammar of music theory. A generating function F for the enumeration with the constraints such that none of P
1, P
2, P
3, … P
n is satisfied can be obtained from the sieve formula shown below:
where f(i) denotes the generating function or a number that satisfies exactly i of the properties chosen from the set {P
1, P
2, P
3, … P
n}. The set of constraints {P
1, P
2, P
3, … P
n} varies with the application, and for music scale enumeration, constraints would be simply the forbidden combinations. For example, P
1 is the combination of the notes R
2 and G
1, which are equivalent and hence forbidden. Likewise, P
2 would be the combination R
3 and G
2, P
3 corresponds to R
3 and G
1, P
4: D
2 and N
1, P
5: D
3 and N
2, and P
6: D
3 and N
1. Some of these combinations, such as P3 and P6, are equivalent by symmetry, and thus they are not allowed to avoid duplicate counting in the polyphonic system of music.
We obtain the values for f(0), f(1), f(2)… for the enumeration of symmetrical heptatonic-heptatonic or complete symmetrical scales, also called the melakarta or creator ragas, as follows:
Consequently, we have the result:
Table 5 shows all of the 72 symmetrical heptatonic-heptatonic scales comprising notes chosen from the 12-tone chromatic scale divided into groups of 6, called a chakra, as done in the south Indian music system.
Table 5 exhaustively covers all of the possible symmetrical heptatonic scales. The common scales of the western classical music system are already included in
Table 5; for example, scale no 8 is the Phrygian mode (Hindustani: Bhairavi Thaat), 9 is the Neapolitan minor, the 10th is Cappadocian or the second mode of the jazz minor, the 11th is the Neapolitan major, the 14th is the Phrygian dominant, the 15th is the double harmonic major, 20 is the natural minor, 21 is the harmonic minor, 22 is the Dorian mode, 23 is the melodic minor, 26 is the Aeolian dominant, 27 is the harmonic major, 28 is the mixolydian mode, and 29 is the major scale or the Ionian mode (all white keys of the piano), and so on. The less common scales with F
#, such as the Hungarian minor, can be readily seen in
Table 5 as scale no 57, the 58th is the Ukrainian Dorian scale, the 64th is the acoustic scale, 65 is the Lydian mode, etc.
The above enumeration scheme can be generalized to scales of other lengths such as the pentatonic, hexatonic, and those that are symmetrical as well as asymmetrical. Such a general enumeration follows Pólya’s terminology of a pattern inventory. Each such non-kinky (non vakra) scale is characterized by a sequence of notes with an increasing frequency culminating into the next octave C, and then a sequence of notes with a decreasing frequency called the descent ending in the starting C. The enumerations of different types of such scales could be of the types pentatonic-pentatonic, pentatonic-hexatonic, pentatonic-heptatonic, and inversions of those, etc. Such an exhaustive combinatorial enumeration was carried out by the author [
24] using combinatorial generating functions. This is accomplished by constructing two independent generating functions for the ascent and descent and multiplying them to construct a complete pattern inventory of ragas of any length. While we demonstrated the enumeration scheme for the complete heptatonic-heptatonic symmetrical scales, a more general combinatorial technique was developed for other scales. To illustrate, a hexatonic pattern such as S G M P D N Ŝ can be mathematically denoted as
R since the sequence is missing R relative to the complete scale. Consequently, the six hexatonic Pólya patterns are characterized by
R,
G,
M,
P,
D, and
N. Note that S (C) cannot be missing from a raga, as it forms the base (C). The combinatorial principle of inclusion–exclusion outlined earlier was iterated to arrive at the hexatonic generating function as:
In the above combinatorial enumeration scheme, the equivalent combinations have been eliminated by the principle of inclusion–exclusion, and hence all allowed combinations have been included. We can also obtain the total number of hexatonic ascents by substituting
R =
G =
M =
P =
D =
N = 1 in the above expression, thus generating 204 hexatonic ascents, which corresponds to the number of symmetric hexatonic-hexatonic scales. Likewise, the pentatonic scales are constructed by identifying two missing notes relative to the complete scales, and thus in mathematical notation, they are enumerated by the binomial terms shown below:
Analogous to the hexatonic enumeration, by replacing all binomials by 1 in the above expression, we obtain the total number of pentatonic symmetric scales as 236. Although tetratonic (tetrachord) scales are rare, we enumerate these for completeness. They can find application in the computer-aided synthesis of musical tetrachords, for which the tetratonic GF is given by:
In the above enumeration scheme, only nonequivalent combinations are considered. Consequently, the total number of tetrachords is generated by replacing all trinomials in Ta by 1, which is seen to be 142.
The trichords or sequences of three notes, one of which is S (C), are enumerated by the expression for Tr
a:
where in the above expression in place complementary notation, the notes themselves are used for the binomials, and hence DN corresponds to the sequence DNS. Hence the total number of trichords is the sum of all coefficients in TR
a, or 54. It can be readily seen that the number of dichords (a sequence of 2 notes), one of which is S (C), is 11 since this corresponds to the number of distinct notes in
Table 1.
All of the above expressions can be combined into a pattern inventory of ragas that we refer to as a raga ascent inventory, RI
a, given as a polynomial in x, where x
n denotes the term for the n-tonic ascent.
where the first term is a trivial null set, the second term corresponds to a single note or just S, the x
2 term represents the number of dichords, x
3: the number of trichords, x
4: number of tetrachords, etc. For a raga to be stable, its scale must have at least a tetrachord, and thus terms with powers more than or equal to four are relevant for the scales of ragas.
The complete musical scale inventory for the descent is given by the generating function RI
d:
where the indeterminate y was introduced to distinguish the descent from the ascent and to allow for the possibility of chiral musical scales (or bhashanka ragas). The total generating function for all of the non-kinky musical scales is given by the product of the ascent and descent inventories:
The coefficient of x
my
n in the generating function RI
a × RI
d enumerates the number of musical scales with m-tonic notes in the ascent and n-tonic notes in the descent. To illustrate, the number of hexatonic-heptatonic scales is given by the coefficient of x
6y
7 which is 14,688. The number of symmetrical tetrachords is the coefficient of x
4 or 142, and, likewise, the total number of all tetratonic scales, including the chiral scales, is the coefficient of x
4y
4 or 20,164. All of the symmetrical scales are enumerated by the terms x
4, x
5, x
6 and x
7 for the tetratonic, pentatonic, hexatonic, and heptatonic scales, respectively.
Table 6 shows the first and last 144 pentatonic scales missing R (or D in western) both in the ascent and descent. Consequently, computer-assisted combinatorial techniques offer considerable promise in many fields, including music.
3.2. Möbius Inversion and Enumerations
Möbius Inversion can be envisaged as a generalization of the inclusion–exclusion principle, where instead of an alternating series, a variable function is introduced. The inversion technique offers a powerful tool for big datasets by way of providing a generating function to obtain the combinatorial enumerations of larger data sets from the corresponding generating functions of a related smaller set. Although originally it was introduced by Möbius in the context of number theory, it offers one of the most powerful transforms using the divisors of the cardinality of a set. It finds extensive applications in big data partially-ordered sets (posets). In combinatorial and number theory areas, Möbius Inversion [
98,
99,
100] provides powerful generating functions for a number of problems, such as the problem of colorings of larger sets using the generating functions of smaller sets, Euler totient function, and the Reiman-zeta function, etc. Although originally, the Möbius inversion was outlined by Weisner and Hall independently for partially ordered sets, Rota [
98] is attributed as the mathematician who popularized the technique for combinatorial enumerations [
99,
100]. We accentuate the importance of the technique in the context of big data, machine learning, and artificial intelligence because the technique provides the combinatorics of large posets in terms of the generating functions for the smaller uses using the divisors of the cardinality of the larger set.
The Möbius inversion was used extensively by the present author [
101,
102,
103,
104] in chemical and spectroscopic enumerations and for the enumeration of equivalence classes for the colorings of the various hyperplanes of an n-dimensional hypercube (nD-cube). Moreover, the colorings of the vertices of the nD-cube have applications in the genetic regulatory network [
105], which is another example of a big data set. Let F(x) and Q(x) be two sets of generating functions where we assume that the set of F(x) functions are known. For an integer p, let the divisors of p be denoted by an integer variable d. The Möbius transform provides a technique to compute the generating function Q for p denoted by Q
p in terms of the known functions F
d associated with ds, the divisors of p. Mathematically, the Möbius transform is cast into the following form:
where the sum is over
all divisors d of p, and
is the Möbius function defined as follows:
μ(m) = 1 if one of m’s prime factors is not a perfect square and m contains even number of prime factors,
μ(m) = −1 if m satisfies the same perfect-square condition as before but m contains odd number of prime factors,
μ(m) = 0 if m has a perfect square as one of its factors.
To illustrate the first 10 Möbius functions are shown below:
Consider the 7D-hypercube as an example, which finds several chemical applications, including the representations for the graphs associated with the water heptamer. The 7D-cube contains seven types of hyperplanes denoted by (7-q)-hyperplanes where q varies from 1 to 7. A 7 × 7 configuration matrix in Coxeter’s notation describes the hyperplanes of the 7D-cube as shown below:
Moreover, the diagonal elements of such a matrix provide for the number of (n-q)-hyperplanes for an nD-hypercube and are given by:
Consequently, as seen from the above matrix, the diagonal elements in the inverted order, that is, q = 7 being the first and q = 1 being the last diagonal element, enumerate the number of hyperplanes. Hence the first row of the above matrix represents the vertices of the 7D-cube, the second row represents the edges, the third row is for square faces, and the last row represents the hexeracts. It can be readily seen that there are 14 hexeracts while there are 672 faces. Likewise, the off-diagonal elements of the matrix shown above, C
ij represents the number of times the hyperplane j occurs in the hyperplane i. To illustrate, C
41 = 8 implies that each cubic cell of the 7D-cube contains 8 vertices. The cardinality of the set of hexeracts is only 14 compared to 672 faces or 448 edges or 128 vertices in the 7D-cube.
Figure 4 shows the connectivity graph for the 128 vertices of the 7D-cube. The automorphism group of the graph in
Figure 4 is the wreath product S
7[S
2] which contains 645,120 permutations.
Consider the problem of enumerating the equivalence classes for the colorings of various hyperplanes of a 7D-cube under the action of the automorphism group with 645,120 operations for all 110 irreducible representations of the 7D-cube. This problem is quite intensive in that it requires the matrix types of 110 conjugacy classes and the character table of the wreath product group S7[S2], which is beyond the scope of the review. Thus we shall simply demonstrate a small piece of the problem that involves the Möbius transform. Suppose we know the polynomials of the cycle types of a given conjugacy class for the hexeracts of the hypercube given by Fds. Then we shall illustrate how Möbius inversion yields the generators for all cycle types of six other hyperplanes of the 7D-cube.
The Möbius transform provides a powerful tool for obtaining the polynomial generating functions for a larger set, such as the faces or edges of the 7D-cube in terms of the polynomials for the much smaller set of hexeracts with cardinality 14. Given that the maximum period for a chosen conjugacy class of the group for the illustrative purpose is 8, the possible F polynomials for all the hyperplanes that need to be considered are F
8, F
4, F
2, and F
1 since divisors of 8 are 1, 2, 4, and 8. Consequently, we show the F
d polynomials obtained from the matrix of the conjugacy class under consideration as:
From the F
d polynomials thus determined, we obtain the Q
p polynomials using the Möbius transform as follows:
The coefficients of xqs are tabulated below for all possible Qp polynomials, thus generating the cycle types for various (7-q)-hyperplanes as shown below:
Application of Möbius Inversion to the cycle type polynomials of 7D-hypercube.
Qp | x | x2 | x3 | x4 | x5 | x6 | x7 |
Q1 | 6 | 12 | 8 | | | | |
Q2 | | | | | | | |
Q4 | | | | | | | |
Q8 | 1 | 9 | 34 | 70 | 84 | 56 | 16 |
Cycle type | 1681 | 11289 | 18834 | 870 | 884 | 856 | 816 |
Hyperplane | q = 1 (hexeracts) | q = 2 (penteracts) | q = 3 (tesseracts) | q = 2 (cubic cells) | q = 5 (square faces) | q = 6 edges | q = 7 vertices |
The Möbius transform illustrated above for a conjugacy class was iterated by the author [
102] using a computer code in order to generate the cycle index polynomials of all hyperplanes for all 110 irreducible representations. As this was extensively considered in a previous article [
102], further details can be obtained from reference [
90]. In the next section, we show how the cycle index polynomials and the characters of various irreducible representations can be used in enumerative combinatorics of big data sets, including giant fullerenes up to C
150,000 in computing their chirality and spectroscopic properties.
3.3. Pólya’s Theory, Euler’s Totient Function, and Their Generalization to All Irreducible Representations of Groups
Pólya’s combinatorial theorem [
68,
100,
107] concerns the enumeration of equivalence classes of configurations under the action of a group. Stimulated by the chemical problem of isomer enumeration and Burnside’s lemma of enumerating different necklaces with a given set of color beads, in 1937, Pólya formulated his enumeration technique, now well known as Pólya‘s theorem [
68,
100,
107]. The present author [
108] generalized this technique and the Harary–Palmer power group enumeration theorem to all IRs of the group under action. Another generalization of related combinatorics considered by the author [
77] is Sheehan’s [
109] version of Pólya’s theorem to all IRs. These generalizations provide powerful combinatorial tools that find applications to multiple quantum NMR, nuclear spin statistics of rovibronic levels, ESR hyperfine structure, enumeration of vibrational modes, and enumeration of stereo and chiral isomers of chemical compounds, giant fullerenes, and carbon nanotubes. We briefly outline the author’s generalization [
77] of Sheehan’s version to all characters that were recently applied to nanotubes [
75].
In order to exemplify the process of character cycle index construction and Euler totient function, we consider a cylindrical nanotube with a square cross-section and of any length n. We note that the vertices of such a tube are partitioned into equivalence classes, and the number of such classes depends on n and the odd/even parity of the tube length. We refer to each cylindrical cross-section of the tube along the vertical axis as a layer. In general, the σ
h plane of the dihedral group D
mh, for a tube with a cross-section C
m for an even m, passes between the two central layers; for an odd n, the σ
h plane of symmetry coincides with the central layer. Hence the layers of a cylindrical tube are partitioned into equivalence classes, and the cardinalities of the equivalence classes vary with n. Consequently, if D is the set of vertices of a nanotube, then D is divided into sets Y
1, Y
2, … Y
n/2 for even n, and Y
1, Y
2, … Y
(n+1)/2 for odd n. For a cross-section of m vertices, the total number of vertices in the set D is mn, and consequently, the equivalence classes of vertices Y
i have the following cardinalities depending on the parity of n:
Thus a vertex coloring is a map from the sets D to R, where R is a set of colors and D is divided into Y-sets as follows:
Sheehan’s version [
109] of Pόlya’s theorem is quite powerful, as it provides for different coloring schemes for the various equivalence classes, and thus even the more general Redfield–Read superposition theorem becomes a special case of this theorem. We have further generalized Sheehan’s version to all characters of the group acting on D, which provides a scheme to delineate the chiral and achiral colorings. We define the generalized character cycle index (GCCI) for the character χ corresponding to the irreducible representation Γ of the G acting on a nanotube as:
In the above expression, the sum is taken over all permutation representations of g ∈ G; cij(g) is the number of j-cycles of g ∈ G contained in the set Yi upon its action on the vertices of the nanotube. The index i varies from 1 to n/2 or (n + 1)/2 for even and odd n, respectively. It can be seen that the second index j is the orbit length contained in the corresponding Yi set generated upon the action of g ∈ G.
As the nanotube’s cross-section becomes a necklace of m beads, this part of the rotational subgroup for an m-bead necklace is given by the Euler totient function. This has been applied in its various generalizations to the combinatorial enumerations of the isomers of substituted kekulenes, septulenes, octulenes, cylindrical nanotubes, and so on [
69,
75]. The corresponding cycle indices for a cylindrical nanotube of cross-section C
m and length n are shown below:
m odd; n odd; σ
h plane passes through the central layer; each of m C
2 axes passes through a vertex of the central layer; σ
v/σ
d planes pass through n vertices:
m odd; n even; σ
h plane does not pass through any vertex of the tube; each of m C
2 axes passes through the centers of edges; σ
v/σ
d planes pass through n vertices:
m even; n odd; each of m/2 C
2 axes passes through the centers of edges; each of m/2 C
2 axes passes through two vertices; m/2 σ
v planes pass through 2n vertices; m/2 σ
d planes pass through the centers of the edges:
m even; n even; each of m C
2 axes passes through the centers of the edges; m/2 σ
v planes pass through 2n vertices; m/2 σ
d planes pass through the centers of the edges:
where the sum is over all divisors d of m, and φ(d) is the Euler totient function given by
The product is taken over all prime numbers p that divide d. The Euler totient function is intimately related to the Möbius function by the expression:
In the above expression, the sum is over all prime divisors of d and μ(d) is the Möbius function that we introduced in the previous subsection.
A multinomial generating function can be obtained from the above expressions. Let [n] ne an ordered partition of n into p parts such that n
1 ≥ 0, n
2 ≥ 0,…, n
p ≥ 0,
. A generating function with arbitrary weights λs and n
1 colors of the type λ
1, n
2, colors of the type λ
2…. n
p colors of the type λ
p is derived by an extension of the Pólya’s procedure for all IRs with the introduction of multinomials shown below:
where
are multinomials given by
The set R of colors can be partitioned into sets R
1, R
2… such that
, for an even m and
for an odd m and |R
i| = p
i in our generalization of Sheehan’s theorem. Let the weight w
ij be assigned for each color r
j in the set R
i. The multinomial function for each IR for coloring the vertices of the nanotube is thus derived:
The multinomial generators thus obtained for each IR for the various color distributions yield the nanotube vertex colorings that transform according to the IR with the character χ. Consequently, the number of such multinomial generating functions equals the number of irreducible representations of the group.
3.4. Hadamard Matrices, Latin Squares, and Designs
An n × n Hadamard matrix
H is an orthogonal matrix comprised of 1 s and −1 s such that
where
I is the n × n identity matrix. An example of a 16 × 16 Hadamard matrix is displayed below:
H
16 =
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | −1 | −1 | −1 | −1 | −1 | −1 | −1 | −1 |
1 | 1 | 1 | 1 | −1 | −1 | −1 | −1 | 1 | 1 | 1 | 1 | −1 | −1 | −1 | −1 |
1 | 1 | 1 | 1 | −1 | −1 | −1 | −1 | −1 | −1 | −1 | −1 | 1 | 1 | 1 | 1 |
1 | 1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | −1 | −1 |
1 | 1 | −1 | −1 | 1 | 1 | −1 | −1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 |
1 | 1 | −1 | −1 | −1 | −1 | 1 | 1 | 1 | 1 | −1 | −1 | −1 | −1 | 1 | 1 |
1 | 1 | −1 | −1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | 1 | 1 | −1 | −1 |
1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 |
1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | 1 |
1 | −1 | 1 | −1 | −1 | 1 | −1 | 1 | 1 | −1 | 1 | −1 | −1 | 1 | −1 | 1 |
1 | −1 | 1 | −1 | −1 | 1 | −1 | 1 | −1 | 1 | −1 | 1 | 1 | −1 | 1 | −1 |
1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 |
1 | −1 | −1 | 1 | 1 | −1 | −1 | 1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | −1 |
1 | −1 | −1 | 1 | −1 | 1 | 1 | −1 | 1 | −1 | −1 | 1 | −1 | 1 | 1 | −1 |
1 | −1 | −1 | 1 | −1 | 1 | 1 | −1 | −1 | 1 | 1 | −1 | 1 | −1 | −1 | 1 |
Hadamard matrices are important in many disciplines, for example, in the construction of balanced designs, Hadamard transform spectroscopy, etc. In the chemical context, they are not only connected to molecular orbitals, but they are also extremely useful in the diagonalization of very large matrices where all eigenvalues and eigenvectors are required. The Hadamard transform techniques have been applied to large carbon nanotubes [
79], and in the context of spectroscopy, they are applicable to NMR spectroscopy [
78]. The construction of Hadamard matrices of any order is a mathematically challenging problem due to combinatorial explosions, although several algorithms have been explored for the computational construction of Hadamard matrices [
80].
A Hadamard matrix is considered skew-Hadamard if
H can be expressed as:
Williamson’s algorithm for the construction of skew-Hadamard matrices seeks solutions for positive integers a, b, c, d that satisfy:
A solution (a,b,c,d) generates the first rows of circulant matrices A, B, C, and D such that:
As the matrices A, B, C, and D can contain only 1 s and −1 s, multiple solutions for the first rows are obtained for each (a,b,c,d). There are also multiple solutions for a, b, c, and d, and thus several skew-Hadamard matrices are constructed for each solution (a,b,c,d). The matrices A, B, C, and D generate an nxn Hadamard matrix:
A 28 × 28 skew-Hadamard matrix is obtained from the solution for a
2 + b
2 + c
2 + d
2 = 28, which yields a = 1, b = 3, c = 3, and d = 3. This generates 15 possible solutions for the first rows of the matrices A, B, C, and D yielding 15 Hadamard matrices. A second solution with a = 1 b =1 c = 1 d = 5 yields more matrices.
Figure 5 shows a design thus constructed for a = 1, b = 3, c = 3, and d = 3 by mapping 1 to blue and −1 to orange.
A complex computer-generated design obtained from a 144 × 144 Hadamard matrix is shown in
Figure 6.
A Latin square is an nxn array where any given entry occurs exactly once in a row and exactly once in any column. The relation between a Latin square and Williamson’s construction of skew-Hadamard matrices in Equation (44) using smaller mxm matrices A, B, C, and D seems self-evident. The matrix in Equation (44) constitutes a Latin square when A, B, C, and Ds are interpreted as symbols or objects without the negative signs. The number of Latin squares [
110] explodes as a function of n; for example, there are 812,851,200 Latin squares for n = 6. Although an exact expression for the number of Latin squares is not known, the bounds for the number of Latin squares, L
n are given by:
It is possible to compute L
n for relatively smaller values of n using the inclusion–exclusion principle considered in the previous section. Shao and Wei [
110] obtained such a formula using this method, and it is shown below, although the formula gives rise to an exponential algorithm rather than a polynomial algorithm.
where B
n is the set of n × n (0, 1) matrices, A is an mxn real submatrix of B
n for m
n, σ
0(A) be the number of zero elements of the matrix A and per A be the permanent of A defined by (44) in which S
n(m) is a permutation group of m objects chosen from the set of n elements; the permanent of a matrix is a special case of the immanent of A and immanent polynomials discussed by the author previously [
111] when applied to the identity irreducible representation of the S
m group of m! permutations [
61,
112]. Consequently, the problem of Latin square enumeration is related to both the representation theory of the symmetric groups [
61,
112] and the inclusion–exclusion combinatorics considered in the previous section. Evidently, the computation of Latin squares by itself is a topic of research.
Latin squares find several applications in statistical designs of experiments, Fisher’s design of biological experiments, minimizing errors, error correction codes, etc. In the symmetry context, Latin squares constitute group multiplication tables of quasigroups.
Magic squares and Soduku puzzles are special cases of Latin squares. A magic square is comprised of an nxn matrix of nonnegative integers such that the sum of all elements in a row or a column adds to the same number. Magic squares have been found in stone inscriptions of temples and churches around the world; for example, the Chautisa yantra on the wall of the 12th Century Parshvanath temple in Khajuraho, India, reproduced in
Figure 7. The Devanagari symbols of the numbers are shown in Arabic numerals in
Figure 7 (Right).
The sum of any row, column, and the sum along the diagonals is 34 in the Chautisa yantra.
In the context of music theory, magic squares and Latin squares are directly related to Babbitt’s partition problems [
12] of generating balanced covers for a given integer pitch projection. As shown in the papers by Bazelow and Brickle [
13,
14] as well as others [
15,
16,
17,
18,
19], Babbitt’s problem [
12] has to do with musical pitch class integer cover wherein an integer pitch sequence adds to the same value in each row of a sequence of notes. The integer pitch sequence is determined by using integer modulo 11 arithmetic or Z
11 = {0,1,2,3, …10} for a 12-tone chromatic scale. The mapping of the 12-notes in such a musical scale is in
Figure 1 (top left) in the form of a 12-tone chromatic wheel. We map 0 to S (C) and N
3 (B Natural) to 10 to obtain pitch class integers, although other mappings are possible so long as the sequence is maintained, as
Figure 1 is a circular wheel. One of the Babbitt problems asks for an algorithm for determining all mxm matrices with entries drawn from the set {1, 2, …, n} for which all rows and columns have the sum n. Algorithms have been employed for several variations of Babbitt’s problem, one of which is to generate partitions that yield the exact cover for a given integer pitch projection. For example,
Figure 8 displays 58 rows of partitions in 6 columns that provide cover for a projection of 696 pitch class integer projection [
18,
19]. It can be seen from
Figure 8 that the sum of the numbers in each row and column is 12, and thus the partition exactly covers for a projection of 696 (58 × 12 = 696) as reconstructed from in Ref. [
18].
5. Machine Learning, Music, Spectroscopy and Multidisciplinary Concepts
Although machine perception of the music of the east and west has been receiving attention since the 1970s, only recently has progress been made in making use of the tools of artificial intelligence such as embedding and machine learning algorithms. As pointed out by Longuet-Higgins in a series of pioneering papers [
28,
29,
30,
31,
32,
33,
34] concerning cognitive science and machine perception of patterns in music, it is evident that one needs to go beyond the musical pitch and scales. Even though musical notes emanating from a piano are discrete and no continuous glides and vibratos are feasible, there are several other technical nuances such as the duration, rhythm, tempo, and many other features that must be considered in the machine perception of music. Longuet-Higgins has pointed out the analogy between music and a natural language in that metrical rhythms are similar to syntactic structures of a natural language. That is, the applications of artificial intelligence to music and machine perception of musical patterns can be benefited by advances in the field of computational linguistics. Regarding the interconnection between pitch-class integers, rhythms, and group theory, we have already discussed this subject in the previous sections.
Transcription of a musical piece through stave notation has been emphasized as a premier step in the machine perception of western music. Longuet-Higgins [
32] elegantly demonstrates this with stave notations of the same melody in multiple ways, among which only one is musically correct. That is, the relative lengths and pitches of a composition are more accurately conveyed in a correct stave notation, thus making it possible for an algorithm for the machine perception through the use of stave notations. However, as there are practically infinite ways to create a sequence of notes in any given scale, the problem becomes challenging without some rules of music grammar. Consequently, Longuet-Higgins and others have pointed out analogies between music and natural languages by formulating generative grammar for rhythm and tonality. This approach has been accentuated further in the last paper of Longuet-Higgins with Dienes [
34] in 2004. In this work, Dienes and Longuet-Higgins point out that human learning of music takes place through recognition of a group of adjacent elements in sequences that they call chunks. To test this hypothesis, the authors [
34] employed a case study by using a pool of participants, mixing those who had significant prior exposure to atonal western music and those who had none. The authors found a distinct disparity in that only those who had significant prior exposure to atonal music could correctly recognize all of the melodies emphasizing the learning aspect of music.
Machine perception of the eastern systems of music such as Hindustani and Carnatic music must take a completely different approach, primarily because the musical compositions not only directly depend on the scale and rhythm, but significant emphasis is placed on jaarus and vibratos called the gamakas. A gamakam in the Carnatic music system is a shake or an oscillation around a note in the musical scale that permits such oscillations primarily determined by traditions of rendering a composition. Hence the south Indian music system is largely based on compositions called krithis and the traditional trinity schools of music. In order to bring out pathos, sympathy, or emotions, significant use of the gamakas and certain repetitive phrases are invoked in the rendering of a composition. Likewise, continuous glides from one note to the other within a sequence of notes rendered during a composition, called the meends, play a very critical role in the north Indian Hindustani system of music.
To demonstrate the point concerning the critical role played by oscillations, the meend (a continuous slow glide from one note to the next) and or gamakas, one can consider three ragas (musical scales) shown in
Figure 17, all of which originate from the 20th scale in
Table 5 called the Asaveri Thaat in the Hindustani system, while it is known in the Carnatic school as Natabhairavi. The three ragas derived from this scale all have the same notes and similar ascents and descents with subtle variations. The characteristic features of a raga are called the pakads, which are sequences of notes (phrases) that bring out the essence of a raga in a musical rendering. The pakads of the three ragas under consideration are in
Figure 17, which bring out the contrast somewhat among them. We note that we have shown the recognizable features of the middle raga in
Figure 17 in continuous glides with oscillations. Indeed these glides and oscillations around the note D
1 are critical to Darbari Kanada (
Figure 17 (mid)). Moreover, the andolan or an oscillation around the note G
2 (komal Ga), combined with the oscillation around D
1, are the two distinguishable features that bring out the essence of this raga, in addition to the pakads shown in
Figure 17 (mid) with oscillations around both G
2 and D
1. On the other hand, the raga adana, a close derivative from the same Thaat (20 in
Table 5), must be rendered with discrete notes without many oscillations, as shown in
Figure 17; otherwise, the rendering will get mixed with Darbari.
A critical comparison of the renderings of a raga with the same scale in the two schools of Indian music reveals substantial differences. Consider the Dorian scale (no. 22 in
Table 5), which is called the Kaafi Thaat in the Hindustani system of music while the same scale becomes Kharaharapriya in the Carnatic school of music. In the Carnatic system, the rendering of this raga invokes vibratos or gamakas for almost every dynamic note because of the symmetrical tetrachord spacing of the notes. A quintessential composition in Kharaharapriya is the Thiyagaraja krithi
Chakkani Rāja mārgamu performed by the late stalwart
Semmangudi Srinivasa Iyer. Consequently, all krithis rendered in Kharaharapriya of south India bear little resemblance to the rendering of the Kaafi Thaat of the Hindustani system, for example, Pandit Jasraj’s mewati gharana in the Kaafi Thaat or the western renderings of the Dorian scale or the pop music song “The Night The Lights Went Out In Georgia” in the same Dorian scale. All of these important musical nuances characteristic to the particular school and tradition need to be considered in any realistic application of the artificial intelligence techniques to the machine perception algorithms. This continues to be one of the major challenges for the machine perception of the music of different cultures. This is analogous to how languages, dialects, and grammar differ in different parts of the world, and hence musical perception is as complex as the machine perception of different linguistics.
Stimulated by Longuet-Higgins’ work [
32] on the application of AI to western music where the generative grammar and analog between musical patterns and the natural language are shown to play important roles, one approach for the machine perception of music is to generate computerized recordings of a given raga in multiple krithis or compositions spanning different rhythmic cycles. For example, there are numerous krithis in the raga Kharaharapriya (the Dorian scale) by all three trinities, and one can find these compositions in different rhythmic cycles. Likewise, in the Hindustani system of music, one can generate computer recordings of several schools of gharanas, for example, the khayal style gharanas of Agra, Dilli, Gwalior, Indore, etc. Once different schools of such compositions in varied rhythmic cycles are created, the machine learning techniques with neural networks can be employed through machine embeddings of distinguishable musical phrases that give rise to the raga, including the meends (glides), andolans (vibratos), gamakas, and/or oscillations around specific notes that constitute the signatures of the raga under consideration. In recent years several authors [
35,
36,
37,
38,
39,
40,
41,
42,
43] have employed neural networks and machine learning techniques for the machine perception of Hindustani music compositions through embedding raga phrases like the ones we described. Such techniques can be extremely challenging for computations as they need to encompass multiple nuances and intonations specific to different schools and the varied renderings of the same raga. Ross et al. [
43] have developed quantitative similarity measures of ragas in order to compare and contrast one raga from the other through neural networks and embeddings of musical phrases using bandish (composition) notations of the Hindustani school. As pointed out by Ross et al. [
43], such quantitative measures need to encompass both intrinsic features such as the notes and tempo as well as extrinsic features such as meends, andolans, variations in temporal factors within a rhythmic cycle, and thus the emotional features pertinent to a raga. By employing these features, Ross et al. have developed a number of deep recursive neural networks with Long-Short Term Memory (LSTM) units developed based on bandish notations. Consequently, the note embeddings capture many characteristic features of a raga, including the various nuances that we have described above. Such an approach is able to provide a quantitative machine framework for delineating the subtle variations among even closely related ragas, as demonstrated by these authors using the embedding maps which show close similarities between the ragas Yaman and Yaman Kalyan arising from the same Kalyan Thaat (Lydian mode, Number 65 in
Table 5), and differences with the raga Pilu, a derivative of the Kaafi Thaat (Dorian scale, Number 22 in
Table 5). Such embeddings facilitate the clustering of a large group of ragas on the basis of quantitative similarity measures analogous to molecular similarity clustering schemes that are extensively used in drug discovery and computational toxicology [
91]. It is evident that such developments in one field can result in significant advances in the other.
The fast Fourier transform (FFT) technique has been extensively employed in spectroscopy to resolve complex spectroscopic signals into individual constituent components of different frequencies. In western music theory, FFT has been applied to musical compositions to extract the discrete Fourier transforms (DFT) using spectral music analysis. Such techniques utilize the power of FFT through the applications of DFT to analyze complex musical compositions. The technique holds considerable promise for extracting discrete components in gamakas, meends, and other musical nuances extensively used in the Hindustani and Carnatic schools. The application of DFT to music can yield more specific mathematical quantities for the characterization of such subtle features of music compositions, providing an important tool for quantitative similarity analysis and cluster algorithms. Likewise, the fast Walsh–Hadamard transform is a powerful tool to compute the Walsh–Hadamard transforms through efficient computations of Hadamard matrices of order 2m × 2m by a recursive dissection of larger matrices of order nxn into n/2 × n/2 matrices in each iteration. In the present review, we have already pointed out the extensive applications of Hadamard transforms to spectroscopy, combinatorial balanced designs, music, Fisher’s design of biological experiments, and other fields.
6. Conclusions and Future Perspectives
In this review, we laid the combinatorial foundations of music theory and spectroscopy and pointed out a number of similarities between spectroscopy and music theory. Symmetry is shown to play a critical and integral part in both of these disciplines as the concepts of rhythm, proportion, and harmony, when expressed in mathematical group theoretical and combinatorial structures, find direct applications to both music theory and spectroscopy, as established in this review. Moreover, spectroscopic concepts such as the blue and red shifts can be directly applied to musical scales in order to transform one musical scale into another through such tonal shifts. Combinatorial techniques such as the inclusion–exclusion principle, Möbius inversion, Pólya’s theory of counting and its generalization to encompass all irreducible representations of the symmetry group, Latin squares, Hadamard matrices, magic squares, ordered partitions, and many more combinatorial structures are shown to find extensive applications both in music theory and spectroscopy. In the context of spectroscopy, we demonstrated the applications of such combinatorial and group theoretical techniques to giant golden fullerene domes by way of providing elegant solutions to the complex problems of machine construction of their MQ-NMR, ESR, and vibrational modes with applications up to supergiant fullerene C150,000.
Applications of machine learning algorithms and artificial intelligence pioneered by Longuet-Higgins, who is credited with the coining of the term “cognitive science”, were reviewed with comparisons between the machine perception of music and computational linguistics. We showed how signatures of closely related ragas could be delineated through combinatorial music phrases and characterizations of meends, gamakas, and oscillations around a note in a raga. Radial symmetries, mirror symmetries, and cyclic group integer modulo symmetries in music theory were pointed out, and their interconnections to the formulation of machine learning algorithms were presented. We reviewed the use of deep learning neural networks through embedding to differentiate ragas and to develop quantitative similarity measures for clustering of a group of ragas. We also pointed out similarities of such neural networks to those developed in other disciplines such as quantitative molecular similarity analysis and clustering of molecules and drugs, quantitative shape measures of molecules, quantum similarity measures, etc., all of which play important roles in drug discovery and computational toxicology.
Various advances that we reviewed clearly bring out the emerging challenges in these fields, especially in music theories, as these are based on aesthetics, traditions, and various schools with multiple complexities. While the notes in a raga and their characteristic features combined with rhythmic cycles form the mathematical basis of machine learning, musical compositions or krithis with all their technical nuances play the role of generative grammar of music. Consequently, algorithms for machine perception of complex nuances of traditional musical compositions need to consider all these faculties, and thus they continue to pose extreme challenges. Although there are several papers published in the area of machine perception of Hindustani music, less progress has been made in Carnatic music. It is hoped that this review article will stimulate giant leaps in these multidisciplinary areas. Such developments are critical as parallel advances can be made in drug discovery and administration as well as in medical science in general. Likewise, emerging nanomaterials such as 2D-nanosheets, nanobelts, and nanomaterials of varied configurations [
114,
115,
116,
117,
118] have all revived interest in the applications of group theory, combinatorics, graph theory, and topological indices for seeking efficient algorithms for the computations of their thermodynamic, spectroscopic, optoelectric, chiral, and phase transformation properties. It is evident that with discoveries of molecules such as kekulenes, septulenes, and octulenes [
117,
118], several 2D sheets of such molecules [
97,
98,
99,
114,
115,
116,
117] are likely to be synthesized in the future. Moreover, the advent of metal–organic frameworks [
119,
120] has opened up new vistas for applications of combinatorics, graph theory, and topology for the enumeration, construction, and characterization of the properties of such emerging novel materials. Although the present review did not delve into other applications of combinatorial and graph-theoretical techniques to various structural enumerations, enumeration, and electronic properties of clusters including gallium arsenides, topological characterization of 2D materials, zeolites, sodalities, other fullerenes, nuclear spin statistics, tessellations of cycloarenes such as kekulenes, their helical analogs, and the recently synthesized expanded kekulenes, and so forth, the readers are referred to references [
121,
122,
123,
124,
125,
126,
127,
128,
129,
130,
131,
132,
133]. Finally, the Diophantine equations similar to the ones used in the Williamson construction of skew-Hadamard matrices as described in this review also find applications in their linear forms in chemical reactions and equilibria [
134].