স্টিগলারের নিয়োম: সংশোধিত সংস্করণের মধ্যে পার্থক্য
ট্যাগ: মোবাইল সম্পাদনা মোবাইল ওয়েব সম্পাদনা |
(কোনও পার্থক্য নেই)
|
১৩:০৭, ৩১ ডিসেম্বর ২০১৮ তারিখে সংশোধিত সংস্করণ
টেমপ্লেট:Use dmy dates চিকাগো বিশ্বোবিদ্যালয়ের statistics শিক্ষক স্টিফেন স্টিগলার, ১৯৮০ সালে প্রোকাশিতো বোই stigler's law of eponyms-এ উপোরোক্ত বিষয়ে বিস্তারিতো বর্ণোনা দ্যান।[১] তিনি রবার্ট মার্টন, হুবার্ট কেনেডি, মার্ক টোয়েন, কার্ল বোয়ের, বাবা জর্জ স্টিগলার etc.দের দ্বারা ওনুপ্রানিতো হয়ে এটি লেখেন। সবার অ্যাকই বক্তব্যো, কাজ করে এ, নাম হয় ওর। [২]
মার্ক তোয়েন বোলেছেন, টেলিগ্রাফ/টেলিফোন/বাষ্পো ইঞ্জিন/ফোনোগ্রাফ/ফোটোগ্রাফ বা যেকোনো দরকারি জিনিস আবিষ্কার কোরতে হাজার হাজার মানুষ পোরিশ্রম কোরলেও সবাই শুধু অ্যাকজোন কেই মোনে রাখে।[৩][৪]
রবার্ট কে মার্টন বোলেছেন, eminent scientists (exএডিসন) get more credit than a comparatively unknown researcher, even if their work is similar, so that credit will usually be given to researchers who are already famous।[৫]
হুবার্ট কেনেডি ১৯৭২ সালে বোলেছিলেন, mathematical formulas-theorems are usually not named after their original discoverers।[৬]
Everything of importance has been said before by somebody who did not discover it[৭]
উদাহরোণ
- আহারোনভ–বোম ঘটোনা : সর্বোপ্রোথোম ১৯৪৯ সালে ওয়ার্নার এরেনবার্গ ও রেমন্ড ই. সিডে এটা আবিষ্কার করেন।
- আরহেনিয়াস সমীকরণ : ১৮৮৯ সালে জেকোবস হেনরিকেজ ভ্যান্ট হফ এটা আবিষ্কার করেন।
- অগার ঘটোনা : ১৯২২ সালে লিসে মেটনার আবিষ্কার করেন।
- অ্যাভোগ্রাডো সংখ্যা : অ্যাভোগ্রাডো মরার ৫৩ বছোর পর জিন ব্যাপটিস্ট পেরিন এর মান বের করেন।
- বেনফোর্ড নিয়োম : ১৮৮১ সালে সিমন নিউকোম্ব আবিষ্কার করেন।
- বেসমের পদ্ধতি : ১৮৫১ সালে উইলিয়াম কেলি আবিষ্কার করেন।[৮][৯]
- বেট্জ নিয়োম : ফ্রেডরিক ল্যানচেস্টার আবিষ্কার করেন।
- ব্লাউন্ট রোগ : ১৯২৩ সালে সি. মাউ।
- বার্নসাইড লেমা : দল থিওরির অ্যাক গনোনা পদ্ধতি, অগাস্টিন লুইস কচি ও ফার্ডিন্যান্ড জর্জ ফ্রোবেনিয়াস।[১০][১১]
- ক্যান্টোর–বার্নস্টেন–স্রোডার থিওরি : রিচার্ড ডেডেকিন্ড।
- ক্যান্টোর সেট : হেনরি জন স্টিফেন স্মিথ।
- ক্যারমিচেল সংখ্যা : ভ্যাকল্যাব সিমেরকা ১৮৮৫ সালে প্রথম সাতটা ক্যারমিচেল সংখ্যার তালিকা তৈরি করেন।[১২]
- কার্টান ম্যাট্রিক্স : উইলিয়াম কিলিং।
- কার্দানো নিয়োম : নিকোলা ফোন্টানা তার্তাগলিয়া।
- কর্গিটো এরগো যোগ :রেনে দেকার্তোর জন্মের ১০ বছোর আগেই আভিলা টেরেসা।[১৩]
- ক্যাভেন্ডিস সাম্যো : জন মিচেল।
- Chebyshev's inequality: Guarantees that, for a wide class of probability distributions, no more than a certain fraction of values can be more than a certain distance from the mean. It was first formulated by his friend and colleague Irénée-Jules Bienaymé in 1853 and proved by Chebyshev in 1867.
- Chernoff bound: A bound on the tail distribution of sums of independent random variables, named after Herman Chernoff but due to Herman Rubin,[১৪]
- Cobb–Douglas: A production function named after Paul H. Douglas, and Charles W Cobb, developed earlier by Philip Wicksteed.
- Cooley–Tukey algorithm named after J. W. Cooley and John Tukey but invented 160 years earlier in 1805 by Carl Friedrich Gauss.
- Curie point: a critical temperature of phase change in ferromagnetism. Named after Pierre Curie, who reported it in his thesis in 1895, but the phenomenon was found by Claude Pouillet before 1832.[১৫]
- Currying: a technique for transforming an n-arity function to a chain of functions. Named after Haskell Curry, though it was originally discovered by Moses Schönfinkel.
D
- Deming cycle of continuous improvement. Deming himself always referred to it as the "Shewhart cycle".
- Dyson spheres are named after Freeman Dyson, but Dyson himself has credited the original idea to Olaf Stapledon.
E
- Euler's number: the "discovery" of the constant itself is credited to Jacob Bernoulli, but it is named after Leonhard Euler.
- Euler's formula: an equivalent formula was proved by Roger Cotes 30 years before Euler published his proof.
F
- Farey sequence. Cauchy published the proof to a conjecture put forth by Farey. Unknown to both men, similar results were published earlier by Charles Haros.
- Fast Fourier transform. The algorithm proposed in 1965 by Cooley and Tukey to interpolate the coefficients of a polynomial from its evaluations in a quasi-linear number of multiplication was invented in 1805 by Gauss.
- Fermi's golden rule, a quantum mechanical calculation, was discovered by Paul Dirac.
- The Fermi paradox, stated by Konstantin Tsiolkovsky in 1933, long before Fermi.
- The Floyd–Warshall algorithm for finding shortest paths in a weighted graph is named after Robert Floyd and Stephen Warshall who independently published papers about it in 1962. However, Bernard Roy had previously published an equivalent algorithm in 1959.
- The Fraunhofer lines in the solar spectrum were first noted by William Hyde Wollaston twelve years before they were rediscovered and studied systematically by Joseph von Fraunhofer.
- Fresnel lens. The idea of creating a thinner, lighter lens by making it with separate sections mounted in a frame is often attributed to Georges-Louis Leclerc.
- Frobenius elements in a Galois group of global fields were first created by Dedekind.
- Fibonacci numbers. Fibonacci was not the first to discover the famous sequence. They existed in Indian mathematics since 200 BC (Fibonacci gave the series in 1202 AD)
G
- Gauss's theorem: first proved by Ostrogradsky in 1831.
- Gaussian distribution: the normal distribution was introduced by Abraham de Moivre in 1733, but named after Carl Friedrich Gauss who began using it in 1794.
- Gaussian elimination: was already in well-known textbooks such as Thomas Simpson's when Gauss in 1809 remarked that he used "common elimination."
- Gibbs phenomenon: named for Josiah Willard Gibbs who published in 1901. First discovered by Henry Wilbraham in 1851.
- The Graetz circuit, also known as the diode bridge, was invented and patented in 1896 by Karol Pollak a year before it was published by Leo Graetz.
- Gresham's law was described by Nicolaus Copernicus in 1519, the year of Thomas Gresham's birth.
- Gröbner basis: the theory was developed by Bruno Buchberger, who named them after his advisor, Wolfgang Gröbner
H
- Halley's comet was observed by astronomers since at least 240 BC, but named after Edmond Halley who computed its orbit and accurately predicted its return.
- Hasse diagrams were used by Henri Gustav Vogt three years before the birth of Helmut Hasse.
- Higgs field is named after Peter Higgs but was first theorized by Robert Brout and François Englert, albeit not published before Higgs had submitted his own paper.
- Hodrick–Prescott filter was popularized in the field of economics in the 1990s by economists Robert J. Hodrick and Nobel Memorial Prize winner Edward C. Prescott.[১৬] However, it was first proposed much earlier by E. T. Whittaker in 1923.[১৭]
- Hubble's law was derived by Georges Lemaître two years before Edwin Hubble.
J
- Jacobson's organ was first discovered by Frederik Ruysch before 1732.
- Joukowski transformation was first derived by Otto Blumenthal in 1913.
K
- Kasiski analysis: invented by Charles Babbage who recorded it in his diary but didn't otherwise publish it.
- Kepler's Supernova was first observed by Italian astronomers several days before Johannes Kepler
- Killing form: invented by Élie Cartan
- Kuiper belt: theoretically described by a number of astronomers before Gerard Kuiper; Kuiper theorized that such a belt no longer existed.
- Kodály method: was conceived and developed for music teaching by Jenő Ádám; a pupil of Kodály.
- Kronecker product: Johann Georg Zehfuss already in 1858 described the matrix operation we now know as the Kronecker product.
L
- L'Hôpital's rule to calculate the limit of quotient of functions at a point were both functions converge to 0 (or both converge to infinity) is named after Guillaume de l'Hôpital, but is generally believed to have been discovered by Johann Bernoulli.
- Lamarckism is generally used to refer to the idea of inheritance of acquired characteristics or soft inheritance, but the idea predates Jean-Baptiste Lamarck and was not the central part of his theory of transmutation of species.
- Lambert–Beer law was discovered by Pierre Bouguer.
- Laplace–Runge–Lenz vector was first discovered as a conserved quantity by Jakob Hermann and Johann Bernoulli.
- Leibniz formula for π: The formula was first discovered by 15th-century Indian mathematician Madhava of Sangamagrama, but it is named after Gottfried Leibniz after the latter discovered it independently 300 years later.
- Lexis diagram is named after Wilhelm Lexis but was previously theorized by Gustav Zeuner and Otto Brasche.
- The Liebig condenser, which Justus von Liebig popularized, was attributed to Göttling by Liebig himself, but had already been developed independently by Poisonnier, Weigel, and Gadolin.
- Lhermitte's sign in neurology, the "barber chair phenomenon" was first described by Pierre Marie and Chatelin. French neurologist Jean Lhermitte published his first report three years later.
- Linus's law: named after Linus Torvalds, but actually described by Eric S. Raymond in The Cathedral and the Bazaar.
M
- Madelung rule, describing the order in which electron orbitals are filled, named after Erwin Madelung but first discovered by Charles Janet.
- Matthew effect, named by Robert K. Merton after the writer of the Gospel of Matthew quoting the words of Jesus.
- Meadow's law, the formulation that one cot death in a family is tragic, two suspicious, and three murder, originally described by D.J. and V.J.M. Di Maio.
- Metropolis–Hastings algorithm. The algorithm was named after Nicholas Metropolis, who was the director of the Theoretical Division of Los Alamos National Laboratory at the time of writing the paper Equation of State Calculations by Fast Computing Machines. However, Metropolis did not contribute to that study in any way, as confirmed by various sources. The research problem was proposed by Augusta H. Teller and solved by Marshall N. Rosenbluth and Arianna W. Rosenbluth. Furthermore, according to Roy Glauber and Emilio Segrè, the original algorithm was invented by Enrico Fermi and reinvented by Stan Ulam.
N
- Newton's first and second laws of mechanics were known and proposed in separate ways by Galileo, Hooke and Huygens before Newton did in his Philosophiæ Naturalis Principia Mathematica. Newton owns the discovery of only the third one.[১৮]
- Norman's law, proposed by Donald Norman, is a general restatement of Stigler's Law, "No saying or pronouncement is named after its originator." This law was named for Norman as an example of Stigler's Law – which was, itself, not named after its originator.[১৯]
O
- The Oort cloud around the solar system was first postulated by Ernst Öpik in 1932 and independently introduced by Jan Oort in 1960.
- Olbers' paradox was formulated by Kepler in the 17th century, long before Olbers was born.
P
- Pascal's triangle: named after and discovered by Pascal, but identified several times before him independently.
- Pell's equation, studied in ancient India, but mistakenly attributed to John Pell by Leonhard Euler. Apparently Euler confused Lord Brouncker (first European mathematician to find a general solution of the equation) with Pell.
- Penrose triangle, an impossible object, first created by the Swedish artist Oscar Reutersvärd in 1934. The mathematician Roger Penrose independently devised and popularised it in the 1950s
- Playfair cipher, invented by Charles Wheatstone in 1854, but named after Lord Playfair who promoted its use.
- Poe's law, formally stated by Nathan Poe in 2005, but following Internet norms going back as far as Jerry Schwarz in 1983.
- The Poincaré disk model and the Poincaré half-plane model of hyperbolic geometry are named after Henri Poincaré who studied them in 1882. However, Eugenio Beltrami published a paper on these models previously in 1868.
- Poisson spot: predicted by Fresnel's theory of diffraction, named after Poisson, who ridiculed the theory, especially its prediction of the existence of this spot[২০]
- Prim's algorithm: the algorithm was developed in 1930, 27 years before Prim independently did, by the Czech mathematician Vojtěch Jarník.
- Prinzmetal angina: also known as variant angina, referring to angina (chest pain) caused by vasospasm of the coronary arteries. Described twice in the 1930s before being published by Prinzmetal in 1959.[২১][২২][২৩]
- Pythagorean theorem, named after the mathematician Pythagoras, although it was known before him to Babylonian mathematicians (although it is not known if the Babylonians possessed a proof of the result; yet it is not known either, whether Pythagoras proved the result).
R
- The Reynolds number in fluid mechanics was introduced by George Stokes, but is named after Osborne Reynolds, who popularized its use.
- Richards equation is attributed to Richards in his 1931 publication, but was earlier introduced by Richardson in 1922 in his book "Weather prediction by numerical process." (Cambridge University press. p. 262) as pointed out by John Knight and Peter Raats in "The contributions of Lewis Fry Richardson to drainage theory, soil physics, and the soil-plant-atmosphere continuum" EGU General Assembly 2016.
S
- The Sankey diagram was invented by Charles Joseph Minard
- The Schottky diode was neither discovered by Schottky nor its operation correctly explained by him. The actual nature of the metal–semiconductor junction was noted by Hans Bethe.
- Shuey's equation from 1985, which is an approximation of the Zoeprittz Equation first published in 1919.
- Simpson's paradox, a term introduced by Colin R. Blyth in 1972; but Edward Simpson did not actually discover this statistical paradox.
- The Simson line in geometry is named for Robert Simson, but cannot be found in Simson's works. Instead, it was first discovered by William Wallace in 1797.
- Snell's law of refraction, named after Willebrord Snellius, a Dutch scientist, also known as Descartes law of refraction (after René Descartes) was discovered by Ibn Sahl.
- the Snellius–Pothenot problem was solved by Willebrord Snellius only, and restated by Laurent Pothenot 75 years later
- Stigler's law, attributed by Stephen Stigler himself to Robert K. Merton
- Stirling's approximation, which was presaged in published work by Abraham de Moivre.
- Stokes's theorem discovered by Lord Kelvin
T
- The tetralogy of Fallot was described in 1672 by Niels Stensen, but named after Étienne-Louis Arthur Fallot who also described it in 1888.
- Taylor's law in ecology was discovered by H. Fairfield Smith in 1938 but named after L. R. Taylor who rediscovered it in 1961.
V
- Venn diagrams are named after John Venn, who popularized them in the 1880s, but Leonhard Euler had already introduced them in 1768.[২৪]
- Vigenère cipher was originally described by Giovan Battista Bellaso in his 1553 book La cifra del. Sig. Giovan Battista Bellaso, but later misattributed to Blaise de Vigenère in the 19th century.
- The Von Neumann architecture of computer hardware is misattributed to John von Neumann because he wrote a preliminary report called "First Draft of a Report on the EDVAC" that did not include the names of the inventors: John Mauchly and J. Presper Eckert
- Voronoi diagrams are named after Georgy Voronoy, who defined and studied the general n-dimensional case in 1908, but have already been used by Descartes (1644), Lejeune Dirichlet (1850) and Snow (1854).
W
- Wang tiles were hypothesized by Hao Wang not to exist, but an example was constructed by his student Robert Berger.
- Wheatstone bridge, an electrical measuring instrument invented by Samuel Hunter Christie in 1833, but named after Sir Charles Wheatstone who improved and popularized it in 1843.
- Widmanstätten patterns, named after Count Alois von Beckh Widmanstätten in 1808, but previously reported by William Thomson (mineralogist) in 1804.
- Wike's law of low odd primes, a principle of design of experiments, was stated by Sir Ronald A. Fisher in 1935 but named by Edwin Wike in 1973.
Y
- Yagi–Uda antenna, a successful and popular beam antenna, whose primary inventor was Shintaro Uda, but which was popularized by, and formerly popularly named for, his collaborator Hidetsugu Yagi.
Z
- Zipf's law states that given some corpus of natural language utterances, the frequency of any word is inversely proportional to its rank in the frequency table. The law is named after George Kingsley Zipf, an early twentieth century American linguist. Zipf popularized Zipf's law and sought to explain it, though he did not claim to have originated it.[২৫]
Similar cases
- Bailey–Borwein–Plouffe formula was discovered by Simon Plouffe, who has since expressed regret at having to share credit for his discovery.
This is a list of misnamed theorems in mathematics. It includes theorems (and lemmas, corollaries, conjectures, laws, and perhaps even the odd object) that are well known in mathematics, but which are not named for the originator. That is, these items on this list illustrate Stigler's law of eponymy (which is not, of course, due to Stephen Stigler, who credits Robert K Merton).
- Benford's law. This was first stated in 1881 by Simon Newcomb,[২৬] and rediscovered in 1938 by Frank Benford.[২৭] The first rigorous formulation and proof seems to be due to Ted Hill in 1988.[২৮]
- Bertrand's ballot theorem. This result concerning the probability that the winner of an election was ahead at each step of ballot counting was first published by W. A. Whitworth in 1878, but named after Joseph Louis François Bertrand who rediscovered it in 1887.[২৯]
- Bézout's theorem. The statement may have been made first by Isaac Newton in 1665. The matter of a proof was taken up by Colin MacLaurin (c. 1720) and Leonhard Euler as well as Étienne Bézout (c. 1750). However, Bézout's "proof" was incorrect. The first correct proof seems to be due mostly to Georges-Henri Halphen in the 1870s.[৩০]
- Burnside's lemma. This was stated and proved without attribution in Burnside's 1897 textbook,[৩১] but it had previously been discussed by Augustin Cauchy, in 1845, and by Georg Frobenius in 1887.
- Cayley–Hamilton theorem. The theorem was first proved in the easy special case of 2×2 matrices by Cayley, and later for the case of 4×4 matrices by Hamilton. But it was only proved in general by Frobenius in 1878.[৩২]
- Cramer's paradox. This was first noted by Colin Maclaurin in 1720, and then rediscovered by Leonhard Euler in 1748 (whose paper was not published for another two years, as Euler wrote his papers faster than his printers could print them). It was also discussed by Gabriel Cramer in 1750, who independently suggested the essential idea needed for the resolution, although providing a rigorous proof remained an outstanding open problem for much of the 19th century. Even though Cramer had cited Maclaurin, the paradox became known after Cramer rather than Maclaurin. Halphen, Arthur Cayley, and several other luminaries contributed to the earliest more or less correct proof. See [৩৩] for an excellent review.
- Cramer's rule. It is named after Gabriel Cramer (1704–1752), who published the rule in his 1750 Introduction à l'analyse des lignes courbes algébriques, although Colin Maclaurin also published the method in his 1748 Treatise of Algebra (and probably knew of the method as early as 1729).[৩৪]
- Frobenius theorem. This fundamental theorem was stated and proved in 1840 by Feodor Deahna.[৩৫] Even though Frobenius cited Deahna's paper in his own 1875 paper,[৩৬] it became known after Frobenius, not Deahna. See [৩৭] for a historical review.
- Heine–Borel theorem. This theorem was proved in 1872 by Émile Borel, not by Eduard Heine. Borel used techniques similar to those that Heine used to prove that continuous functions on closed intervals are uniformly continuous. Heine's name was attached because Schönflies noticed the similarity in Heine's and Borel's approaches. In fact, the theorem was first proved in 1852 by Peter Gustav Lejeune Dirichlet, but Lejeune Dirichlet's lecture notes were not published until 1904.[৩৮]
- L'Hôpital's rule. This rule first appeared in l'Hôpital's book L'Analyse des Infiniment Petits pour l'Intelligence des Lignes Courbes in 1696. The rule is believed to be the work of Johann Bernoulli since l'Hôpital, a nobleman, paid Bernoulli a retainer of 300 francs per year to keep him updated on developments in calculus and to solve problems he had. See L'Analyse des Infiniment Petits pour l'Intelligence des Lignes Courbes and reference therein.
- Maclaurin series. The Maclaurin series was named after Colin Maclaurin, a professor in Edinburgh, who published this special case of the Taylor series in 1742, but never claimed to have discovered it.[৩৯]
- Marden's theorem. This theorem relating the location of the zeros of a complex cubic polynomial to the zeros of its derivative was named by Dan Kalman after Kalman read it in a 1966 book by Morris Marden, who had first written about it in 1945.[৪০] But, as Marden had himself written, its original proof was by Jörg Siebeck in 1864.[৪১]
- Morrie's law. The name is due to physicist Richard Feynman, who used to refer to the identity under that name. Feynman picked that name because he had learned the law during his childhood from a boy with the name Morrie Jacobs.[৪২]
- Pell's equation. The solution of the equation x2 − dy2 = 1, where x and y are unknown positive integers and where d is a known positive integer which is not a perfect square, is ascribed to John Pell. It seems to have been discovered by Fermat, who set it as a challenge problem in 1657. The first European solution is found in a joint work in 1658 by John Wallis and Lord Brouncker; in 1668, a shorter solution was given in an edition of a third mathematician's work by Pell; see ref.[৪৩] The first rigorous proof may be due to Lagrange. The misnomer apparently came about when Euler confused Brouncker and Pell; see [৪৪] for an extensive account of the history of this equation.
- Poincaré lemma. This was mentioned in 1886 by Henri Poincaré,[৪৫] but was first proved in a series of 1889 papers by the distinguished Italian mathematician Vito Volterra. Nonetheless it has become known after Poincaré. See [৩৭] for the twisted history of this lemma.
- Pólya enumeration theorem. This was proven in 1927 in a difficult paper by J. H. Redfield.[৪৬] Despite the prominence of the venue (the American Journal of Mathematics), the paper was overlooked. Eventually, the theorem was independently rediscovered in 1936 by George Pólya.[৪৭] Not until 1960 did Frank Harary unearth the much earlier paper by Redfield. See [৪৮] for historical and other information.
- Stokes' theorem. It is named after Sir George Gabriel Stokes (1819–1903), although the first known statement of the theorem is by William Thomson (Lord Kelvin) and appears in a letter of his to Stokes. The theorem acquired its name from Stokes' habit of including it in the Cambridge prize examinations. In 1854 he asked his students to prove the theorem in an examination; it is not known if anyone was able to do so.[৪৯]
- Zorn's lemma is named for Max Zorn. Much work on the theorem now known as Zorn's lemma, and on several closely related formulations such as the Hausdorff maximal principle, was done between 1907 and 1940 by Zorn, Brouwer, Hausdorff, Kuratowski, R. L. Moore, and others. But the particular theorem now known as "Zorn's lemma" was never proved by Zorn, and in any event Zorn's results were anticipated by Kuratowski. The theorem was discovered by Chevalley in 1936, and published and attributed to Zorn by him in Bourbaki's Théorie des Ensembles in 1939. A very similar result was anticipated by S. Bochner in 1928.[৫০]
আরো দেখুন
- Stigler, George J. (১৯৮২a)। The Economist as Preacher, and Other Essays। Chicago: The University of Chicago Press। আইএসবিএন 0-226-77430-9।
- Stigler, Stephen M. (১৯৮০)। Gieryn, F., সম্পাদক। "Stigler's law of eponymy"। Transactions of the New York Academy of Sciences। 39: 147–58। ডিওআই:10.1111/j.2164-0947.1980.tb02775.x। (Festschrift for Robert K. Merton)
- Stigler, Stephen M. (১৯৮৩)। "Who discovered Bayes's theorem?"। The American Statistician। 37 (4): 290–6। ডিওআই:10.2307/2682766।
- Kern, Scott E (সেপ্টেম্বর–অক্টোবর ২০০২)। "Whose Hypothesis? Ciphering, Sectorials, D Lesions, Freckles and the Operation of Stigler's Law"। Cancer Biology & Therapy। Landes Bioscience। 1 (5): 571–581। আইএসএসএন 1555-8576। ডিওআই:10.4161/cbt.1.5.225। সংগ্রহের তারিখ ২৮ মার্চ ২০০৯।
External links
- Miller, Jeff। "Eponymy and Laws of Eponymy"। on Miller, Jeff। "Earliest known uses of some of the words of mathematics"।
- Malcolm Gladwell (১৯ ডিসেম্বর ২০০৬)। "In the Air: Who says big ideas are rare?"। The New Yorker। সংগ্রহের তারিখ ৬ মে ২০০৮। Stigler's law is described near the end of the article
References
- ↑ Gieryn, T. F., সম্পাদক (১৯৮০)। Science and social structure: a festschrift for Robert K. Merton। New York: NY Academy of Sciences। পৃষ্ঠা 147–57। আইএসবিএন 0-89766-043-9। , republished in Stigler's collection "Statistics on the Table"
- ↑ For example Henry Dudeney noted in his 1917 *Amusements in Mathematics* solution 129 that Pell's equation was called that "because Pell neither first propounded the question nor first solved it!"
- ↑ "Letter to Helen Keller"। Perkins Archives। ১৯০৩।
- ↑ Diamond Jr., Arthur M (December 2005, pp 639 – 640). "Measurement, Incentives, and Constraints in Stigler’s Economics of Science". The European Journal of the History of Economic Thought 12 (4) pp 635 – 661. Accessed at Art Diamond's Web Site. Retrieved 12 January 2015.
- ↑ Merton, Robert K. (৫ জানুয়ারি ১৯৬৮)। "The Matthew Effect in Science"। Science। 159: 56–63। ডিওআই:10.1126/science.159.3810.56। পিএমআইডি 17737466। বিবকোড:1968Sci...159...56M।
- ↑ Kennedy, H.C. (জানুয়ারি ১৯৭২)। "Who Discovered Boyer's Law?"। The American Mathematical Monthly। 79 (1): 66–67। ডিওআই:10.2307/2978134।
- ↑ Menand, Louis (১৯ ফেব্রুয়ারি ২০০৭)। "Notable Quotables"। The New Yorker। সংগ্রহের তারিখ ২৭ মার্চ ২০০৯।
- ↑ "Bessemer process"। Encyclopædia Britannica। 2। ২০০৫। পৃষ্ঠা 168।
- ↑ "Kelly, William"। Encyclopædia Britannica। 6। ২০০৫। পৃষ্ঠা 791।
- ↑ Heath, I. "Unacceptable File Operations in a Relational Database." Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access, and Control, San Diego, California (November 11–12, 1971).
- ↑ Date, C.J. Database in Depth: Relational Theory for Practitioners. O'Reilly (2005), p. 142.
- ↑ Lemmermeyer, F. (২০১৩)। "Václav Šimerka: quadratic forms and factorization"। LMS Journal of Computation and Mathematics। 16: 118–129। ডিওআই:10.1112/S1461157013000065
।
- ↑ https://www.nytimes.com/2017/09/25/opinion/descartes-is-not-our-father.html।
|শিরোনাম=
অনুপস্থিত বা খালি (সাহায্য) - ↑ Chernoff, Herman (২০১৪)। "A career in statistics" (পিডিএফ)। Lin, Xihong; Genest, Christian; Banks, David L.; Molenberghs, Geert; Scott, David W.; Wang, Jane-Ling। Past, Present, and Future of Statistics। CRC Press। পৃষ্ঠা 35। আইএসবিএন 9781482204964।
- ↑ Grimmett, Geoffrey (২০০৬)। "Random‑Cluster Measures" (পিডিএফ)। The Random‑Cluster Model। Grundlehren der Mathematischen Wissenschaften। Springer। পৃষ্ঠা 6। আইএসএসএন 0072-7830। আইএসবিএন 978-3-540-32891-9। এলসিসিএন 2006925087। ওএল 4105561W। ওসিএলসি 262691034। ডিওআই:10.1007/978-3-540-32891-9_1। ২০১৬-০২-১৩ তারিখে মূল থেকে আর্কাইভ করা।
There is a critical temperature for this phenomenon, often called the Curie point after Pierre Curie, who reported this discovery in his 1895 thesis ... In an example of Stigler’s Law ... the existence of such a temperature was discovered before 1832 by [Claude] Pouillet....
- ↑ Hodrick, Robert, and Edward C. Prescott (1997), "Postwar U.S. Business Cycles: An Empirical Investigation," Journal of Money, Credit, and Banking, 29 (1), 1–16.
- ↑ Whittaker, E. T. (1923): On a new method of graduation, Proceedings of the Edinburgh Mathematical Association, 78, 81–89 – as quoted in Philips 2010
- ↑ Cf. Clifford A. Pickover, De Arquímides a Hawking,p. 137
- ↑ PhD-Design Discussion List, 7 January 2013, https://www.jiscmail.ac.uk/cgi-bin/webadmin?A2=ind1301&L=phd-design&D=0&P=11022
- ↑ Physics, Robert Resnick, David Halliday, Kenneth S. Krane. volume 4, 4th edition, chapter 46
- ↑ Parkinson, J, Bedford, DE. Electrocardiographic changes during brief attacks of angina pectoris. Lancet 1931; 1:15.
- ↑ Brow, GR, Holman, DV. Electrocardiographic study during a paroxysm of angina pectoris. Am Heart J 1933; 9:259.
- ↑ Prinzmetal, M, Kennamer, R, Merliss, R, et al. A variant form of angina pectoris. Preliminary report. Am Heart J 1959; 27:375.
- ↑ Grattan-Guinness, Ivor (1997): The Rainbow of Mathematics, pp. 563–564. New York, W. W. Norton.
- ↑ Powers, David M W (১৯৯৮)। "Applications and explanations of Zipf's law"। Association for Computational Linguistics: 151–160।
- ↑ Newcomb, S. (১৮৮১)। "Note on the frequency of use of the different digits in natural numbers"। Amer. J. Math.। The Johns Hopkins University Press। 4 (1): 39–40। জেস্টোর 2369148। ডিওআই:10.2307/2369148।
- ↑ Benford, F. (১৯৩৮)। "The law of anomalous numbers"। Proc. Am. Philos. Soc.। 78: 551–572।
- ↑ Hill, Theodore P. (এপ্রিল ১৯৯৫)। "The Significant Digit Phenomenon"। Amer. Math. Monthly। Mathematical Association of America। 102 (4): 322–327। জেস্টোর 2974952। ডিওআই:10.2307/2974952।
- ↑ Feller, William (১৯৬৮), An Introduction to Probability Theory and its Applications, Volume I (3rd সংস্করণ), Wiley, পৃষ্ঠা 69 .
- ↑ Bix, Robert (১৯৯৮)। Conics and Cubics। Springer। আইএসবিএন 0-387-98401-1।
- ↑ Burnside, William (১৮৯৭)। Theory of groups of finite order। Cambridge University Press।
- ↑ Grattan-Guinness, Ivor (২০০২), Companion Encyclopaedia of the History and Philosophy of the Mathematical Sciences, Routledge, পৃষ্ঠা 779–780, আইএসবিএন 9781134957507 .
- ↑ Scott, Charlotte Agnas (মার্চ ১৮৯৮)। "On the Intersection of Plane Curves"। Bull. Am. Math. Soc.। 4 (6): 260–273। ডিওআই:10.1090/S0002-9904-1898-00489-5।
- ↑ Carl B. Boyer (১৯৬৮)। A History of Mathematics, 2nd edition। Wiley। পৃষ্ঠা 431।
- ↑ Deahna, F. (১৮৪০)। "Über die Bedingungen der Integrabilität"। J. Reine Angew. Math.। 20: 340–350।
- ↑ Frobenius, Georg (১৮৯৫)। "Ūber das Pfaffsche Problem"। J. Reine Angew. Math.: 230–315।
- ↑ ক খ Samelson, Hans (জুন–জুলাই ২০০১)। "Differential Forms, the Early days; or the Stories of Deahna's Theorem and of Volterra's Theorem"। Amer. Math. Monthly। Mathematical Association of America। 108 (6): 522–530। জেস্টোর 2695706। ডিওআই:10.2307/2695706।
- ↑ Sundström, Manya Raman (২০১০)। "A pedagogical history of compactness"। পৃষ্ঠা 7। arXiv:1006.4131v1
[math.HO]।
- ↑ Thomas & Finney। Calculus and Analytic Geometry।
- ↑ Kalman, Dan (২০০৮), "An Elementary Proof of Marden's Theorem", The American Mathematical Monthly, 115: 330–338, আইএসএসএন 0002-9890
- ↑ Siebeck, Jörg (১৮৬৪), "Über eine neue analytische Behandlungweise der Brennpunkte", Journal für die reine und angewandte Mathematik, 64: 175–182, আইএসএসএন 0075-4102
- ↑ W.A. Beyer, J.D. Louck, and D. Zeilberger, A Generalization of a Curiosity that Feynman Remembered All His Life, Math. Mag. 69, 43–44, 1996.
- ↑ Cajori, Florian (১৯৯৯)। A History of Mathematics। New York: Chelsea। আইএসবিএন 0-8284-0203-5। (reprint of fifth edition, 1891).
- ↑ Whitford, Edward Everett (১৯১২)। The Pell Equation। New York: E. E. Whitford। This is Whitford's 1912 Ph.D. dissertation, written at Columbia University and published at his own expense in 1912.
- ↑ Poincaré, H. (১৮৮৬–১৮৮৭)। "Sur les residus des intégrales doubles"। Acta Math.। 9: 321–380। ডিওআই:10.1007/BF02406742।
- ↑ Redfield, J. H. (১৯২৭)। "The theory of group related distributions"। Amer. J. Math.। The Johns Hopkins University Press। 49 (3): 433–445। জেস্টোর 2370675। ডিওআই:10.2307/2370675।
- ↑ Pólya, G. (১৯৩৬)। "Algebraische Berechnung der Isomeren einiger organischer Verbindungen"। Zeitschrift für Kristallographie। 93: 414। ডিওআই:10.1524/zkri.1936.93.1.415।
- ↑ Read, R. C. (ডিসেম্বর ১৯৮৭)। "Pólya's Theorem and its Progeny"। Mathematics Magazine। 60 (5): 275–282। জেস্টোর 2690407। ডিওআই:10.2307/2690407।
- ↑ Victor J. Katz (মে ১৯৭৯)। "The History of Stokes' Theorem"। Mathematics Magazine। 52 (3): 146–156। জেস্টোর 2690275। ডিওআই:10.2307/2690275।
- ↑ Campbell, Paul J. (১৯৭৮)। "The Origin of 'Zorn's Lemma'"। Historia Mathematica। 5: 77–89। ডিওআই:10.1016/0315-0860(78)90136-2।
![]() | এই তালিকাটি অসম্পূর্ণ; এটি সম্প্রসারণ করে আপনি সাহায্য করতে পারেন। (February 2011) |