41. AHET: AHE: Conjectures And Reputations AHE conjectures and Reputations. Coauthor Title conjectures and ReputationsThe Sociology of Scientific Knowledge and the History of Economic Thought. http://www.eh.net/HE/abstracts/library/0025.html

AHE: Conjectures and Reputations From: D. Wade Hands ( hands@ups.edu Date: Fri May 15 1998 - 19:06:27 EDT Next message: John B. Davis: "AHE: The Economics of Scientific Knowledge" Previous message: Robert Leeson: "AHE: The Eclipse of the Goal of Zero Inflation" Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] EHS Abstract Submission (c) 1997 EH.Net Name: D. Wade Hands Email: hands@ups.edu Institution: University of Puget Sound Co-author: Title: Conjectures and Reputations: The Sociology of Scientific Knowledge and the History of Economic Thought Type of work: C Internet Address of abstracted work: By mail: D. Wade Hands Economics Department University of Puget Sound 1500 North Warner, Tacoma, WA 98416-0140 Language: English Abstract: The Sociology of Scientific Knowledge (SSK) has expanded rapidly during the last two decades and is now considered to be one of the most influential approaches to the study of scientific knowledge. The purpose of this paper is to examine

42. LP: Sample Proofs: Sample Conjectures LP, the Larch Prover Sample proofs sample conjectures. The order inwhich we have stated these conjectures is not completely arbitrary. http://nms.lcs.mit.edu/Larch/LP/misc/sample_conjectures.html

LP, the Larch Prover Sample proofs: sample conjectures We will illustrate LP's proof mechanisms by proving the following sample conjectures: Except for the fourth, the sample conjectures are like the sample axioms: they are either formulas or induction rules. The fourth, , is an abbreviation for the conjunction of the associative and commutative laws for the operator. It provides LP with useful operational information. For example, it allows LP to conclude that is the same set as ; hence the third conjecture shows that both of these sets are the same as x The order in which we have stated these conjectures is not completely arbitrary. As we shall see, some of them are used to prove conjectures appearing later in the list.

43. LP: Hints On Formalizing Axioms And Conjectures LP, the Larch Prover Hints on formalizing axioms and conjectures.Be careful not to confuse variables and constants. If x is a http://nms.lcs.mit.edu/Larch/LP/misc/hints_formalizing.html

LP, the Larch Prover Hints on formalizing axioms and conjectures Be careful not to confuse variables and constants . If x is a variable and c is a constant, then e(x) is a stronger assertion than e(c) . The first means . In the absence of other assertions involving c , the second only implies . If you don't know whether an identifier is a variable or a constant, type display symbols to find out. Be careful about the use of free variables in formulas. The formula correctly (albeit awkwardly) expresses the fact that the empty set is a subset of any set. However, its converse, , does not express the fact that any set that is a subset of all sets must be the empty set. That fact is expressed by the equivalent formulas and An axiom or conjecture of the form when A yield B has the same logical content as one of the form A => B , but different operational content. Given the axiomization declare variable x: Bool declare operators a: -> Bool f, g, h: Bool -> Bool .. assert when f(x) yield g(x); g(x) => h(x); f(a) .. LP will automatically derive the fact g(a) from f(a) by applying the deduction rule , but it will not derive h(a) from g(a) unless it is instructed to compute critical-pairs A multiple-hypothesis deduction rule of the form when A, B yield C

44. My Conjectures Some conjectures of Mine and Others. These conjectures are all originalbut I make no claims of priority. The conjectures concern http://www.mast.queensu.ca/~wehlau/Conjectures.html

