Geometry.Net - Theorems_And_Conjectures: Open Problems


Home - Theorems_And_Conjectures - Open Problems

e99.com Bookstore

Images

Newsgroups

61-80 of 151 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Next 20

Open Problems: more books (100)

Drawing opens pathways to problem solving for young children.: An article from: Childhood Education by Cathleen S. Soundy, Marilyn F. Drucker, 2009-09-22
Algebraic Geometry - Open Problems: Proceedings of the Conference held in Ravello, May 31 - June 5, 1982 (Lecture Notes in Mathematics) (English and French Edition)
Generalized information theory: aims, results, and open problems [An article from: Reliability Engineering and System Safety] by G.J. Klir,
Robinson Crusoe, Social Engineer; How the Discovery of Robinson Crusoe Solves the Labor Problem and Opens the Path to Industrial Peace by Jackson, 2010-01-06
[OPEN PROBLEMS]Open Problems by Books, LLC(Author)paperback{Open Problems: Origin of Water on Earth, Open Problem, List of Unsolved Problems in Biology}15 09-2010
A tabu search algorithm for the open vehicle routing problem [An article from: European Journal of Operational Research] by J. Brandao, 2004-09-16
Open Problem
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results [An article from: Computers and Operations Research] by F. Li, B. Golden, et all 2007-08-01
Open Problems: Origin of Water on Earth, Open Problem, List of Unsolved Problems in Biology
The evolution of mathematical explorations in open-ended problem-solving situations [An article from: Journal of Mathematical Behavior] by V.V. Cifarelli, J. Cai, 2005-01
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows [An article from: European Journal of Operational Research] by A. Sedeno-Noda, D. Alcaide, et all 2006-11-01
Open Problems in Communication and Computation
Development Problems of an Open-Access Resource: The Fisheries of Peninsular Malaysia by Ooi Jin Bee, 1990-07
Security and Privacy Issues in Special-Purpose Networks: Open problems and solutions by Alexandre Viejo, 2009-05-26

lists with details

COLT2003 Call For Open Problems
COLT2003 Call for open problems. COLT2003 will include a session devoted tothe presentation of open problems. Characteristics of a good open problem.
http://learningtheory.org/colt2003/OpenProblems/solicitation.html

Extractions: The writeup of an open problem should include: A clear and self contained description of a single open problem. Motivation for the study of this problem. The current state of understanding for this problem, including known partial solutions and citations of published work. The deadline for submission of open problems is May 10, 2003.
Dynamical Systems Home Page
Conference listings, survey articles, open problems, people, jobs, and seminars.
http://www.math.sunysb.edu/dynamics/

Extractions: Seminar schedules in the tri-state area. Take a look at the pictures from the conference "Around Dynamics" held in honor of Jack Milnor. A searchable list of people working in the field, and some other similar lists Browse our Thesis Server or submit your own work. The Dynamical Systems electronic preprint list at Stony Brook, has merged into the
FoIKS - Intro
International Symposium on Foundations of Information and Knowledge Systems. Burg (Spreewald), Germany; 1417 February 2000. List of open problems.
http://www.informatik.tu-cottbus.de/~foiks/
Open Problems In Continuum Theory
open problems in Continuum Theory. FastCounter by bCentral. 8, 1983, 361394.open problems in topology, Edited by Jan van Mill and George M. Reed.
http://web.umr.edu/~continua/

Extractions: Open Problems in Continuum Theory FastCounter by bCentral Last Modified Monday, 24-May-2004 13:41:49 CDT Technical editor J. Charatonik In the first half of the twentieth century, when foundations of general topology had been established, many famous topologists were particularly interested in properties of compact connected metric spaces, called continua . What later emerged as continuum theory wjcharat@umr.edu News on the List May 24, 2004 Problems 20, 21 and remarks by Jo Heath has been added. March 31, 2004 Problem 9 was solved in the negative. March 29, 2004 Problem 25 was added. April 2, 2003 As you can see we have moved to a different account. Please change the address in your favorites list. March 13, 2003 Problem 11 was added. January 20, 2003 Problems 7, 15, and 16, all on homogeneous continua, were added.
LookSmart - Directory - Open Problems In Graph Theory
Mathematics Graph Theory open problems. open problems in GraphTheory Offers unsolved problems in the field of graph theory.
http://search.looksmart.com/p/browse/us1/us317914/us328800/us10163846/us10163989
The Furstenburg Conjecture And Rigidity
If two commuting endomorphisms of a torus are incommensurable (no power of one is a power of the other), then their joint action should be rigid. Some of the conjectures and open problems compiled by the AIM.
http://aimath.org/WWN/furstenburg/

