source stringlengths 16 98 | text stringlengths 40 168k |
|---|---|
Wikipedia:Claire Mathieu#0 | Claire Mathieu (formerly Kenyon, born 1965) is a French computer scientist and mathematician, known for her research on approximation algorithms, online algorithms, and auction theory. She works as a director of research at the Centre national de la recherche scientifique. Mathieu earned her Ph.D. in 1988 from the Univ... |
Wikipedia:Claire Postlethwaite#0 | Claire Maria Postlethwaite is an applied mathematician based in New Zealand, where she is a professor in applied mathematics at the University of Auckland and a principal investigator for Te Pūnaha Matatini. Her research involves heteroclinic networks in dynamical systems and delay differential equations, and their var... |
Wikipedia:Clare Parnell#0 | Clare Elizabeth Parnell (born 1970) is a British astrophysicist and applied mathematician who studies the mathematics of the Sun and of magnetic fields, including the Solar corona and the Sun's magnetic carpet, magnetic reconnection in plasma, and the null points of magnetic fields. She is a professor of mathematics at... |
Wikipedia:Classification of Fatou components#0 | In mathematics, Fatou components are components of the Fatou set. They were named after Pierre Fatou. == Rational case == If f is a rational function f = P ( z ) Q ( z ) {\displaystyle f={\frac {P(z)}{Q(z)}}} defined in the extended complex plane, and if it is a nonlinear function (degree > 1) d ( f ) = max ( deg ( P... |
Wikipedia:Classification of discontinuities#0 | Continuous functions are of utmost importance in mathematics, functions and applications. However, not all functions are continuous. If a function is not continuous at a limit point (also called "accumulation point" or "cluster point") of its domain, one says that it has a discontinuity there. The set of all points of ... |
Wikipedia:Classification of finite simple groups#0 | In mathematics, the classification of finite simple groups (popularly called the enormous theorem) is a result of group theory stating that every finite simple group is either cyclic, or alternating, or belongs to a broad infinite class called the groups of Lie type, or else it is one of twenty-six exceptions, called s... |
Wikipedia:Claude Dechales#0 | Claude François Milliet Dechales (1621 – 28 March 1678) was a French Jesuit priest and mathematician. He published a treatise on mathematics and a translation of the works of Euclid. == Biography == Born in Chambéry, Savoy, Claude Dechales (De Challes) was the son of Hector Milliet de Challes (1568–1642), first preside... |
Wikipedia:Claude Gaspar Bachet de Méziriac#0 | Claude Gaspar Bachet Sieur de Méziriac (9 October 1581 – 26 February 1638) was a French mathematician and poet born in Bourg-en-Bresse, at that time belonging to Duchy of Savoy. He wrote Problèmes plaisans et délectables qui se font par les nombres, Les éléments arithmétiques, and a Latin translation of the Arithmetica... |
Wikipedia:Claude Mylon#0 | Claude Mylon (1618–1660) was a French mathematician and member of the Académie Parisienne and the Académie des Sciences. == References == |
Wikipedia:Claude Sabbah#0 | Claude Sabbah (born 30 October 1954) is a French mathematician and researcher at École Polytechnique. == Education == Sabbah received his doctoral degree from Paris Diderot University in 1976 under the supervision of Lê Dũng Tráng. == Selected publications == === Books === Introduction to Stokes Structures, Springer Ve... |
Wikipedia:Claudia Cenedese#0 | Claudia Cenedese (born 1971) is an Italian physical oceanographer and applied mathematician whose research focuses on the circulation and flow of water in the ocean, and on the theoretical fluid dynamics needed to model these flows, including phenomena such as mesoscale vortices, buoyancy-driven flow, coastal currents,... |
Wikipedia:Claudia Malvenuto#0 | Claudia Malvenuto (born 1965) is an Italian mathematician, one of the namesakes of the Malvenuto–Poirier–Reutenauer Hopf algebra of permutations. She is an associate professor of mathematics at Sapienza University of Rome. == Education == Malvenuto was born in Turin. After earning a laurea in mathematics from Sapienza ... |
Wikipedia:Claudia Polini#0 | Claudia Polini is an Italian mathematician specializing in commutative algebra. She is the Glynn Family Honors Collegiate Professor of Mathematics at the University of Notre Dame, and directs the Center of Mathematics at Notre Dame. == Education and career == Polini's mother was a school teacher, and before Polini reac... |
Wikipedia:Claudia Sagastizábal#0 | Claudia Alejandra Sagastizábal is an applied mathematician known for her research in convex optimization and energy management, and for her co-authorship of the book Numerical Optimization: Theoretical and Practical Aspects. She is a researcher at the University of Campinas in Brazil. Since 2015 she has been editor-in-... |
Wikipedia:Claudio Baiocchi#0 | Claudio Baiocchi (August 20, 1940 – December 14, 2020) was an Italian mathematician. He was a professor at the University of Pavia and since the 1990s he was a professor of mathematical higher analysis at the Sapienza University. He worked on partial differential equations and the calculus of variations. In 1971 he app... |
Wikipedia:Claudio Procesi#0 | Claudio Procesi (born 31 March 1941 in Rome) is an Italian mathematician, known for works in algebra and representation theory. == Career == Procesi studied at the Sapienza University of Rome, where he received his degree (Laurea) in 1963. In 1966 he graduated from the University of Chicago advised by Israel Herstein, ... |
Wikipedia:Clearing denominators#0 | In mathematics, the method of clearing denominators, also called clearing fractions, is a technique for simplifying an equation equating two expressions that each are a sum of rational expressions – which includes simple fractions. == Example == Consider the equation x 6 + y 15 z = 1. {\displaystyle {\frac {x}{6}}+{\fr... |
Wikipedia:Clemency Montelle#0 | Clemency Montelle (born 8 July 1977) is a New Zealand historian of mathematics known for her research on Indian mathematics and Indian astronomy. She is a professor of mathematics at the University of Canterbury, and a fellow of the New Zealand India Research Institute of the Victoria University of Wellington. == Educa... |
Wikipedia:Clement W. H. Lam#0 | Clement Wing Hong Lam (Chinese: 林永康) is a Canadian mathematician, specializing in combinatorics. He is famous for the computer proof, with Larry Thiel and S. Swiercz, of the nonexistence of a finite projective plane of order 10. Lam earned his PhD in 1974 under Herbert Ryser at Caltech with thesis Rational G-Circulants... |
Wikipedia:Cleo (mathematician)#0 | Cleo was the pseudonym of an anonymous mathematician active on the mathematics Stack Exchange from 2013 to 2015, who became known for providing precise answers to complex mathematical integration problems without showing any intermediate steps. Due to the extraordinary accuracy and speed of the provided solutions, math... |
Wikipedia:Cleota Gage Fry#0 | Cleota Gage Fry (December 30, 1910 – July 1, 2001) was an American mathematician, physicist and university professor. She was one of the few women to earn a PhD in mathematics before World War II and was only the second person at Purdue to earn a doctorate in mathematics. == Biography == Fry was born December 30, 1910 ... |
Wikipedia:Clive Selwyn Davis#0 | Clive Selwyn Davis (15 April 1916 – 29 October 2009) was a Professor in Mathematics at the University of Queensland and veteran of World War II. He took his PhD in mathematics at the University of Cambridge, and upon his return to Australia worked to improve the study of mathematics at the University of Queensland over... |
Wikipedia:Closed-form expression#0 | In mathematics, an expression or equation is in closed form if it is formed with constants, variables, and a set of functions considered as basic and connected by arithmetic operations (+, −, ×, /, and integer powers) and function composition. Commonly, the basic functions that are allowed in closed forms are nth root,... |
Wikipedia:Closure (mathematics)#0 | In mathematics, a subset of a given set is closed under an operation on the larger set if performing that operation on members of the subset always produces a member of that subset. For example, the natural numbers are closed under addition, but not under subtraction: 1 − 2 is not a natural number, although both 1 and ... |
Wikipedia:Closure with a twist#0 | Closure with a twist is a property of subsets of an algebraic structure. A subset Y {\displaystyle Y} of an algebraic structure X {\displaystyle X} is said to exhibit closure with a twist if for every two elements y 1 , y 2 ∈ Y {\displaystyle y_{1},y_{2}\in Y} there exists an automorphism ϕ {\displaystyle \phi } of X {... |
Wikipedia:Clustering coefficient#0 | In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterised by a relatively high density of ties; this likelihood ten... |
Wikipedia:Clément Mouhot#0 | Clément Mouhot (French: [muo]; born 19 August 1978) is a French mathematician and academic. He is Professor of Mathematical Sciences at the University of Cambridge. His research is primarily in partial differential equations and mathematical physics (statistical mechanics, Boltzmann equation, Vlasov equation). == Biogr... |
Wikipedia:Clément Servais#0 | Clément Joseph Servais (16 October 1862, Huy – 9 October 1935, Brussels) was a Belgian mathematician, specializing in geometry. Servais attended secondary school at the Athénée royal de Huy. In 1881 he matriculated at the Normal School of Sciences of Ghent University. In 1884 he graduated there and passed the agrégatio... |
Wikipedia:Coastline paradox#0 | The coastline paradox is the counterintuitive observation that the coastline of a landmass does not have a well-defined length. This results from the fractal curve-like properties of coastlines; i.e., the fact that a coastline typically has a fractal dimension. Although the "paradox of length" was previously noted by H... |
Wikipedia:Coates graph#0 | In mathematics, the Coates graph or Coates flow graph, named after C.L. Coates, is a graph associated with the Coates' method for the solution of a system of linear equations. The Coates graph Gc(A) associated with an n × n matrix A is an n-node, weighted, labeled, directed graph. The nodes, labeled 1 through n, are ea... |
Wikipedia:Cocker's Arithmetick#0 | Cocker's Arithmetick, also known by its full title "Cocker's Arithmetick: Being a Plain and Familiar Method Suitable to the Meanest Capacity for the Full Understanding of That Incomparable Art, As It Is Now Taught by the Ablest School-Masters in City and Country", is a grammar school mathematics textbook written by the... |
Wikipedia:Cocker's Decimal Arithmetick#0 | Cocker's Decimal Arithmetick is a grammar school mathematics textbook written by the English engraver and teacher Edward Cocker (1631–1676) and published posthumously by John Hawkins in 1684. Decimal Arithmetick along with the companion volume Cocker's Arithmetick, published in 1677, were used in schools in the United ... |
Wikipedia:Codimension#0 | In mathematics, codimension is a basic geometric idea that applies to subspaces in vector spaces, to submanifolds in manifolds, and suitable subsets of algebraic varieties. For affine and projective algebraic varieties, the codimension equals the height of the defining ideal. For this reason, the height of an ideal is ... |
Wikipedia:Codomain#0 | In mathematics, a codomain, counter-domain, or set of destination of a function is a set into which all of the output of the function is constrained to fall. It is the set Y in the notation f: X → Y. The term range is sometimes ambiguously used to refer to either the codomain or the image of a function. A codomain is p... |
Wikipedia:Coefficient#0 | In mathematics, a coefficient is a multiplicative factor involved in some term of a polynomial, a series, or any other type of expression. It may be a number without units, in which case it is known as a numerical factor. It may also be a constant with units of measurement, in which it is known as a constant multiplier... |
Wikipedia:Coefficient matrix#0 | In linear algebra, a coefficient matrix is a matrix consisting of the coefficients of the variables in a set of linear equations. The matrix is used in solving systems of linear equations. == Coefficient matrix == In general, a system with m linear equations and n unknowns can be written as a 11 x 1 + a 12 x 2 + ⋯ + a ... |
Wikipedia:Cohn's irreducibility criterion#0 | Cohn's irreducibility criterion is a sufficient condition for a polynomial to be irreducible in Z [ x ] {\displaystyle \mathbb {Z} [x]} —that is, for it to be unfactorable into the product of lower-degree polynomials with integer coefficients. == Statement == The criterion is often stated as follows: If a prime number ... |
Wikipedia:Coincidence point#0 | In mathematics, a coincidence point (or simply coincidence) of two functions is a point in their common domain having the same image. Formally, given two functions f , g : X → Y {\displaystyle f,g\colon X\rightarrow Y} we say that a point x in X is a coincidence point of f and g if f(x) = g(x). Coincidence theory (the ... |
Wikipedia:Cointerpretability#0 | In mathematical logic, cointerpretability is a binary relation on formal theories: a formal theory T is cointerpretable in another such theory S, when the language of S can be translated into the language of T in such a way that S proves every formula whose translation is a theorem of T. The "translation" here is requi... |
Wikipedia:Cokernel#0 | The cokernel of a linear mapping of vector spaces f : X → Y is the quotient space Y / im(f) of the codomain of f by the image of f. The dimension of the cokernel is called the corank of f. Cokernels are dual to the kernels of category theory, hence the name: the kernel is a subobject of the domain (it maps to the domai... |
Wikipedia:Cole Prize#0 | The Frank Nelson Cole Prize, or Cole Prize for short, is one of twenty-two prizes awarded to mathematicians by the American Mathematical Society, one for an outstanding contribution to algebra, and the other for an outstanding contribution to number theory. The prize is named after Frank Nelson Cole, who served the Soc... |
Wikipedia:Colette Guillopé#0 | Colette Guillopé (born 1951) is a French mathematician specializing in partial differential equations and fluid mechanics. She is a professor emerita at Paris 12 Val de Marne University, where she is also the gender officer for the university. == Early life == Guillopé's parents were both professors. She studied at the... |
Wikipedia:Colin W. Clark#0 | Colin Whitcomb Clark (18 June 1931 – 12 April 2024) was a Canadian mathematician and behaviorial ecologist who contributed to the economics of natural resources. Clark specialized in behavioral ecology and the economics of natural resources, specifically, in the management of commercial fisheries. Clark was named a Fel... |
Wikipedia:Collage theorem#0 | In mathematics, the collage theorem characterises an iterated function system whose attractor is close, relative to the Hausdorff metric, to a given set. The IFS described is composed of contractions whose images, as a collage or union when mapping the given set, are arbitrarily close to the given set. It is typically ... |
Wikipedia:Collapsing algebra#0 | In mathematics, a collapsing algebra is a type of Boolean algebra sometimes used in forcing to reduce ("collapse") the size of cardinals. The posets used to generate collapsing algebras were introduced by Azriel Lévy in 1963. The collapsing algebra of λω is a complete Boolean algebra with at least λ elements but genera... |
Wikipedia:Colloquium Lectures (AMS)#0 | The Colloquium Lecture of the American Mathematical Society is a special annual session of lectures. == History == The origins of the Colloquium Lectures date back to the 1893 International Congress of Mathematics, held in connection with the Chicago World's Fair, where the German mathematician Felix Klein gave the ope... |
Wikipedia:Colva Roney-Dougal#0 | Colva Mary Roney-Dougal is a British mathematician specializing in group theory and computational algebra. She is Professor of Pure Mathematics at the University of St Andrews, and the Director of the Centre for Interdisciplinary Research in Computational Algebra at St Andrews. She is also known for her popularization ... |
Wikipedia:Combinatorial matrix theory#0 | Combinatorial matrix theory is a branch of linear algebra and combinatorics that studies matrices in terms of the patterns of nonzeros and of positive and negative values in their coefficients. Concepts and topics studied within combinatorial matrix theory include: (0,1)-matrix, a matrix whose coefficients are all 0 or... |
Wikipedia:Commensurability (mathematics)#0 | In mathematics, two non-zero real numbers a and b are said to be commensurable if their ratio a/b is a rational number; otherwise a and b are called incommensurable. (Recall that a rational number is one that is equivalent to the ratio of two integers.) There is a more general notion of commensurability in group theo... |
Wikipedia:Common fixed point problem#0 | In mathematics, the common fixed point problem is the conjecture that, for any two continuous functions that map the unit interval into itself and commute under functional composition, there must be a point that is a fixed point of both functions. In other words, if the functions f {\displaystyle f} and g {\displaystyl... |
Wikipedia:Common knowledge (logic)#0 | Common knowledge is a special kind of knowledge for a group of agents. There is common knowledge of p in a group of agents G when all the agents in G know p, they all know that they know p, they all know that they all know that they know p, and so on ad infinitum. It can be denoted as C G p {\displaystyle C_{G}p} . The... |
Wikipedia:Communications in Algebra#0 | Communications in Algebra is a monthly peer-reviewed scientific journal covering algebra, including commutative algebra, ring theory, module theory, non-associative algebra (including Lie algebras and Jordan algebras), group theory, and algebraic geometry. It was established in 1974 and is published by Taylor & Francis... |
Wikipedia:Commutation matrix#0 | In mathematics, especially in linear algebra and matrix theory, the commutation matrix is used for transforming the vectorized form of a matrix into the vectorized form of its transpose. Specifically, the commutation matrix K(m,n) is the nm × mn permutation matrix which, for any m × n matrix A, transforms vec(A) into v... |
Wikipedia:Commutative property#0 | In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Perhaps most familiar as a property of arithmetic, e.g. "3 + 4 = 4 + 3" or "2 × 5 = 5 × 2", the property ... |
Wikipedia:Complementary series representation#0 | In mathematics, complementary series representations of a reductive real or p-adic Lie groups are certain irreducible unitary representations that are not tempered and do not appear in the decomposition of the regular representation into irreducible representations. They are rather mysterious: they do not turn up very ... |
Wikipedia:Complete homogeneous symmetric polynomial#0 | In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression in complete homogeneous symmetric polynomials. == Definition == The complet... |
Wikipedia:Completing the square#0 | In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form a x 2 + b x + c {\displaystyle \textstyle ax^{2}+bx+c} to the form a ( x − h ) 2 + k {\displaystyle \textstyle a(x-h)^{2}+k} for some values of h {\displaystyle h} and k {\displaystyle k} . In te... |
Wikipedia:Complex Lie algebra#0 | In mathematics, a complex Lie algebra is a Lie algebra over the complex numbers. Given a complex Lie algebra g {\displaystyle {\mathfrak {g}}} , its conjugate g ¯ {\displaystyle {\overline {\mathfrak {g}}}} is a complex Lie algebra with the same underlying real vector space but with i = − 1 {\displaystyle i={\sqrt {-1}... |
Wikipedia:Complex conjugate of a vector space#0 | In mathematics, the complex conjugate of a complex vector space V {\displaystyle V\,} is a complex vector space V ¯ {\displaystyle {\overline {V}}} that has the same elements and additive group structure as V , {\displaystyle V,} but whose scalar multiplication involves conjugation of the scalars. In other words, the s... |
Wikipedia:Complex dynamics#0 | Complex dynamics, or holomorphic dynamics, is the study of dynamical systems obtained by iterating a complex analytic mapping. This article focuses on the case of algebraic dynamics, where a polynomial or rational function is iterated. In geometric terms, that amounts to iterating a mapping from some algebraic variety ... |
Wikipedia:Complex network zeta function#0 | Different definitions have been given for the dimension of a complex network or graph. For example, metric dimension is defined in terms of the resolving set for a graph. Dimension has also been defined based on the box covering method applied to graphs. Here we describe the definition based on the complex network zeta... |
Wikipedia:Complex number#0 | In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted i, called the imaginary unit and satisfying the equation i 2 = − 1 {\displaystyle i^{2}=-1} ; every complex number can be expressed in the form a + b i {\displaystyle a+bi} , where a and b are... |
Wikipedia:Complex quadratic polynomial#0 | A complex quadratic polynomial is a quadratic polynomial whose coefficients and variable are complex numbers. == Properties == Quadratic polynomials have the following properties, regardless of the form: It is a unicritical polynomial, i.e. it has one finite critical point in the complex plane, Dynamical plane consist ... |
Wikipedia:Complex-base system#0 | In arithmetic, a complex-base system is a positional numeral system whose radix is an imaginary (proposed by Donald Knuth in 1955) or complex number (proposed by S. Khmelnik in 1964 and Walter F. Penney in 1965). == In general == Let D {\displaystyle D} be an integral domain ⊂ C {\displaystyle \subset \mathbb {C} } , a... |
Wikipedia:Compositio Mathematica#0 | Compositio Mathematica is a monthly peer-reviewed mathematics journal established by L.E.J. Brouwer in 1935. It is owned by the Foundation Compositio Mathematica, and since 2004 it has been published on behalf of the Foundation by the London Mathematical Society in partnership with Cambridge University Press. According... |
Wikipedia:Composition of relations#0 | In the mathematics of binary relations, the composition of relations is the forming of a new binary relation R ; S from two given binary relations R and S. In the calculus of relations, the composition of relations is called relative multiplication, and its result is called a relative product.: 40 Function composition ... |
Wikipedia:Compressed sensing#0 | Compressed sensing (also known as compressive sensing, compressive sampling, or sparse sampling) is a signal processing technique for efficiently acquiring and reconstructing a signal by finding solutions to underdetermined linear systems. This is based on the principle that, through optimization, the sparsity of a sig... |
Wikipedia:Computer algebra#0 | In mathematics and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. Although computer algebra could be consider... |
Wikipedia:Computer algebra system#0 | A computer algebra system (CAS) or symbolic algebra system (SAS) is any mathematical software with the ability to manipulate mathematical expressions in a way similar to the traditional manual computations of mathematicians and scientists. The development of the computer algebra systems in the second half of the 20th c... |
Wikipedia:Computing the permanent#0 | In linear algebra, the computation of the permanent of a matrix is a problem that is thought to be more difficult than the computation of the determinant of a matrix despite the apparent similarity of the definitions. The permanent is defined similarly to the determinant, as a sum of products of sets of matrix entries ... |
Wikipedia:Conchoid (mathematics)#0 | In geometry, a conchoid is a curve derived from a fixed point O, another curve, and a length d. It was invented by the ancient Greek mathematician Nicomedes. == Description == For every line through O that intersects the given curve at A the two points on the line which are d from A are on the conchoid. The conchoid is... |
Wikipedia:Conditional event algebra#0 | In probability theory, a conditional event algebra (CEA) is an alternative to a standard, Boolean algebra of possible events (a set of possible events related to one another by the familiar operations and, or, and not) that contains not just ordinary events but also conditional events that have the form "if A, then B".... |
Wikipedia:Conditional trigonometric identity#0 | In trigonometry, trigonometric identities are equalities that involve trigonometric functions and are true for every value of the occurring variables for which both sides of the equality are defined. Geometrically, these are identities involving certain functions of one or more angles. They are distinct from triangle i... |
Wikipedia:Conductance (graph theory)#0 | In theoretical computer science, graph theory, and mathematics, the conductance is a parameter of a Markov chain that is closely tied to its mixing time, that is, how rapidly the chain converges to its stationary distribution, should it exist. Equivalently, the conductance can be viewed as a parameter of a directed gra... |
Wikipedia:Conference graph#0 | In the mathematical area of graph theory, a conference graph is a strongly regular graph with parameters v, k = (v − 1)/2, λ = (v − 5)/4, and μ = (v − 1)/4. It is the graph associated with a symmetric conference matrix, and consequently its order v must be 1 (modulo 4) and a sum of two squares. Conference graphs are kn... |
Wikipedia:Conference matrix#0 | In mathematics, a conference matrix (also called a C-matrix) is a square matrix C with 0 on the diagonal and +1 and −1 off the diagonal, such that CTC is a multiple of the identity matrix I. Thus, if the matrix has order n, CTC = (n−1)I. Some authors use a more general definition, which requires there to be a single 0 ... |
Wikipedia:Conformable matrix#0 | In mathematics, a matrix is conformable if its dimensions are suitable for defining some operation (e.g. addition, multiplication, etc.). == Examples == If two matrices have the same dimensions (number of rows and number of columns), they are conformable for addition. Multiplication of two matrices is defined if and on... |
Wikipedia:Conformal dimension#0 | A dimension is a structure that categorizes facts and measures in order to enable users to answer business questions. Commonly used dimensions are people, products, place and time. (Note: People and time sometimes are not modeled as dimensions.) In a data warehouse, dimensions provide structured labeling information to... |
Wikipedia:Conformal linear transformation#0 | A conformal linear transformation, also called a homogeneous similarity transformation or homogeneous similitude, is a similarity transformation of a Euclidean or pseudo-Euclidean vector space which fixes the origin. It can be written as the composition of an orthogonal transformation (an origin-preserving rigid transf... |
Wikipedia:Conformal welding#0 | In mathematics, conformal welding (sewing or gluing) is a process in geometric function theory for producing a Riemann surface by joining together two Riemann surfaces, each with a disk removed, along their boundary circles. This problem can be reduced to that of finding univalent holomorphic maps f, g of the unit disk... |
Wikipedia:Congruence relation#0 | In abstract algebra, a congruence relation (or simply congruence) is an equivalence relation on an algebraic structure (such as a group, ring, or vector space) that is compatible with the structure in the sense that algebraic operations done with equivalent elements will yield equivalent elements. Every congruence rela... |
Wikipedia:Conical combination#0 | Given a finite number of vectors x 1 , x 2 , … , x n {\displaystyle x_{1},x_{2},\dots ,x_{n}} in a real vector space, a conical combination, conical sum, or weighted sum of these vectors is a vector of the form α 1 x 1 + α 2 x 2 + ⋯ + α n x n {\displaystyle \alpha _{1}x_{1}+\alpha _{2}x_{2}+\cdots +\alpha _{n}x_{n}} wh... |
Wikipedia:Conjugate (square roots)#0 | In mathematics, the conjugate of an expression of the form a + b d {\displaystyle a+b{\sqrt {d}}} is a − b d , {\displaystyle a-b{\sqrt {d}},} provided that d {\displaystyle {\sqrt {d}}} does not appear in a and b. One says also that the two expressions are conjugate. In particular, the two solutions of a quadratic equ... |
Wikipedia:Conjugate transpose#0 | In mathematics, the conjugate transpose, also known as the Hermitian transpose, of an m × n {\displaystyle m\times n} complex matrix A {\displaystyle \mathbf {A} } is an n × m {\displaystyle n\times m} matrix obtained by transposing A {\displaystyle \mathbf {A} } and applying complex conjugation to each entry (the comp... |
Wikipedia:Conley index theory#0 | In dynamical systems theory, Conley index theory, named after Charles Conley, analyzes topological structure of invariant sets of diffeomorphisms and of smooth flows. It is a far-reaching generalization of the Hopf index theorem that predicts existence of fixed points of a flow inside a planar region in terms of inform... |
Wikipedia:Conley–Zehnder theorem#0 | In mathematics, the Conley–Zehnder theorem, named after Charles C. Conley and Eduard Zehnder, provides a lower bound for the number of fixed points of Hamiltonian diffeomorphisms of standard symplectic tori in terms of the topology of the underlying tori. The lower bound is one plus the cup-length of the torus (thus 2n... |
Wikipedia:Connected Mathematics#0 | Connected Mathematics is a comprehensive mathematics program intended for U.S. students in grades 6–8. The curriculum design, text materials for students, and supporting resources for teachers were created and have been progressively refined by the Connected Mathematics Project (CMP) at Michigan State University with a... |
Wikipedia:Connectedness locus#0 | In one-dimensional complex dynamics, the connectedness locus of a parameterized family of one-variable holomorphic functions is a subset of the parameter space which consists of those parameters for which the corresponding Julia set is connected. == Examples == Without doubt, the most famous connectedness locus is the ... |
Wikipedia:Conny Palm#0 | Conrad "Conny" Rudolf Agaton Palm (May 31, 1907 – December 27, 1951) was a Swedish electrical engineer and statistician, known for several contributions to teletraffic engineering and queueing theory. == Education and career == Palm enrolled at the School of Electrical Engineering at the Royal Institute of Technology i... |
Wikipedia:Conservation form#0 | Conservation form or Eulerian form refers to an arrangement of an equation or system of equations, usually representing a hyperbolic system, that emphasizes that a property represented is conserved, i.e. a type of continuity equation. The term is usually used in the context of continuum mechanics. == General form == Eq... |
Wikipedia:Consistent and inconsistent equations#0 | In mathematics and particularly in algebra, a system of equations (either linear or nonlinear) is called consistent if there is at least one set of values for the unknowns that satisfies each equation in the system—that is, when substituted into each of the equations, they make each equation hold true as an identity. I... |
Wikipedia:Constant (mathematics)#0 | In mathematics, the word constant conveys multiple meanings. As an adjective, it refers to non-variance (i.e. unchanging with respect to some other value); as a noun, it has two different meanings: A fixed and well-defined number or other non-changing mathematical object, or the symbol denoting it. The terms mathematic... |
Wikipedia:Constant term#0 | In mathematics, a constant term (sometimes referred to as a free term) is a term in an algebraic expression that does not contain any variables and therefore is constant. For example, in the quadratic polynomial, x 2 + 2 x + 3 , {\displaystyle x^{2}+2x+3,\ } The number 3 is a constant term. After like terms are combine... |
Wikipedia:Constant-recursive sequence#0 | In mathematics, an infinite sequence of numbers s 0 , s 1 , s 2 , s 3 , … {\displaystyle s_{0},s_{1},s_{2},s_{3},\ldots } is called constant-recursive if it satisfies an equation of the form s n = c 1 s n − 1 + c 2 s n − 2 + ⋯ + c d s n − d , {\displaystyle s_{n}=c_{1}s_{n-1}+c_{2}s_{n-2}+\dots +c_{d}s_{n-d},} for all ... |
Wikipedia:Constantin Carathéodory#0 | Constantin Carathéodory (Greek: Κωνσταντίνος Καραθεοδωρή, romanized: Konstantinos Karatheodori; 13 September 1873 – 2 February 1950) was a Greek mathematician who spent most of his professional career in Germany. He made significant contributions to real and complex analysis, the calculus of variations, and measure the... |
Wikipedia:Constantin Climescu#0 | Constantin Climescu (30 November 1844 – 6 August 1926) was a Moldavian, later Romanian mathematician and politician. Born in Bacău, he attended the princely academy in Iași, followed by the sciences faculty of Iași University. He then left for the École Normale Supérieure in Paris, and in 1870, took his undergraduate d... |
Wikipedia:Constantin Corduneanu#0 | Constantin Corduneanu (23 April 1969, Iași – 15 April 2024, Târgu Mureș) was a Romanian freestyle wrestler who competed in the 1992 Summer Olympics and in the 1996 Summer Olympics. == Biography == Born into a poor family with eleven children, Corduneanu started wrestling at the Nicolina Sports Club in his hometown, Iaș... |
Wikipedia:Constantin Simirad#0 | Constantin Simirad (13 May 1941 – 28 March 2021) was a Romanian politician and academic. == Biography == Simirad was born on 13 May 1941 in Coțușca, Botoșani County. He graduated from Iași National College and the University of Iași. He first began teaching secondary school in Dorohoi from 1965 to 1968. In 1968, he bec... |
Wikipedia:Constructible polygon#0 | In mathematics, a constructible polygon is a regular polygon that can be constructed with compass and straightedge. For example, a regular pentagon is constructible with compass and straightedge while a regular heptagon is not. There are infinitely many constructible polygons, but only 31 with an odd number of sides ar... |
Wikipedia:Constructive analysis#0 | In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics. == Introduction == The name of the subject contrasts with classical analysis, which in this context means analysis done according to the more common principles of classical mathematics. However,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.