81. Artificial Life - Open Problems In Artificial Life - The MIT Press The MIT Press online catalog contains descriptions of inprint and out-of-printbooks, current and past journals, online ordering/subscription options, http://mitpress.mit.edu/catalog/item/default.asp?ttype=6&tid=153

82. Computational Complexity: Communicating Open Problems Communicating open problems. A famous complexity theorist once said The hardest Good open problems are quite rare and one is often torn between the http://weblog.fortnow.com/2005/06/communicating-open-problems.html

@import url("http://www.blogger.com/css/blog_controls.css"); @import url("http://www.blogger.com/dyn-css/authorization.css?blogID=3722233"); Computational Complexity About Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow. I am always happy to hear your ideas, comments and questions about computational complexity and this weblog. My Links Weblog Home Weblog Archives and Search Mailing List Foundations of Complexity ... Home Page and Contact Information Recent Posts Favorite Theorems: The Polynomial-Time Hierarchy An Eulerian Tour Where will you be next year? Understanding "Understanding" ... Making Pigs Fly Complexity Links IEEE Conference on Computational Complexity Electronic Colloquium on Computational Complexity BEATCS Computational Complexity Column Scott Aaronson's Complexity Zoo ... Favorite Complexity Books Weblogs and Other Links Chris Leonard (Elsevier) Computing Research Policy David Eppstein David Molnar ... Theorynet Discussion Groups Computer Science Theory Theory Edge This work is licensed under a Creative Commons License Wednesday, June 22, 2005

83. CS FacultyPublication List Of Csaba D. Tóth Csaba D. Tóth. Email toth@cs.ucsb.edu URL http//www.cs.ucsb.edu/~tothPhone (805) 893-3405 Fax (805) 893-8553 open problems http://www.cs.ucsb.edu/~toth/open.html

UNIVERSITY OF CALIFORNIA SANTA BARBARA COMPUTER SCIENCE PROGRAMS ... WHOIS E-mail: toth@cs.ucsb.edu URL: http://www.cs.ucsb.edu/~toth Phone: (805) 893-3405 Fax: (805) 893-8553 Open problems: The Open Problems Project (Erik D. Demaine - Joseph S. B. Mitchell - Joseph O'Rourke) Open Problems on Discrete and Computational Geometry (Jorge Urrutia) Open Problems (Jeff Erickson) Open Problems in Discrete Math (Matt DeVos)

84. Wesley Pegden Home page concerning research in Combinatorics and Graph Theory with papers and open problems. http://cs.uchicago.edu/~wes

85. Open Problems On this page we have collected a range of open problems that have not been statedbefore. These problems carry a prize of $US100 payable by Journal of http://www.jmlg.org/open_problems.htm

Research thrives on open problems. They serve to challenge the researchers. On this page we have collected a range of open problems that have not been stated before. These problems carry a prize of $US100 payable by Journal of Machine Learning Gossip to the first person or group of persons who successfully solve them to the satisfaction of the editorial board. The decision of the board is final. Winners will be recorded in a hall of fame that will be constructed on the JMLG web site. Get a paper accepted at NIPS, COLT or ICML with the word "Marxist" in the title. Up to changes in mathematical notation, construct a paper accepted to NIPS, COLT or ICML which is wholly comprised of sentences taken from previous papers at the same conference. Provide a proof of construction. Get a paper accepted to NIPS, COLT or ICML which only refers to papers written by authors of the accepted paper. Get a paper accepted to NIPS, COLT or ICML which refers to no other papers (or maybe just one other paper ($25)). Get a paper accepted to NIPS with an average review score of less than 3 and explain how you did it. Proof of score needed.

86. Rational And Integral Points On Higher-dimensional Varieties Some of conjectures and open problems, compiled at AIM. http://aimath.org/WWN/qptsurface2/

Rational and integral points on higher dimensional varieties This web page highlights some of the conjectures and open problems concerning Rational and integral points on higher dimensional varieties. If you would like to print a hard copy of the whole outline, you can download a dvi postscript or pdf version. Lecture Notes Colliot-Thelene 1: Rational points on surfaces with a pencil ... Colliot-Thelene 2: Rational points on surfaces with a pencil ... de Jong: Rationally Connected Varieties ... Miscellaneous Photos The individual contributions may have problems because converting complicated TeX into a web page is not an exact science. The dvi, ps, or pdf versions are your best bet.

87. Open Problems -- From MathWorld open problems. COMMENT On this Page. SEE Unsolved Problems. Pages Linking Here http://mathworld.wolfram.com/OpenProblems.html

INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index DESTINATIONS About MathWorld About the Author Headline News ... Random Entry CONTACT Contribute an Entry Send a Message to the Team MATHWORLD - IN PRINT Order book from Amazon Open Problems SEE: Unsolved Problems [Pages Linking Here]

88. Future Directions In Algorithmic Number Theory Some of the conjectures and open problems motivated by the PRIMES is in P papers, compiled at the AIM. http://aimath.org/WWN/primesinp/

Future directions in algorithmic number theory This web page highlights some of the conjectures and open problems concerning Future directions in algorithmic number theory. If you would like to print a hard copy of the whole outline, you can download a dvi postscript or pdf version. Lecture Notes Agrawal: Primality Testing Agrawal: Finding Quadratic Nonresidues Bernstein: Proving Primality After Agrawal-Kayal-Saxena ... Remarks on Agrawal's Conjecture

89. Bill Martin -- Open Problems Some open problems in Algebraic Combinatorics. Last modified May 4, 1999.Below, I list some of my favourite unsolved problems. But first, a few warnings. http://users.wpi.edu/~martin/RESEARCH/open.html

Some Open Problems in Algebraic Combinatorics Last modified: May 4, 1999 Below, I list some of my favourite unsolved problems. But first, a few warnings. Many of these problems have been posed by other people. I will try to give proper attributions, but I am likely to miss someone's name eventually. Many of the problems I know of were posed by Chris Godsil . Secondly, the problems are all confined to areas in which I work. That is, the list is rather narrow in scope and may not seem thematic. (folklore) For a set C of q -ary n -tuples, let t denote the strength of C as an orthogonal array and let s denote the degree of C as a code. Prove that there exists a constant k such that t <= s+k . Note that no examples are known having t>s+4 (Delsarte, 1973) Do there exist non-trivial perfect codes in the Johnson graphs J(v,k) This question appears in Delsarte's thesis. He ``almost'' conjectures that the answer is NO. The strongest result to date on this is Roos's bound (see Brouwer, et al.). A recent paper by Tuvi Etzion also has nice results (most notably, that the answer is NO if v-2k is prime). I proved that the derived design of a perfect code is always a completely regular code. This gives more leverage to a number-theoretic attack. For example, there are no perfect 2-codes with v

90. Open Problems open problems in quantum information. Solutions welcome. http://cam.qubit.org/open_problems/index.php

Cambridge CQC Open Problems > Open Problems Open Problems Navigation Home Home Site Map Educational FAQ Part III Lectures Tutorials Video Lectures David Deutsch's Lectures on Quantum Mechanics Fujitsu CQC Seminar - Bill Philips Fujitsu CQC Seminar - Anton Zeilinger The CQC People Our Research How to Find Us Sponsors ... Fujitsu Further Information Forthcoming Events Jobs Graduate Applications QC Jobs QC Groups QC History ... Log On Search WWW CQC Forthcoming Talks 26 Sep 05 Alexander Holevo - Lecture 1 30 Sep 05 CQC Seminar - Lev Vaidman 19 Oct 05 CQC Seminar - Alexander Holevo Latest Paper Title: Perfect State Transfer: Beyond Nearest-Neighbor Couplings Authors: Alastair Kay quant-ph/0509065 abs ps pdf other On this page we collect problems in Quantum Information Theory we or our contributors find worthy of attention. Click on the title to find the statement of the problem and some information on known partial results. This information will be updated whenever significant progress is brought to our attention. To make this page interesting we obviously need input from the community, so please contribute good problems . By this we mean problems in Quantum Information Theory, which are stated in a self-contained way in the current terminology of the field, are open to the best of your knowledge, and pose an interesting challenge to other researchers. We will make an effort to publish all good problems quickly, but may reject contributions we find less suitable.

91. The Formal Approach To Meaning Short survey of semantics of natural language by Barbara Abbott, at University of Michigan. Focusses upon Montague semantics, and tries to give a feel for the main open problems in the field. http://www.msu.edu/user/abbottb/formal.htm