Extractions: The Furstenburg Conjecture and Rigidity This web page highlights some of the conjectures and open problems concerning The Furstenburg Conjecture and Rigidity. Click on the subject to see a short article on that topic. If you would like to print a hard copy of the entire web page, you can download a dvi postscript or pdf version. The Furstenburg Conjecture and Rigidity Statement of the Conjecture History and past results Analogous problems ... Approaches to a counterexample
LookSmart - Directory - Open Problems In Combinatorics
Combinatorics open problems. open problems in Combinatorics Offersunsolved problems which involve the math of combinatorics.
http://search.looksmart.com/p/browse/us1/us317914/us328800/us10164855/us10164869
Open Problems
Previous Algorithm Summary open problems. Is there a faster algorithmfor sorting signed permutations using reversals ? Given 3
http://www.math.tau.ac.il/~rshamir/algmb/00/scribe00/html/lec10/node20.html
Problems
HotLog Here is a list of selected open problems in the areas of myinterests. They are grouped thematically. Click on a problem
http://www.phil.uu.nl/~lev/problems.html

Extractions: 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 (*). 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? (*) [De Jongh, Visser] Is the downwards extension property of intuitionistic propositional theories equivalent to the property of being projective for infinitely axiomatizable theories? The provability logic of bounded arithmetics S and S : decidability, axiomatization.
Perfect Graphs
Conjectures and open problems, maintained at the AIM.
http://www.aimath.org/WWN/perfectgraph/

Extractions: Perfect Graphs This web page highlights some of the conjectures and open problems concerning Perfect Graphs. If you would like to print a hard copy of the whole outline, you can download a dvi postscript or pdf version. Recognition of Perfect Graphs Polynomial Recognition Algorithm Found Interaction Between Skew-Partitions and 2-joins The Perfect-Graph Robust Algorithm Problem ... A Possible New Problem Skew-Partitions Extending a Skew -Partition Graphs Without Skew-Partitions Graphs Without Star Cutsets Finding Skew-Partitions in Berge Graphs ... beta-perfect graphs Partitionable Graphs Perfect, Partitionable, and Kernel-Solvable Graphs Partitionable graphs and odd holes A Property of Partitionable Graphs The Imperfection Ratio Integer Programming Partitionable Graphs as Cutting Planes for Packing Problems? Feasibility/Membership Problem For the Theta Body Balanced Graphs P4-structure and Its Relatives The individual participant 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.
Open Problems In Computer Virus Research
Skip to main content open problems in Computer Virus Research. Conclusion.We have examined a few open problems in computer virus research.
http://www.research.ibm.com/antivirus/SciPapers/White/Problems/Problems.html

Extractions: Presented at Virus Bulletin Conference, Munich, Germany, October 1998 Abstract Introduction Some people believe that there is no longer any interesting research to do in the field of protection from computer viruses - that all of the important technology has already been developed - that it is now a simple matter of programming to keep up with the problem. Others believe that "virus research" simply means "analyzing viruses." To dispel these misimpressions, we discuss several important research problems in the area, reviewing what is known on each problem and what remains open. The purpose of this paper is not to give solutions to these problems. Rather it is to outline the problems, to suggest approaches, and to encourage those interested in research in this field to pursue them. The problems we have selected have two characteristics. The first is that, if the problem were solved, it would significantly improve our ability to deal with the virus problem as it is likely to evolve in the near future. The second is that the problem constitutes an actual research problem, so that a definitive solution would be publishable in peer-reviewed computer science journals, and could form the basis for an M.S. thesis or, in some cases, a Ph.D. thesis. We discuss five problems: As more viruses are written for new platforms, new heuristic detection techniques must be developed and deployed. But we often have no way of knowing, in advance, the extent to which these techniques will have problems with false positives and false negatives. That is, we don't know how well they will work or how many problems they will cause. We show that analytic techniques can be developed which estimate these characteristics and suggest how these might be developed for several classes of heuristics.
Algorithmic Information Theory
open problems and links to software.
http://www.cs.auckland.ac.nz/CDMTCS/docs/ait.html

