Bracket (mathematics)In mathematics, brackets of various typographical forms, such as parentheses ( ), square brackets [ ], braces { } and angle brackets ⟨ ⟩, are frequently used in mathematical notation. Generally, such bracketing denotes some form of grouping: in evaluating an expression containing a bracketed sub-expression, the operators in the sub-expression take precedence over those surrounding it. Sometimes, for the clarity of reading, different kinds of brackets are used to express the same meaning of precedence in a single expression with deep nesting of sub-expressions.
Work (physics)In physics, work is the energy transferred to or from an object via the application of force along a displacement. In its simplest form, for a constant force aligned with the direction of motion, the work equals the product of the force strength and the distance traveled. A force is said to do positive work if when applied it has a component in the direction of the displacement of the point of application. A force does negative work if it has a component opposite to the direction of the displacement at the point of application of the force.
Gauge group (mathematics)A gauge group is a group of gauge symmetries of the Yang–Mills gauge theory of principal connections on a principal bundle. Given a principal bundle with a structure Lie group , a gauge group is defined to be a group of its vertical automorphisms. This group is isomorphic to the group of global sections of the associated group bundle whose typical fiber is a group which acts on itself by the adjoint representation. The unit element of is a constant unit-valued section of .
Glossary of algebraic geometryThis is a glossary of algebraic geometry. See also glossary of commutative algebra, glossary of classical algebraic geometry, and glossary of ring theory. For the number-theoretic applications, see glossary of arithmetic and Diophantine geometry. For simplicity, a reference to the base scheme is often omitted; i.e., a scheme will be a scheme over some fixed base scheme S and a morphism an S-morphism.
Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
Gauge bosonIn particle physics, a gauge boson is a bosonic elementary particle that acts as the force carrier for elementary fermions. Elementary particles, whose interactions are described by a gauge theory, interact with each other by the exchange of gauge bosons, usually as virtual particles. Photons, W and Z bosons, and gluons are gauge bosons. All known gauge bosons have a spin of 1; for comparison, the Higgs boson has spin zero and the hypothetical graviton has a spin of 2. Therefore, all known gauge bosons are vector bosons.
Lorenz gauge conditionIn electromagnetism, the Lorenz gauge condition or Lorenz gauge, for Ludvig Lorenz, is a partial gauge fixing of the electromagnetic vector potential by requiring The name is frequently confused with Hendrik Lorentz, who has given his name to many concepts in this field. The condition is Lorentz invariant. The Lorenz gauge condition does not completely determine the gauge: one can still make a gauge transformation where is the four-gradient and is any harmonic scalar function: that is, a scalar function obeying the equation of a massless scalar field).
Decision problemIn computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm whether a given natural number is prime. Another is the problem "given two numbers x and y, does x evenly divide y?". The answer is either 'yes' or 'no' depending upon the values of x and y. A method for solving a decision problem, given in the form of an algorithm, is called a decision procedure for that problem.
Travelling salesman problemThe travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