The formal approach to meaning: Formal semantics and its recent developments [This paper is in Journal of Foreign Languages (Shanghai), 119:1 (January 1999), 2-20.] Barbara Abbott Michigan State University June 1998 abbottb@pilot.msu.edu Like Spanish moss on a live oak tree, the scientific study of meaning in language has expanded in the last 100 years, and continues to expand steadily. In this essay I want to chart some central themes in that expansion, including their histories and their important figures. Our attention will be directed toward what is called 'formal semantics', which is the adaptation to natural language of analytical techniques from logic.[ The first, background, section of the paper will survey the changing attitudes of linguists toward semantics into the last third of the century. The second and third sections will examine current formal approaches to meaning. In the final section I will summarize some of the common assumptions of the approaches examined in the middle sections of the paper, sketch a few alternatives, and make some daring predictions. 'Meaning' is a broad term that can encompass any aspect of the potential for cognitive or emotive impact of speech on interlocutors. However in linguistic semantics these days the cognitive aspects are the center of focus. On the other hand the traditional distinction between semantics, as the study of the relation between linguistic expressions and what they are used to talk about (people and things, events and situations, etc.) and pragmatics, as the study of anything involving the use of language, has become less certain and is in fact lost in several different current approaches.

92. A Survey Of Venn Diagrams: Open Problems Venn Diagram Survey open problems. open problems related to Venn diagrams.Combinatorial Problems. Is it true that every simple Venn diagram of n http://www.theory.csc.uvic.ca/~cos/venn/VennOpenEJC.html

T HE E LECTRONIC ... OMBINATORICS (ed. June 2005), DS #5. Venn Diagram Survey Open Problems Open problems related to Venn diagrams. Combinatorial Problems Is it true that every simple Venn diagram of n curves can be extended to a simple Venn diagram of n +1 curves by the addition of a suitable curve? [That this is true is a conjecture of Winkler [ ] (also mentioned in [ Wi ]). It was proven to be true for not necessarily simple Venn diagrams by Chilakamarri, Hamburger, and Pippert [ Equivalently: Is every planar dual graph of a simple Venn diagram Hamiltonian? Find a simple symmetric 11-Venn diagram. More generally, find a general construction for simple symmetric Venn diagrams. Find a minimum-vertex symmetric 11-Venn diagram. Such a Venn diagram would have 209 vertices. Find a polar symmetric 11-Venn diagram. How many symmetric Venn diagrams are there for n = 5? There is only one symmetric simple 5-Venn diagram. How many symmetric Venn diagrams are there for n = 7? It is known that there are at least 33 simple symmetric Venn diagrams. Find a Brunnian link whose minimal projection is a symmetric Venn diagram of order 7 or prove that no such link exists.

93. Geombinatorics: Making Math Fun Again A journal of open problems in combinatorical and discrete geometry and related areas. Includes tables of contents. http://www.uccs.edu/~asoifer/geombinatorics.html

GEOMBINATORICS ISSN 1065-7371 A journal of OPEN PROBLEMS of combinatorial and discrete geometry and related areas. "This quarterly journal, started by Alexander Soifer at the University of Colorado at Colorado Springs , specializes in geometry and combinatorics , but what really distinguishes it from the field is attitude!" Paul Kainen THE FIRST DOZEN YEARS EDITORS CONTENTS 1991 - PRESENT AUTHORS INDEX 1991 - PRESENT ... ORDER FORM "Dear Alex, Finally got around to reading the October Geombinatorics , which contains more than the usual supply of gems the bits by Vizing and Alon were worth more than a year's subscription, if it's not too crass to put a money value on great mathematics, and why should it be, art is sold for money all the time ..." Peter D. Johnson, Dec. 18, 1995 The list of editors is distingished , and Geombinatorics is now reviewed both by MATHEMATICAL REVIEWS and ZENTRALBLATT FÜR MATHEMATIK . The Table of Contents for Vol. VIII, Issue 1 (July 1998) will give an idea of specialization. Issue 3 of Volume VI (January 1997) was dedicated entirely to the memory of Paul Erdös (1913-1996), a great mathematician and man, greatest problem creator of all time, and an editor of "

94. Minor Open Problems - Compgeom Blog A simple intriguing problem Minor open problems. We had a fairly productiveopen problems section, with one problem even solved by Google before the http://compgeom.poly.edu/blogs/categories/3-Minor-Open-Problems

95. Spectral Graph Theory People, publications, research topics, open problems, events and resources. http://www.sgt.pep.ufrj.br/

96. The Geomblog: Open Problems (redux) For the last few years, COLT has glorified the open problems section and allocates A list of this year s open problems can be found on the COLT 2004 http://geomblog.blogspot.com/2004/08/open-problems-redux.html

@import url("http://www.blogger.com/css/blog_controls.css"); @import url("http://www.blogger.com/dyn-css/authorization.css?blogID=6555947"); @import url(http://www.blogger.com/css/navbar/main.css); @import url(http://www.blogger.com/css/navbar/3.css); BlogThis! The Geomblog Ruminations on computational geometry, algorithms, theoretical computer science and life Friday, August 20, 2004 Open Problems (redux) One of my first posts was about finding interesting problems to work on Adam Klivans guest-posting over at the complexity blog, mentions that COLT has an extremely civilized approach for dealing with this: For the last few years, COLT has glorified the open problems section and allocates about an hour of time for a presentation of open problems. The open problems themselves must be submitted months beforehand and are refereed (how rigorously is anyone's guess); accepted problems appear in the proceedings. A list of this year's open problems can be found on the COLT 2004 program schedule the session was held on Friday evening. Thus I am happy to note that this year's fall workshop on computational geometry will have a similar focus on open problems. From the call for abstracts:

97. Problems Here is a list of selected open problems in the areas of my interests. They aregrouped thematically. Click on a problem to get a comment and possibly some http://www.phil.uu.nl/~lev/problems.html

Here is a list of selected open problems in the areas of my interests. They are grouped thematically. Click on a problem to get a comment and possibly some related questions. If you would like to make a comment or contribute a question, please mail to lev@phil.uu.nl . Presumably easier problems suitable, e.g., for a graduate project are marked by (*). 31.07.05. On the basis of part of the list below we have written a paper together with Albert Visser where we give an orderly overview and more extended comments to some questions. See: Beklemishev, L.D. and A. Visser (2005): Problems in the Logic of Provability. Department of Philosophy, Utrecht University, Logic Group Preprint Series 235, May 2005. Problems in Provability Logic Intuitionistic arithmetic The provability logic of Heyting arithmetic HA: decidability, axiomatization. [Markov] The propositional logic of Kleene realizability. [Plisko] Dialectica interpretation. [De Jongh, Visser] Characterization of subalgebras of the Lindenbaum Heyting algebra of HA. The predicate logics of some extensions of HA: HA+MP, HA+ECT The admissible propositional inference rules for HA+MP and HA+ECT Are the Lindenbaum Heyting algebras of HA and HA+RFN(HA) isomorphic? Is the elementary theory of the Lindenbaum Heyting algebra of HA decidable? Which fragments of it are?

98. CITR Homepage A web site on open problems in digital and image geometry has been suggestedduring the Winterschool DIG 2000 at Dagstuhl/Germany. Problems to be published http://www.citr.auckland.ac.nz/dgt/OpenProblems.php/

CITR Home History Index ... Publications Open Problems in Digital Geometry and Topology A web site on open problems in digital and image geometry has been suggested during the Winterschool DIG'2000 at Dagstuhl/Germany. Problems to be published on this web site may be posted to dgt-webmaster@citr.auckland.ac.nz in pdf format. Please limit your file submissions to just (about) 2 pages and use the format shown in this template file . They will be published in the list below together with the date when received, your name (with a link to your email address), and links provided by you for related publications, test data, web sites etc. Responses to the published problems will be inserted into the table, next to the related problem. A response should also be in pdf format (about 2 pages) and may include links to further material. Date Problem/Response (First) Author Links 9, May 2001 Surface Area Estimation Reinhard Klette CITR-TR-87 11, September 2001 Estimation algorithm and multigrid convergence proof David Coeurjolly Technical Report 10, May 2001 Superlinear Convergence for Length Estimation Reinhard Klette CITR-TR-87 22, June 2001

99. Loop Quantum Gravity A general overview of ideas, results and open problems of loop quantum gravity. http://www.livingreviews.org/Articles/Volume1/1998-1rovelli/

100. Some Problems In Matroid Theory Oxley s book has an entire chapter of open problems. (Some may have been solvedby now.) Joseph PS Kung has written two articles called ``surveys that http://www.math.binghamton.edu/zaslav/Matroids/matroidprobs.html

Some Problems in Matroid Theory Compiled by Thomas Zaslavsky Sources Oxley's book has an entire chapter of open problems. (Some may have been solved by now.) Joseph P.S. Kung has written two articles called ``surveys'' that are replete with new results and open problems: ``Extremal matroid theory'', in: Neil Robertson and Paul Seymour, eds., Graph Structure Theory , pp. 21-61. Contemporary Mathematics, Vol. 147. American Mathematical Society, Providence, R.I., 1993. ``Critical problems'', in: Joseph E. Bonin, James G. Oxley, and Brigitte Servatius, eds., Matroid Theory , pp. 1-127. Contemporary Mathematics, Vol. 197. American Mathematical Society, Providence, R.I., 1996. Some Problems I've Found Interesting Bonin's Projective Bound Suppose a simple matroid G of rank r that does not split has no more than q r-1 points in each cocircuit. Conjecture r - 1)/(q - 1), which is the number of points in an r-1-dimensional projective geometry of order q if such exists. Furthermore, the upper bound is attained only by projective geometries. "Splitting" means that G is the union of two disjoint proper flats. This problem was proposed by Joe Bonin.

Page 5     81-100 of 174    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20