Extractions: Algorithmic information theory ( AIT ) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously. The basic idea is to measure the complexity of an object by the size in bits of the smallest program for computing it. ( G. J. Chaitin Here is a compressed PostScript document containing a list of open problems in AIT. Have a browse on Greg Chaitin's home page for some AIT-related software. Back to main page
Www.math.upenn.edu/~chung/ep.dvi
Book Announcement BR J. Hilgert, JD Lawson, KH Neeb, EB Vinberg Positivity in Lie Theory open problems. This book consists of 15 articles, eachof which is an introduction to a set of open research problems in Lie theory.
http://www.math.upenn.edu/~chung/ep.dvi
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/

Extractions: 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
Mathsoft: Mathsoft Unsolved Problems: Unsolved Problems On Other Sites
MegaMath open problems (Los Alamos and University of Idaho); M. Beeler,RW Gosper and R. Schroeppel s Hakmem collection, MIT AI Memo 239;
http://www.mathsoft.com/mathresources/problems/article/0,,1999,00.html

Extractions: search site map about us + news + ... Unsolved Problems Unsolved Problems Links On a Generalized Fermat-Wiles Equation Zero Divisor Structure in Real Algebras Sleeping Habits of Armadillos Mathsoft Constants ... Math Resources Unsolved Problems on Other Sites Jeff Lagarias' 3x+1 problem and related problems The Generalized 3x+1 Mapping (University of Queensland) and 1999 Conference on the Collatz Problem Proceedings Alex Lopez-Ortiz's sci.math FAQ on Famous Problems in Mathematics (University of New Brunswick) Chris Caldwell's Riemann Hypothesis (University of Tennessee at Martin); also Daniel Bump's Riemann Hypothesis (Stanford University) and Barry Cipra's A Prime Case of Chaos MathPro Press Unsolved Math Problem of the Week column and General References Twin Primes Conjecture and Goldbach's Conjecture, discussed in Prime Numbers: Some Unsolved Problems , part of MacTutor History of Mathematics (University of St Andrews); also Chris Caldwell's Prime Conjectures and Open Questions (University of Tennessee at Martin) Jan Otto Munch Pedersen's Known Amicable Pairs (Vejle Business College, Denmark) and Chris Caldwell's
Computability Theory
Directory of researchers working in computability theory, and list of open problems.
http://www.nd.edu/~cholak/computability/computability.html

Extractions: Bibliographic Database for Computability Theory Open Questions in Recursion Theory: LaTeX or pdf Other Useful Sites: People who work (or have worked) in Computability Theory: People whose work had great impact on the field: Computability Theory E-mailing List Research Announcements Recursive Function Theory Newsletter Meetings (see the Association for Symbolic Logic for ASL meetings) Graduate School in Computability Theory Job Announcements As with most web pages, this page is a continuously evolving resource. It will only develop into a useful resource for computability theorists if they help by adding information related to computability theory to the web and this page. Therefore computability theorists are encouraged to add information and links to this page. There are two ways of achieving this. The preferred method is to add the information to the web yourself and email me at Peter.Cholak.1@nd.edu
Survey Of Venn Diagrams -- Open Problems
Venn Diagram References combinatorial facts, beautiful figures, n=3and beyond, some open problems. Venn Diagram Survey open problems.
http://www.combinatorics.org/Surveys/ds5/VennOpenEJC.html

Extractions: Open Problems Find a symmetric Venn diagram for n = 13, or prove that no such diagram exists. 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? How many of these are simple? 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 [ Wi ]. This 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? ]. His other problem of finding a 6-Venn diagram in which each curve is a triangle has been answered affirmatively. See the six amazing triangles Find a Brunnian link whose minimal projection is a symmetric Venn diagram of order 7 or prove that no such link exists. Find a symmetric k -fold ( k n = 2 there are diagrams For , find a "symmetric" diagram on the sphere where the group of symmetries is different than those used in the section on symmetric Venn diagrams. In that section the group of symmetries consisted of rotations about a single axis, or rotations and a flip about that axis. In other words, the problem is: Are there other groups of isometries that act transitively on the curves of some Venn diagram on the sphere?
Teaching
open problems. Relation between oriented circuit double cover andcircular flow number. Status of open problems in my survey paper.
http://www.math.nsysu.edu.tw/~zhu/open-problem.htm

Extractions: Open problems Relation between oriented circuit double cover and circular flow number k-flow graph double cover conjecture Chi-critical graph conjecture Chi_c of subgraphs ... Chi_c of product graphs Chi_c of Mycielski graphs Chi_f of product graphs Subgraph induced by a circular coloring Chi_c of graphs embedded on surfaces Chi_c of line graphs ... Status of open problems in my survey paper
CONCLUSION AND OPEN PROBLEMS
CONCLUSION AND open problems. Important open problems include Treatmentof rules of the form and relinquishing definability conditions.
http://www.isc.cnrs.fr/wp/schlechta/node30.html

Extractions: Next: Bibliography Up: REPRESENTATION RESULTS FOR LIMIT Previous: Proof: We have solved the representation problem for an important class of limit preferential structures. The main ideas were to redefine the problem - in a reasonable and intuitvely acceptable way - and focus on the operation (or which is essentially a more elaborate variant of the classical OR rule, and then to apply our techniques for constructing representing structures - especially indexing by trees - to the problem. We have used compactness in an essential way, so our results were limited to rules of the form Important open problems include: Treatment of rules of the form and relinquishing definability conditions. Both problems seem to be related, and based on the compactness problem.
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

Extractions: 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.

61-80 of 151 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Next 20