User interfaceIn the industrial design field of human–computer interaction, a user interface (UI) is the space where interactions between humans and machines occur. The goal of this interaction is to allow effective operation and control of the machine from the human end, while the machine simultaneously feeds back information that aids the operators' decision-making process. Examples of this broad concept of user interfaces include the interactive aspects of computer operating systems, hand tools, heavy machinery operator controls and process controls.
Elementary symmetric polynomialIn mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed as a polynomial in elementary symmetric polynomials. That is, any symmetric polynomial P is given by an expression involving only additions and multiplication of constants and elementary symmetric polynomials.
Symmetric polynomialIn mathematics, a symmetric polynomial is a polynomial P(X1, X2, ..., Xn) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally, P is a symmetric polynomial if for any permutation σ of the subscripts 1, 2, ..., n one has P(Xσ(1), Xσ(2), ..., Xσ(n)) = P(X1, X2, ..., Xn). Symmetric polynomials arise naturally in the study of the relation between the roots of a polynomial in one variable and its coefficients, since the coefficients can be given by polynomial expressions in the roots, and all roots play a similar role in this setting.
Polynomial greatest common divisorIn algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers. In the important case of univariate polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial GCD is defined only up to the multiplication by an invertible constant.
Decay chainIn nuclear science, the decay chain refers to a series of radioactive decays of different radioactive decay products as a sequential series of transformations. It is also known as a "radioactive cascade". The typical radioisotope does not decay directly to a stable state, but rather it decays to another radioisotope. Thus there is usually a series of decays until the atom has become a stable isotope, meaning that the nucleus of the atom has reached a stable state. Decay stages are referred to by their relationship to previous or subsequent stages.
Philippe de VilmorinJoseph-Marie-Philippe Lévêque de Vilmorin (21 May 1872 – 29 June 1917), generally known as Philippe de Vilmorin, was a noted French botanist and plant collector, and a member of the celebrated Vilmorin family of horticulturists. In 1903 Vilmorin began the Arboretum de Pézanin, an arboretum located in Dompierre-les-Ormes, Saône-et-Loire, Bourgogne, France. He also collected plants in Egypt and Sudan that now form part of the herbarium of the National Botanic Garden of Belgium.
Semi-log plotIn science and engineering, a semi-log plot/graph or semi-logarithmic plot/graph has one axis on a logarithmic scale, the other on a linear scale. It is useful for data with exponential relationships, where one variable covers a large range of values, or to zoom in and visualize that - what seems to be a straight line in the beginning - is in fact the slow start of a logarithmic curve that is about to spike and changes are much bigger than thought initially.
Irreducible polynomialIn mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients.
Mapie de Toulouse-LautrecMarie Pierre "Mapie" de Toulouse-Lautrec (1901–1972) was a French journalist and food writer, born Marie Pierre Adélaïde Lévêque de Vilmorin in Verrières-le-Buisson, scion of the Vilmorin seed company. Her horticulturalist father was Joseph Marie Philippe Lévêque de Vilmorin (1872-1917), and her mother was the former Bertha Marie Mélanie de Gaufridy de Dortan (1876-1937). The writer Louise de Vilmorin (1902–1969) was her younger sister, while one of her younger brothers, Roger, was the result of an affair between her mother and Alfonso XIII of Spain.
Square-free polynomialIn mathematics, a square-free polynomial is a polynomial defined over a field (or more generally, an integral domain) that does not have as a divisor any square of a non-constant polynomial. A univariate polynomial is square free if and only if it has no multiple root in an algebraically closed field containing its coefficients. This motivates that, in applications in physics and engineering, a square-free polynomial is commonly called a polynomial with no repeated roots.
VilmorinVilmorin is a French seed producer. The company has a long history in France, where it was family-controlled for almost two centuries, and today exists as a publicly traded company owned principally by agro-industrial cooperative Groupe Limagrain, the largest plant breeding and seed company in the European Union. Vilmorin was founded as a plant and seed boutique in 1743 by seed expert Claude Geoffroy and her husband Pierre Andrieux, the chief seed supplier and botanist to King Louis XV.
Cyclotomic polynomialIn mathematics, the nth cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisor of and is not a divisor of for any k < n. Its roots are all nth primitive roots of unity where k runs over the positive integers not greater than n and coprime to n (and i is the imaginary unit). In other words, the nth cyclotomic polynomial is equal to It may also be defined as the monic polynomial with integer coefficients that is the minimal polynomial over the field of the rational numbers of any primitive nth-root of unity ( is an example of such a root).
