This article needs additional citations for verification .(March 2024) |
In mathematics, in number theory, a Bhargava cube (also called Bhargava's cube) is a configuration consisting of eight integers placed at the eight corners of a cube. [1] This configuration was extensively used by Manjul Bhargava, a Canadian-American Fields Medal winning mathematician, to study the composition laws of binary quadratic forms and other such forms. To each pair of opposite faces of a Bhargava cube one can associate an integer binary quadratic form thus getting three binary quadratic forms corresponding to the three pairs of opposite faces of the Bhargava cube. [2] These three quadratic forms all have the same discriminant and Manjul Bhargava proved that their composition in the sense of Gauss [3] is the identity element in the associated group of equivalence classes of primitive binary quadratic forms. (This formulation of Gauss composition was likely first due to Dedekind.) [4] Using this property as the starting point for a theory of composition of binary quadratic forms Manjul Bhargava went on to define fourteen different composition laws using a cube.
An expression of the form , where a, b and c are fixed integers and x and y are variable integers, is called an integer binary quadratic form. The discriminant of the form is defined as
The form is said to be primitive if the coefficients a, b, c are relatively prime. Two forms
are said to be equivalent if there exists a transformation
with integer coefficients satisfying which transforms to . This relation is indeed an equivalence relation in the set of integer binary quadratic forms and it preserves discriminants and primitivity.
Let and be two primitive binary quadratic forms having the same discriminant and let the corresponding equivalence classes of forms be and . One can find integers such that
The class is uniquely determined by the classes [Q(x, y)] and [Q′(x, y)] and is called the composite of the classes and . [3] This is indicated by writing
The set of equivalence classes of primitive binary quadratic forms having a given discriminant D is a group under the composition law described above. The identity element of the group is the class determined by the following form:
The inverse of the class is the class .
Let (M, N) be the pair of 2 × 2 matrices associated with a pair of opposite sides of a Bhargava cube; the matrices are formed in such a way that their rows and columns correspond to the edges of the corresponding faces. The integer binary quadratic form associated with this pair of faces is defined as
The quadratic form is also defined as
However, the former definition will be assumed in the sequel.
Let the cube be formed by the integers a, b, c, d, e, f, g, h. The pairs of matrices associated with opposite edges are denoted by (M1, N1), (M2, N2), and (M3, N3). The first rows of M1, M2 and M3 are respectively [ab], [ac] and [ae]. The opposite edges in the same face are the second rows. The corresponding edges in the opposite faces form the rows of the matrices N1, N2, N3 (see figure).
The quadratic form associated with the faces defined by the matrices (see figure) is
The discriminant of a quadratic form Q1 is
The quadratic form associated with the faces defined by the matrices (see figure) is
The discriminant of a quadratic form Q2 is
The quadratic form associated with the faces defined by the matrices (see figure) is
The discriminant of a quadratic form Q3 is
Manjul Bhargava's surprising discovery can be summarised thus: [2]
The three quadratic forms associated with the numerical Bhargava cube shown in the figure are computed as follows.
The composition is the form where because of the following:
Also . Thus is the identity element in the group defined by the Gauss composition.
The fact that the composition of the three binary quadratic forms associated with the Bhargava cube is the identity element in the group of such forms has been used by Manjul Bhargava to define a composition law for the cubes themselves. [2]
An integer binary cubic in the form can be represented by a triply symmetric Bhargava cube as in the figure. The law of composition of cubes can be used to define a law of composition for the binary cubic forms. [2]
The pair of binary quadratic forms can be represented by a doubly symmetric Bhargava cube as in the figure. The law of composition of cubes is now used to define a composition law on pairs of binary quadratic forms. [2]
A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. Such a triple is commonly written (a, b, c), and a well-known example is (3, 4, 5). If (a, b, c) is a Pythagorean triple, then so is (ka, kb, kc) for any positive integer k. A primitive Pythagorean triple is one in which a, b and c are coprime (that is, they have no common divisor larger than 1). For example, (3, 4, 5) is a primitive Pythagorean triple whereas (6, 8, 10) is not. A triangle whose sides form a Pythagorean triple is called a Pythagorean triangle and is a right triangle.
Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming.
In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and allows deducing some properties of the roots without computing them. More precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number theory, and algebraic geometry.
A mathematical symbol is a figure or a combination of figures that is used to represent a mathematical object, an action on mathematical objects, a relation between mathematical objects, or for structuring the other symbols that occur in a formula. As formulas are entirely constituted with symbols of various types, many symbols are needed for expressing all mathematics.
In number theory, the ideal class group of an algebraic number field K is the quotient group JK /PK where JK is the group of fractional ideals of the ring of integers of K, and PK is its subgroup of principal ideals. The class group is a measure of the extent to which unique factorization fails in the ring of integers of K. The order of the group, which is finite, is called the class number of K.
In mathematics, the orthogonal group in dimension n, denoted O(n), is the group of distance-preserving transformations of a Euclidean space of dimension n that preserve a fixed point, where the group operation is given by composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of n × n orthogonal matrices, where the group operation is given by matrix multiplication (an orthogonal matrix is a real matrix whose inverse equals its transpose). The orthogonal group is an algebraic group and a Lie group. It is compact.
In linear algebra, an n-by-n square matrix A is called invertible if there exists an n-by-n square matrix B such that
In mathematics, a quadratic form is a polynomial with terms all of degree two. For example,
In mathematics, a quadratic irrational number is an irrational number that is the solution to some quadratic equation with rational coefficients which is irreducible over the rational numbers. Since fractions in the coefficients of a quadratic equation can be cleared by multiplying both sides by their least common denominator, a quadratic irrational is an irrational root of some quadratic equation with integer coefficients. The quadratic irrational numbers, a subset of the complex numbers, are algebraic numbers of degree 2, and can therefore be expressed as
In linear algebra, a Vandermonde matrix, named after Alexandre-Théophile Vandermonde, is a matrix with the terms of a geometric progression in each row: an matrix
In algebraic number theory, a quadratic field is an algebraic number field of degree two over , the rational numbers.
The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known. It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve. It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties. It was invented by Carl Pomerance in 1981 as an improvement to Schroeppel's linear sieve.
In mathematics, Dodgson condensation or method of contractants is a method of computing the determinants of square matrices. It is named for its inventor, Charles Lutwidge Dodgson (better known by his pseudonym, as Lewis Carroll, the popular author), who discovered it in 1866. The method in the case of an n × n matrix is to construct an (n − 1) × (n − 1) matrix, an (n − 2) × (n − 2), and so on, finishing with a 1 × 1 matrix, which has one entry, the determinant of the original matrix.
In additive number theory, Fermat's theorem on sums of two squares states that an odd prime p can be expressed as:
In mathematics, a binary quadratic form is a quadratic homogeneous polynomial in two variables
In mathematics, the quadratic eigenvalue problem (QEP), is to find scalar eigenvalues , left eigenvectors and right eigenvectors such that
In mathematics, a fundamental discriminantD is an integer invariant in the theory of integral binary quadratic forms. If Q(x, y) = ax2 + bxy + cy2 is a quadratic form with integer coefficients, then D = b2 − 4ac is the discriminant of Q(x, y). Conversely, every integer D with D ≡ 0, 1 (mod 4) is the discriminant of some binary quadratic form with integer coefficients. Thus, all such integers are referred to as discriminants in this theory.
In mathematics, specifically the area of algebraic number theory, a cubic field is an algebraic number field of degree three.
In mathematics, an algebraic number field is an extension field of the field of rational numbers such that the field extension has finite degree . Thus is a field that contains and has finite dimension when considered as a vector space over .
In mathematics, in number theory, Gauss composition law is a rule, invented by Carl Friedrich Gauss, for performing a binary operation on integral binary quadratic forms (IBQFs). Gauss presented this rule in his Disquisitiones Arithmeticae, a textbook on number theory published in 1801, in Articles 234 - 244. Gauss composition law is one of the deepest results in the theory of IBQFs and Gauss's formulation of the law and the proofs its properties as given by Gauss are generally considered highly complicated and very difficult. Several later mathematicians have simplified the formulation of the composition law and have presented it in a format suitable for numerical computations. The concept has also found generalisations in several directions.