Some Conjectures of Mine and Others These conjectures are all original but I make no claims of priority. The conjectures concern modular invariant theory and many of them concern the Noether number. They are expressed using standard notation and definitions Conjecture 1: Let G be a finite group. Let R denote k [V] G and let I denote the image of the transfer homomorphism. b b (R/ sqrt(I) Conjecture 2: Let G be a finite p-group where k is of characteristic p > 0. If Im Tr G is a principal ideal then k [V] G is a polynomial ring. Jim Shank and I proved the converse of this conjecture when k is the prime field F p =GF(p) . Since then Bram Broer has proved the converse for general fields k of characteristic p. No 3's Conjecture: Let V p denote the regular representation of the cyclic group Z/p over the finite field of prime order F p . Jim Shank and I have conjectured that b F p [V p Z/p ) = 2p-3. We have proven that b F p [V p Z/p F p [V p Z/p is generated by the orbit sums of the monomials which have no exponent exceeding 2. This latter conecture would imply that b F p [V p Z/p Conjecture 4 b k [W] G b k [V] G ). Jim Shank and I have proven this conjecture for G=Z/p.

45. The Seattle Times: Business & Technology: Tech Conjectures May Be Hits, Mrs. Download Tech conjectures may be hits, Mrs. Compiledby Seattle Times technology staff, http://seattletimes.nwsource.com/html/businesstechnology/134596554_btdownload16.

HOME Site index Monday, December 16, 2002 - 12:00 a.m. Pacific Weekly interest and loan rates Consumer affairs Northwest stock contest PR Newswire ... More special projects Download Tech conjectures may be hits, Mrs. Compiled by Seattle Times technology staff E-mail this article Print this article Search web archive At WSA's annual predictions dinner last week, Mark Anderson of the Strategic News Service said Wi-Fi, the fast-spreading high-speed wireless networking technology, would break the phone companies' monopoly on last-mile connections and help reawaken the badly bruised telecommunications sector. University of Washington ; PS Reilly of The Athena Institute ; and Martin Reynolds of the Gartner Group They made a host of predictions, some more believable than others. Reynolds said the day of the big computer virus is over, but none of the audience seemed to agree. Device heavy Internet appliances, including Web-enabled game consoles, PDAs and other devices, are expected to reach a market value of $14 billion this year. Source: Allied Business Intelligence Anderson, once a skeptic of

46. §11. Conjectures And Restorations Of Pope. XI. The Text Of Shakespeare. Vol. 5. XI. The Text of Shakespeare . § 11. conjectures and restorationsof Pope. Many of his conjectures have been generally accepted. http://www.bartleby.com/215/1111.html

Select Search All Bartleby.com All Reference Columbia Encyclopedia World History Encyclopedia World Factbook Columbia Gazetteer American Heritage Coll. Dictionary Roget's Thesauri Roget's II: Thesaurus Roget's Int'l Thesaurus Quotations Bartlett's Quotations Columbia Quotations Simpson's Quotations English Usage Modern Usage American English Fowler's King's English Strunk's Style Mencken's Language Cambridge History The King James Bible Oxford Shakespeare Gray's Anatomy Farmer's Cookbook Post's Etiquette Bulfinch's Mythology Frazer's Golden Bough All Verse Anthologies Dickinson, E. Eliot, T.S. Frost, R. Hopkins, G.M. Keats, J. Lawrence, D.H. Masters, E.L. Sandburg, C. Sassoon, S. Whitman, W. Wordsworth, W. Yeats, W.B. All Nonfiction Harvard Classics American Essays Einstein's Relativity Grant, U.S. Roosevelt, T. Wells's History Presidential Inaugurals All Fiction Shelf of Fiction Ghost Stories Short Stories Shaw, G.B. Stein, G. Stevenson, R.L. Wells, H.G. Reference Cambridge History The Drama to 1642, Part One The Text of Shakespeare ... BIBLIOGRAPHIC RECORD The Cambridge History of English and American Literature in 18 Volumes Volume V. The Drama to 1642, Part One.

47. DIMACS Working Group On Computer-Generated Conjectures From Graph Theoretic And Working Group on ComputerGenerated conjectures from Graph Theoreticand Chemical Databases I. ( Please visit Working Group Home Page ). http://dimacs.rutgers.edu/SpecialYears/2001_Data/Conjectures/

Working Group on Computer-Generated Conjectures from Graph Theoretic and Chemical Databases I ( Please visit: Working Group Home Page Working Group Meeting: November 12 -16, 2001 Public Workshop: Graph Theory Day, Saturday, November 10, 2001 Location: DIMACS Center, CoRE Building, Rutgers University Organizers: Patrick Fowler , University of Exeter, P.W.Fowler@exeter.ac.uk Pierre Hansen , GERAD - Ecole des Hautes Etudes Commerciales, pierreh@crt.umontreal.ca Description of the goals of the working group. List of participants in the working group. Program References related to the working group. Public Workshop: Graph Theory Day 42, Saturday, November 10, 2001 Information on Accommodations A block of rooms has been reserved at the Holiday Inn, South Plainfield, New Jersey for this event. You must contact the hotel directly and make the reservation. Identify yourself as being with a DIMACS event and you will get the discounted rate of $92 per night. Please click on the link for 'Information on Accommodations' above for details on the phone number and address for the hotel. There are other accommodations in the area, but we recommend the Holiday Inn. Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the workshop.

48. DIMACS Working Group On Computer-Generated Conjectures From Graph Theoretic And Working Group on ComputerGenerated conjectures from Graph Theoretic andChemical Databases I. Software for Automatic Generation of conjectures. http://dimacs.rutgers.edu/SpecialYears/2001_Data/Conjectures/conjecturesdescript

Working Group on Computer-Generated Conjectures from Graph Theoretic and Chemical Databases I Working Group Meeting: November 12 -16, 2001 Public Workshop: Graph Theory Day, Saturday, November 10, 2001 Location: DIMACS Center, CoRE Building, Rutgers University Organizers: Patrick Fowler , University of Exeter, P.W.Fowler@exeter.ac.uk Pierre Hansen , GERAD - Ecole des Hautes Etudes Commerciales, pierreh@crt.umontreal.ca The Process of Discovery in the Mathematical Sciences The process of scientific discovery is a very complex one. Computers can aid human beings in the process and, as has been a goal of researchers in artificial intelligence, in an automatic way. In the mathematical sciences, discovery can be thought to have three components: development of conjectures, formation of new concepts, and proving of theorems or disproving of conjectures. There has been a large amount of research done on automatic theorem proving. Here, we concentrate on the use of the computer as a tool in generating conjectures, whether in an automated way or as a tool used interactively by a person. Software for Automatic Generation of Conjectures The use of computers in scientific discovery, and in particular in the development of mathematical conjectures, is not new. The paper by Larsen [

49. EuroWorkshop - CONJECTURES, RECENT RESULTS AND OPEN PROBLEMS RELATED TO THE MACD Isaac Newton Institute for Mathematical Sciences, Cambridge, UK. EuroWorkshop. conjectures,RECENT RESULTS AND OPEN PROBLEMS RELATED TO THE MACDONALD POLYNOMIALS. http://www.newton.cam.ac.uk/programs/SFM/sfmw01.html

Isaac Newton Institute for Mathematical Sciences, Cambridge, UK EuroWorkshop CONJECTURES, RECENT RESULTS AND OPEN PROBLEMS RELATED TO THE MACDONALD POLYNOMIALS 8 –12 January 2001 Programme Participants Organisers: Professor P Hanlon, Professor IG Macdonald and Professor AO Morris. The overall programme: In the 1980s, IG Macdonald formulated a series of conjectures which predicted the constant terms of expressions that involve an important new class of symmetric functions called the Macdonald polynomials Since their introduction, these conjectures and polynomials have been a central topic of study in Algebraic Combinatorics. Of particular note has been the variety of approaches used in efforts to solve the conjectures or to find an algebraic or geometric interpretation for the Macdonald polynomials themselves. Different approaches involve double affine Hecke algebras, homology of nilpotent Lie algebras, generalized traces of Lie algebra representations and diagonal actions of the symmetric group on polynomial rings in two sets of variables. In this programme we will attempt to unify these different approaches to the Macdonald polynomials and some of the outstanding conjectures that have resulted from this work.

50. Conjectures And Conjectural Emendation conjectures and Conjectural Emendation. The New Testament is full of difficult readings. Asa result, at least two other conjectures were offered for the name. http://www.skypoint.com/~waltzmn/Conjectures.html

Conjectures and Conjectural Emendation The New Testament is full of difficult readings. There are probably hundreds of places where one scholar or another has argued that the text simply cannot be construed. Westcott and Hort, for instance, marked some five dozen passages with an asterisk as perhaps containing a primitive error. (A list of these passages is found in note 2 on page 184 of the second/third edition of Bruce M. Metzger's The Text of the New Textament.) Not all of these are nonsense, but all are difficult in some way. In classical textual criticism , the response to such "nonsense" readings is usually conjectural emendation the attempt to imagine what the author actually wrote. Such an emendation, to be successful, must of course fit the author's style and the context. It should also, ideally, explain how the "impossible" reading arose. The use of conjectural emendation in the classics especially those which survive only in single manuscripts can hardly be questioned. Even if we assume that there is no editorial activity, scribal error is always present. Thus, for instance, in Howell D. Chickering, Jr.'s edition of Beowulf

51. The Kac-Weisfeiler Conjectures next Next Bibliography. The KacWeisfeiler conjectures. In their 1971paper 4 Kac and Weisfeiler formulated the following conjectures http://www.mathematik.uni-bielefeld.de/~rolf/Kac-Weisf/Kac-Weisf.html

Next: Bibliography The Kac-Weisfeiler Conjectures According to the classical representation theory of complex Lie algebras, a finite-dimensional irreducible module over a finite-dimensional semisimple Lie algebra is completely determined by its so-called highest weight. In particular, the dimension of can be computed by means of Weyl's dimension formula. The example already shows that irreducible modules may occur in any dimension. If is a finite-dimensional Lie algebra over an algebraically closed field of characteristic , then the representation theory of is not nearly as well understood. Weyl's Theorem on the complete reducibility of finite-dimensional modules fails in this context, and the dimensions of the irreducible -modules are not known in general. One distinctive feature of modular representation theory is the existence of an upper bound for the dimensions of irreducible -modules. This aspect, as well as other phenomena, rests on the fact that the center of universal enveloping algebra contains a polynomial ring in variables over which is a finite module. The algebra

52. Kac-Weisfeiler Conjectures A First Glance at the KacWeisfeiler conjectures. Many of these enter intowork related to the solution of the Kac-Weisfeiler conjectures. http://www.mathematik.uni-bielefeld.de/~rolf/Kac-Weisf-Talks.html

A First Glance at the Kac-Weisfeiler Conjectures The aim of the series of talks is to give a brief introduction to the methods of the modular representation theory of Lie algebras. Many of these enter into work related to the solution of the Kac-Weisfeiler conjectures . Our talks will be based on the first four sections of the paper [1], with [2] serving as a reference for background material. Below is a list of talks, each of which is supposed to take about 30 minutes. Due to the complexity of the paper, we will often only be able to provide the general ideas involved rather than supplying all arguments in full detail. Talks Survey: The Kac-Weisfeiler Conjectures. (Rolf Farnsteiner) Restricted Lie algebras, enveloping algebras, and irreducible modules; [2,(2.1.1),(5.1.2),(5.1.3),(5.2.5)]. (Daiva Pucinskaite) The maximal dimension of irreducible modules; [2,(6.6)]. (Marcos Soriano) Reduced enveloping algebras and families of L-algebras; [2,(5.3)] and [1,(2.1),(2.2)]. (Andrew Hubery) Coinduced modules and L-simple algebras; [1,(3.1),(3.2)]. (Humberto Alvarez)

53. Some Mathematical Conjectures These are original conjectures, but I have no idea whether I have priority.I welcome correspondence concerning them. They are serious http://www.zeta.org.au/~andrewa/aja6a2.htm

I hypothesise: That the Seive of Eratosthenes is itself the legendary "Nth Prime". That the Real Numbers are not the appropriate number system for making measurements in the real world. These are original conjectures, but I have no idea whether I have priority. I welcome correspondence concerning them. They are serious however, for some fun see my note on Ridiculous Numbers Return to my home page http://www.zeta.org.au/~andrewa/aja6a2.htm Andrew Alder andrewa@zeta.org.au

54. Forming Conjectures In Mathematics Forming conjectures in Mathematics. This page is under construction, saythat there is not much web support, refer to AM and Simon XXX's system. http://www.mathweb.org/spiral/conjecture.html

Forming Conjectures in Mathematics This page is under construction, say that there is not much web support, refer to AM and Simon XXX's system.

55. Pravda.RU Russian Military Refute Conjectures Addressed To Them 1802 200107-03 RUSSIAN MILITARY REFUTE conjectures ADDRESSED TO THEM The Russianmilitary refute their participation in arresting one of the leaders of the http://english.pravda.ru/cis/2001/07/03/9245.html

Jul, 03 2001 Accidents CIS Companies Culture ... About Pravda.RU:CIS:More in detail RUSSIAN MILITARY REFUTE CONJECTURES ADDRESSED TO THEM The Russian military refute their participation in arresting one of the leaders of the People's Front of Moldova, Ilije Ilascu. As RIA Novosti was told on Tuesday by Commander of the Limited Group of the Russian Troops in the Dniester Region Lieutenant-General Valery Yevnevich, "the Russian Armed Forces had nothing to do with the detainment of Ilascu and his brigade." On July 4, the European Human Rights Court in Strasbourg will consider the question of initiating proceedings in connection with Ilascu's law suit against Russia and Moldova. According to the version of the plaintiff, at the beginning of 1990s, he and his supporters were illegally detained and were kept in the disposition of the units of the 14th army in the Dniester region. As experts in the European Human Rights Court believe, the Ilascu case has a clearly expressed political implication, because it is used by certain forces for influencing the solution of the issue of Russia's military-political presence in the Dniester region. -O- (kos/sol) RIA 'Novosti' Pravda.RU:CIS

56. Pravda.RU Marina Romanova: Chef Of “Matrosskaya Tishina”impales A Lobster 1802 RUSSIAN MILITARY REFUTE conjectures ADDRESSED TO THEM The Russian militaryrefute their participation in arresting one of the leaders of the People's http://english.pravda.ru/cis/2001/07/03/

Jul, 03 2001 Accidents CIS Companies Culture ... About Pravda.RU:CIS RUSSIAN MILITARY REFUTE CONJECTURES ADDRESSED TO THEM The Russian military refute their participation in arresting one of the leaders of the People's Front of Moldova, Ilije Ilascu. As RIA Novosti was told on Tuesday by Commander of the Limited Group of the Russian Troops in the Dniester Region Lieutenant-General Valery Yevnevich, "the Russian Armed Forces had nothing to do with the detainment of Ilascu and his brigade." More detail RUSSIA, UKRAINE AND OSCE SUCCESSFULLY PLAYING THE ROLE OF MEDIATORS IN DNIESTER SETTLEMENT Russia, Ukraine and the OSCE are successfully playing the role of mediators and guarantors in the Dniester settlement, said Moldovan President Vladimir Voronin, speaking on national television on Monday evening. He was flatly against "the internationalisation of the process" of the final settlement of the Dniester problem. More detail UKRAINIAN PRESIDENT RULES OUT TRADE WARFARE BETWEEN UKRAINE AND RUSSIA President Leonid Kuchma of Ukraine rules out trade warfare between Ukraine and Russia. The Ukrainian leader made such a statement Tuesday commenting on Russia's introduction since July 1 the value-added tax (VAT) on imported Ukrainian commodities. The Ukrainian government, in its turn, also introduced VAT on Russian goods. More detail RUSSIA AND KYRGYSTAN TO COUNTERACT EXTREMISM Russia and Kyrgystan intend to boost cooperation with a view to preventing Islamic extremists from attempting to destabilize the situation in the republic.

57. Sir Karl Popper Sir Karl Popper. Science conjectures and Refutations. Mr. Turnbullhad predicted evil consequences, . . . and was now doing the best http://cla.calpoly.edu/~fotoole/321.1/popper.html

Sir Karl Popper Science: Conjectures and Refutations Mr. Turnbull had predicted evil consequences, . . . and was now doing the best in his power to bring about the verification of his own prophecies. ANTHONY TROLLOPE When I received the list of participants in this course and realized that I had been asked to speak to philosophical colleagues I thought, after some hesitation and consultation, that you would probably prefer me to speak about those problems which interest me most, and about those developments with which I am most intimately acquainted. I therefore decided to do what I have never done before: to give you a report on my own work in the philosophy of science, since the autumn of1919 when I first began to grapple with the problem, "When should a theory be ranked as scientific?" or "Is there a criterion for the scientific character or status of a theory?" The problem which troubled me at the time was neither, "When is a theory true?"nor, "When is a theory acceptable?" My problem was different. I wished to distinguish between science and pseudo-science;

58. Hardy-Littlewood Conjectures -- From MathWorld HardyLittlewood conjectures, Although it is not obvious, Richards (1974) provedthat the first and second conjectures are incompatible with each other. http://mathworld.wolfram.com/Hardy-LittlewoodConjectures.html

Foundations of Mathematics Mathematical Problems Refuted Conjectures Foundations of Mathematics ... Prime Numbers Hardy-Littlewood Conjectures The first Hardy-Littlewood conjecture is called the k -tuple conjecture . It states that the asymptotic number of prime constellations can be computed explicitly. A particular case gives the so-called strong twin prime conjecture The second Hardy-Littlewood conjecture states that for all x and y , where is the prime counting function Although it is not obvious, Richards (1974) proved that the first and second conjectures are incompatible with each other. Prime Constellation Prime Counting Function Twin Prime Conjecture References Hardy, G. H. and Littlewood, J. E. "Some Problems of 'Partitio Numerorum.' III. On the Expression of a Number as a Sum of Primes." Acta Math. Richards, I. "On the Incompatibility of Two Conjectures Concerning Primes." Bull. Amer. Math. Soc. Riesel, H. Prime Numbers and Computer Methods for Factorization, 2nd ed. Author: Eric W. Weisstein Wolfram Research, Inc.

59. Tait's Knot Conjectures -- From MathWorld Tait's Knot conjectures, Math. 138, 113171, 1993. Murasugi, K. The Jones Polynomialand Classical conjectures in Knot Theory. Topology 26, 187-194, 1987a. http://mathworld.wolfram.com/TaitsKnotConjectures.html

Foundations of Mathematics Mathematical Problems Unsolved Problems Topology ... General Knot Theory Tait's Knot Conjectures P. G. Tait undertook a study of knots in response to Kelvin's conjecture that the atoms were composed of knotted vortex tubes of ether (Thomson 1869). He categorized knots in terms of the number of crossings in a plane projection. He also made some conjectures which remained unproven until the discovery of Jones polynomials 1. Reduced alternating diagrams have minimal link crossing number 2. Any two reduced alternating diagrams of a given knot have equal writhe 3. The flyping conjecture , which states that the number of crossings is the same for any reduced diagram of an alternating knot Conjectures (1) and (2) were proved by Kauffman (1987), Murasugi (1987ab), and Thistlethwaite (1987, 1988) using properties of the Jones polynomial or Kauffman polynomial F (Hoste et al. 1998). Conjecture (3) was proved true by Menasco and Thistlethwaite (1991, 1993) using properties of the Jones polynomial (Hoste et al.

60. Making Mathematics: Mathematics Research Teacher Handbook EXAMPLES, PATTERNS, AND conjectures. Mathematical investigations involvea search for pattern and structure. UNDERSTANDING conjectures. http://www2.edc.org/makingmath/handbook/Teacher/Conjectures/Conjectures.asp

Home Support for Teachers EXAMPLES, PATTERNS, AND CONJECTURES theorem You can introduce the ideas and activities discussed below as the need for them arises during student investigations. If a student uses a particular technique, highlight that approach for the class. Once a conjecture is posed, ask the class what they need to do to understand it and begin to develop an outline that all can use. Regular opportunities for practice with the different skills (organizing data, writing conjectures, etc.) will lead to greater student sophistication over time. GENERATING AND ORGANIZING EXAMPLES Generating Examples In order to get a better view of the "big" picture of a problem, we try to produce examples in a systematic fashion. We often have to choose examples from an infinite domain. These examples should be representative, in ways that we deem significant, of all of the elements of the domain. For example, a problem involving real numbers might involve positive, negative, whole, rational, and irrational examples. Numbers that are less than one or of great magnitude might also be important. In addition to this broad sampling, we also want to generate examples in a patterned way so that relationships between variables stand out (see Organizing Data below).

Page 3     41-60 of 94    Back | 1  | 2  | 3  | 4  | 5  | Next 20