Search results

...rocess]] involving [[eigenvalues and eigenvectors]].<ref>{{harvtxt|Bronson|1970|pp=179–183}}</ref> ...genvectors of <math>A</math> as columns in <math>M</math>. It is utilized in the [[matrix similarity|similarity transformation]] ...

...ty]] on the [[absolute dimension]] of a [[differential algebraic variety]] in terms of its defining equations. The inequality is the differential algebraic analog of [[Bézout's theorem]] in affine space. ...

*[[Sharon Corr]] (born 1970), Irish musician ==Places in Ireland== ...

{{Short description|Special type of functions in mathematics}} ...(1964).</ref>) are involved in the solution of the [[Helmholtz equation]] in [[oblate spheroidal coordinates]]. When solving this equation, ...

...raic K-theory]] and [[group theory]]. His career was spent as a professor in the Department of Mathematics at [[Cornell University]]. Dennis was the ex ...rs/roger-keith-dennis Roger Keith Dennis] Member: School of Mathematics 9/1970 – 8/1971, IAS</ref> ...

...the original. Asano contractions have also been used to study polynomials in graph theory. ...gene|title=Location of the Lee–Yang zeros and absence of phase transitions in some Ising spin systems|journal=Journal of Mathematical Physics|date=2012|v ...

...graph]] with 12 vertices and 24 edges, discovered by [[Václav Chvátal]] in 1970. It is the smallest graph that is [[triangle-free graph|triangle-free]], [[ ...exist <math>k</math>-chromatic graphs with girth <math>\ell</math>.{{r|e}} In connection with these two results and several examples including the Chváta ...

{{short description|Method in number theory}} ...title= Probabilistic Algorithms in Finite Fields |journal= SIAM Journal on Computing |year= 1980 |volume= 9 |issue= 2 |pages = 273–280 |issn = 0097-5397 |doi = ...

...l for refining their decision knowledge and facilitating knowledge sharing in a scalable manner. ...tion|year=1970}}</ref> Following the de facto international standard (CSA, 1970), a decision table contains three building blocks: the conditions, the acti ...

{{Short description|Algorithm for computing the maximal flow of a network}} ...e [[Edmonds–Karp algorithm]], which runs in <math>O(|V||E|^2)</math> time, in that it uses shortest augmenting paths. The introduction of the concepts of ...

In [[finite geometry]], '''Lam's problem''' is the problem of determining if a ...thorough investigation of this case is currently beyond the facilities of computing machines.}}</ref> ...

...0-557-07520-1 }} (see also [http://lib.izdatelstwo.com/Papers2/s7.pdf here in Russian])</ref> ...the X-axis – as vector rotation about axes, etc.<ref name="Malinovsky"/> In 1966 Khmelnik had proposed a functions coding method,<ref name="Khmelnik1"/ ...

...red structures and partitions as a Ph.D. student at [[Harvard University]] in 1971 under the guidance of [[Gian-Carlo Rota]]. ...tially ordered set|poset]] with <math>p</math> elements denoted <math>x,y \in P</math>, and let <math>[n]=\{1<2<\ldots<n\}</math> be a [[total order|chai ...

{{AFC comment|1=From both his publication record and being an editor in chief he passes [[WP:NPROF]]; I do not agree with the prior statements. How Jim Pitman (James W. Pitman) was born in Hobart, Australia, in June 1949, ...

...able|table lookup]] with [[exclusive or]] operations. It was first studied in the form of [[Zobrist hashing]] for computer games; later work by Carter an ...theoretical properties that distinguish it from some other hash functions. In particular, it is [[k-independent hashing|3-independent]]: every 3-tuple of ...

{{Short description|Number of edge slopes in graph drawing}} ...dges in a drawing of the graph in which vertices are represented as points in the [[Euclidean plane]] and edges are represented as [[line segment]]s that ...

{{Short description|Concept in graph theory mathematics}} ...rnal|last=Yen|first=Jin Y.|title=Finding the ''k'' Shortest Loopless Paths in a Network|journal= Management Science|date=Jul 1971|volume=17|issue=11|page ...

The LOOP language was formulated in a 1967 paper by [[Albert R. Meyer]] and [[Dennis M. Ritchie]].{{sfn|Meyer|R In contrast to [[Goto|GOTO]] programs and [[While_loop|WHILE]] programs, LOOP ...

{{Short description|Node labeling problem in graph theory}} ...h|f(v_i)}} so that the quantity <math>\max\{\,| f(v_i) - f(v_j)| : v_iv_j \in E \,\}</math> is minimized ({{mvar|E}} is the edge set of {{mvar|G}}).<ref> ...

...nt sets in matroid sums, and to compute the largest common independent set in the [[matroid intersection|intersection]] of two given matroids.<ref name=" | series = Wiley-Interscience Series in Discrete Mathematics and Optimization ...