Automorphic formIn harmonic analysis and number theory, an automorphic form is a well-behaved function from a topological group G to the complex numbers (or complex vector space) which is invariant under the action of a discrete subgroup of the topological group. Automorphic forms are a generalization of the idea of periodic functions in Euclidean space to general topological groups. Modular forms are holomorphic automorphic forms defined over the groups SL(2, R) or PSL(2, R) with the discrete subgroup being the modular group, or one of its congruence subgroups; in this sense the theory of automorphic forms is an extension of the theory of modular forms.
Representation theoryRepresentation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures. In essence, a representation makes an abstract algebraic object more concrete by describing its elements by matrices and their algebraic operations (for example, matrix addition, matrix multiplication).
Langlands programIn representation theory and algebraic number theory, the Langlands program is a web of far-reaching and influential conjectures about connections between number theory and geometry. Proposed by , it seeks to relate Galois groups in algebraic number theory to automorphic forms and representation theory of algebraic groups over local fields and adeles. Widely seen as the single biggest project in modern mathematical research, the Langlands program has been described by Edward Frenkel as "a kind of grand unified theory of mathematics.
QuickTimeQuickTime is a discontinued extensible multimedia architecture created by Apple, which supports playing, streaming, encoding, and transcoding a variety of digital media formats. The term QuickTime also refers to the QuickTime Player front-end media player application, which is built-into macOS, and was available for download on Windows until 2016. QuickTime was created in 1991, when the concept of playing digital video directly on computers was "groundbreaking.
Spherical harmonicsIn mathematics and physical science, spherical harmonics are special functions defined on the surface of a sphere. They are often employed in solving partial differential equations in many scientific fields. Since the spherical harmonics form a complete set of orthogonal functions and thus an orthonormal basis, each function defined on the surface of a sphere can be written as a sum of these spherical harmonics. This is similar to periodic functions defined on a circle that can be expressed as a sum of circular functions (sines and cosines) via Fourier series.
System 7System 7, codenamed "Big Bang", and later (as of version 7.6) also known as Mac OS 7, is a graphical user interface-based operating system for Macintosh computers and is part of the classic Mac OS series of operating systems. It was introduced on May 13, 1991, by Apple Computer It succeeded System 6, and was the main Macintosh operating system until it was succeeded by Mac OS 8 in 1997. Current for more than six years, System 7 was the longest-lived major version series of the classic Macintosh operating system (to date, only Mac OS X had a longer lifespan).
Cusp formIn number theory, a branch of mathematics, a cusp form is a particular kind of modular form with a zero constant coefficient in the Fourier series expansion. A cusp form is distinguished in the case of modular forms for the modular group by the vanishing of the constant coefficient a0 in the Fourier series expansion (see q-expansion) This Fourier expansion exists as a consequence of the presence in the modular group's action on the upper half-plane via the transformation For other groups, there may be some translation through several units, in which case the Fourier expansion is in terms of a different parameter.
Square (algebra)In mathematics, a square is the result of multiplying a number by itself. The verb "to square" is used to denote this operation. Squaring is the same as raising to the power 2, and is denoted by a superscript 2; for instance, the square of 3 may be written as 32, which is the number 9. In some cases when superscripts are not available, as for instance in programming languages or plain text files, the notations x^2 (caret) or x**2 may be used in place of x2. The adjective which corresponds to squaring is quadratic.
−1In mathematics, −1 (negative one or minus one) is the additive inverse of 1, that is, the number that when added to 1 gives the additive identity element, 0. It is the negative integer greater than negative two (−2) and less than 0. Multiplying a number by −1 is equivalent to changing the sign of the number – that is, for any x we have (−1) ⋅ x = −x. This can be proved using the distributive law and the axiom that 1 is the multiplicative identity: x + (−1) ⋅ x = 1 ⋅ x + (−1) ⋅ x = (1 + (−1)) ⋅ x = 0 ⋅ x = 0.
Spin-weighted spherical harmonicsIn special functions, a topic in mathematics, spin-weighted spherical harmonics are generalizations of the standard spherical harmonics and—like the usual spherical harmonics—are functions on the sphere. Unlike ordinary spherical harmonics, the spin-weighted harmonics are U(1) gauge fields rather than scalar fields: mathematically, they take values in a complex line bundle. The spin-weighted harmonics are organized by degree l, just like ordinary spherical harmonics, but have an additional spin weight s that reflects the additional U(1) symmetry.
Spherical basisIn pure and applied mathematics, particularly quantum mechanics and computer graphics and their applications, a spherical basis is the basis used to express spherical tensors. The spherical basis closely relates to the description of angular momentum in quantum mechanics and spherical harmonic functions. While spherical polar coordinates are one orthogonal coordinate system for expressing vectors and tensors using polar and azimuthal angles and radial distance, the spherical basis are constructed from the standard basis and use complex numbers.
Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.
Space complexityThe space complexity of an algorithm or a computer program is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely. This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space. Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as etc.
Parameterized complexityIn computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input.
Ground and neutralIn electrical engineering, ground and neutral are circuit conductors used in alternating current (AC) electrical systems. The ground circuit is connected to earth, and neutral circuit is usually connected to ground. As the neutral point of an electrical supply system is often connected to earth ground, ground and neutral are closely related. Under certain conditions, a conductor used to connect to a system neutral is also used for grounding (earthing) of equipment and structures.
Letter caseLetter case is the distinction between the letters that are in larger uppercase or capitals (or more formally majuscule) and smaller lowercase (or more formally minuscule) in the written representation of certain languages. The writing systems that distinguish between the upper- and lowercase have two parallel sets of letters: each in the majuscule set has a counterpart in the minuscule set. Some counterpart letters have the same shape, and differ only in size (e.g. {C,c} or {S,s}), but for others the shapes are different (e.
Camel caseCamel case (sometimes stylized as camelCase or CamelCase, also known as camel caps or more formally as medial capitals) is the practice of writing phrases without spaces or punctuation and with capitalized words. The format indicates the first word starting with either case, then the following words having an initial uppercase letter. Common examples include "YouTube", "iPhone" and "eBay". Camel case is often used as a naming convention in computer programming.
Ground (electricity)In electrical engineering, ground or earth may be a reference point in an electrical circuit from which voltages are measured, a common return path for electric current, or a direct physical connection to the Earth. Electrical circuits may be connected to ground for several reasons. Exposed conductive parts of electrical equipment are connected to ground, to protect users from electrical shock hazard. If internal insulation fails, dangerous voltages may appear on the exposed conductive parts.
