Geometry.Net - Theorems_And_Conjectures: Open Problems


Home - Theorems_And_Conjectures - Open Problems

e99.com Bookstore

Images

Newsgroups

41-60 of 174 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Next 20

Open Problems: more books (100)

The Ocean Basins: Their Structure and Evolution, Second Edition (Open University Oceanography) by Open University, 1998-04-28
The City: Problems of Planning (Open University set book)
Open Problems in Topology II (Pt. 2)
101 Short Problems/101 Problemas Cortos: A Collection of Short, Open Mathematics Problems (Equals Series) (Multilingual Edition) by Jean Stenmark, 1995-06
Frtee Will as an Open Scientific Problem by Mark Balaguer, 2010
Open Education Promise and Problems (Fastback Ser No. 3) by Vito Perrone, 1972-06
Unfolding the Labyrinth: Open Problems in Physics, Mathematics, Astrophysics and other Areas of Science by Florentin Smarandache, V. Christianto, et all 2007-11-22
The Limits to Satisfaction: An Essay on the Problems of Needs and Commodities (Open Forum) by William Leiss, 1978-05
Problems of Modern Society (Open University set book)
Adjustment problems in advanced open economies: Japan and Germany (Schriften zu Regional- und Verkehrsproblemen in Industrie- und Entwicklungslandern)
Open learning: Systems and problems in post-secondary education by Norman Ian MacKenzie, 1975
Some open problems in pure capital rationing theory.: An article from: Engineering Economist by Maria Elena De Giuli, Umberto Magnani, 1995-09-22
Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem [An article from: European Journal of Operational Research] by T. Cheng, N.V. Shakhlevich,
Solving Tough Problems,An Open Way of Talking, Listeningnd Creating New Realities, 2004 publication by sdsm Kshsn, 2004-01-01

lists with details

Process Algebra: Open Problems And Future Directions
This web page lists some open problems in process algebra communicated, The process algebra (PA) related open problem I am interested in is that of the
http://www.cs.auc.dk/~luca/BICI/open-problems.html

Extractions: Bertinoro Forl¬ ), Italy Some Open Problems in Process Algebra This web page lists some open problems in process algebra communicated, at least initially, by the participants at the workshop Process Algebra: Open Problems and Future Directions We intend to maintain this page as up to date as possible, in the hope that it will be a useful resource for the practising process algebraist and concurrency theorist. To this end, we invite all of the members of the process algebra community to help us by sending the maintainer of this page suggestions for new problems to be posted here, and pointers to their solutions. Some further open problems are mentioned in the note Some of My Favourite Results in Classic Process Algebra by Luca Aceto , and on the slides of the talks delivered at the workshop. Does bisimulation equivalence admit a finite equational axiomatization over the language obtained by adding Hennessy's auxiliary operator from to CCS?
Interval Computations
Presents a guide to Interval Arithmetic research featuring open problems, applications, generalizations, bibliography, researchers' sites, ftp site, and mailing list.
http://www.cs.utep.edu/interval-comp/
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 Open Problems in Mathematical Logic 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) Research Grants 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
Problems In Graph Theory And Combinatorics"
open problems are listed along with what is known about them, Other directoriesof open problems pages can be found as follows Graph Theory,
http://www.math.uiuc.edu/~west/openp/

Extractions: This site is a resource for research in graph theory and combinatorics. Open problems are listed along with what is known about them, updated as time permits. Individual pages contain such material as title, originator, date, statement of problem, background, partial results, comments, references. Also available is a Glossary of Terms Most pages in this directory have not yet been created; so far this is mostly a list of some well-known problems for which more detailed pages will be written later. Its accessibility at this early stage is a plea for contributed material to accelerate its development. The organization of topics roughly follows the four volumes of The Art of Combinatorics under development by D.B. West. Thus the four main headings are Extremal Graph Theory Structure of Graphs Order and Optimization , and Arrangements and Methods
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
Open Problems On Perfect Graphs
In February of that year, Bruce and I prepared a list of open problems, whichwas then sent to all the invited participants. The next version of the list,
http://www.cs.concordia.ca/~chvatal/perfect/problems.html

Extractions: (compiled by Maria Chudnovsky) A bibliography on perfect graphs Home pages of people interested in perfect graphs This collection is written for people with at least a basic knowledge of perfect graphs. Uninformed neophytes may look up the missing definitions on the web in Alexander Schrijver's lecture notes or in Jerry Spinrad's draft of a book on efficient graph representations etc. or in Eric Weisstein's World of Mathematics . Books on perfect graphs include M. C. Golumbic
The Valuation Theory Home Page
A forum for all mathematicians who work in or use valuation theory. Directory of people, meetings, preprints, bibliography, open problems and news.
http://math.usask.ca/fvk/Valth.html

Extractions: Welcome, dear reader, to This home page is intended to be a forum for all mathematicians who work in valuation theory or apply valuation theoretical results in their own field of research. The home page offers: If you have suggestions, questions, ideas, news, or if you want your name and address on the above mentioned list, or if you have a recent paper in or applying valuation theory, then write to valth [at] math.usask.ca
Open Problems In Graph Theory Involving Steiner Distance
open problems involving Steiner distance.
http://io.uwinnipeg.ca/~ooellerm/open_problems/

Extractions: This inequality does not hold for graphs in general as was shown by Henning, Oellermann, and Swart . It was shown in the same paper that for a graph G and n=3 and 4: diam n n G. It was shown by Oellermann and Tian that for a tree T: C n-1 (T) is contained in C n It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-center of a graph is contained in its Steiner n-center. It was shown by Beineke, Oellermann and Pippert that if T is a tree, then M n-1 (T) is contained in M n It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-median of a graph is contained in its Steiner n-median. Oellermann and Tian ). It is known that every graph is the 2-median of some graph (see Holbert ,and Hendry ). Steiner n-medians of trees have been completely characterized by
Quantum Information: Problems
Entangled Hbars. open problems. On this page we collect problems in QuantumInformation Theory we or our contributors find worthy of attention.
http://www.imaph.tu-bs.de/qi/problems/problems.html

Extractions: Open Problems On this page we collect problems in Quantum Information Theory we or our contributors find worthy of attention. The list is ordered by "last submission on top". Numbering is kept stable, so you can refer to the problems by number. 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. Send contributions by email to . The format of contributions is free. Text written in simple LaTeX, and divided into sections such as Problem/ Background/ Partial Results/ Remarks/ Literature creates the smallest workload for us.
RFW: Open Problems
Some open problems. At conferences I like to ask people If a Fairy offers A list of open problems in Quantum Information Theory, which is planned for
http://www.imaph.tu-bs.de/home/werner/problems.html

Extractions: Back to Reinhard F. Werner's home page At conferences I like to ask people "If a Fairy offers you the key idea for proving a Theorem of your choice, what would you pick?". It is the information you don't usually find in published papers. The following sites collect such material. So if any of these ring a bell, or you know of partial results LET ME KNOW! . If any problem gets solved, I will also place a link to the solution. tr exp (A+itB) [Nov. 1996] A conjecture of Bessis, Moussa, and Villani ( J.Math.Phys. positive measure. This would entail a number of interesting inequalities not just for quantum partition functions, but also for their dervatives (a badly needed tool). Despite a lot of work, some by prominent mathematical physicists, only some simple cases have been decided. So far all results, including fairly extensive numerical experiments, are in agreement with the conjecture. I have been collecting material on this problem with Mark Fannes (along with our own work). Uniqueness of q-relations [Nov. 1996]
Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly: Open Problems In Data-shari
open problems in Datasharing Peer-to-peer Systems, ICDT 2003 In a 4 ConclusionMany of the open problems in P2P data sharing systems surround search
http://dbpubs.stanford.edu/pub/2003-1

Extractions: Pagewise preview Category Value Available via http://dbpubs.stanford.edu/pub/2003-1 Submitted on 23rd of October 2002 Author Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly Title Open Problems in Data-sharing Peer-to-peer Systems Date of publication January 2003 Published in ICDT 2003 Citation Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly. Open Problems in Data-sharing Peer-to-peer Systems, ICDT 2003 Number of pages Language English Project Peers Type Conference or Journal Paper Subject group Miscellaneous Abstract In a Peer-To-Peer (P2P) system, autonomous computers pool their resources (e.g., files, storage, compute cycles) in order to inexpensively handle tasks that would normally require large costly servers. The scale of these systems, their "open nature," and the lack of centralized control pose difficult performance and security challenges. Much research has recently focused on tackling some of these challenges; in this paper, we propose future directions for research in P2P systems, and highlight problems that have not yet been studied in great depth. We focus on two particular aspects of P2P systems search and security and suggest several open and important research problems for the community to address. Keywords Peer-to-peer, search, security
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
Logo Other Sites With This Page Open Problems In DS ET (IUPUI
This collection of open problems in Dynamical Systems Ergodic Theory originatedfrom the If you would like to submit some open problems to this page,
http://iml.univ-mrs.fr/~kolyada/opds/

Extractions: Welcome! Katsiveli - 2000 Open Problems Session (Chairman - Benjamin Weiss ). New problems are being added to it. If you would like to submit some open problems to this page, please send them to me Anyone who has never had any (open) problem has never tried anything new. Anyone who has published a paper has solved a problem and maybe has some other open problems. Why not to present them at this www page? Sergiy Kolyada
Anogia Algorithmica '05
First workshop on open problems in algorithmics. Anogia Academic Village, Crete, Greece; 30 May 3 June 2005.
http://www.scs.carleton.ca/~kranakis/ANOGIA/algo05.html

Extractions: May 30 - June 02 The 1st workshop on open problems in algorithmics will be held at the Anogia (pronounced A-no'-yia) Academic Village in the island of Crete, a conference facility located in a unique natural setting, 40 min from Heraklion and Knossos and 50 min from Rethymno. PROGRAM Tuesday, May 31:
Mathematical Logic :: Index
Problems which can be solved in a matter of weeks rather than years are especiallywelcome. Discussion of open problems in mathematical logic
http://math.berkeley.edu/Logic/problems/
World Of Groups
Part of the World Wide Algebra project. open problems in combinatorial group theory, a list of personal web pages, conferences and seminars, and useful links.
http://www.cs.gc.cuny.edu/~cryptlab/gworld/gworld.html

Extractions: Welcome to The World of Groups! This part of the World Wide Algebra project includes a list of open problems in combinatorial group theory, a list of personal web pages, a list of conferences and seminars, and a list of useful links. If you would like to see some other information posted on this site, please send us e-mail . We also invite you to visit our Algebraic Cryptography page that has a lot of information on using groups in cryptography. NEWS :
Groupoid Home Page
Maintained by Birant Ramazan. Address book, open problems, meetings, pictures, other resources.
http://unr.edu/homepage/ramazan/groupoid/
OPEN PROBLEMS IN COMBINATORIAL OPTIMIZATION
During this time I have compiled an ongoing list of open problems, which fascinateme for their apparent difficulty, their simplicity of statement and
http://www.cs.clemson.edu/~hedet/preface.html

Extractions: Clemson, SC 29634-1906 The Friday afternoon Algorithms Seminar at Clemson has been a rich source of interesting problems over the past twelve years, as have many discrete math conferences, including our twelve Clemson mini-Conferences on Discrete Mathematics. During this time I have compiled an on-going list of open problems, which fascinate me for their apparent difficulty, their simplicity of statement and their inherent interest. Motivated by numerous requests for an updated version of this list, I am finally taking the time to update it and make it available to anyone who would like to read or copy it. For each of the following problems I will attempt to identify the originators and the approximate time of origin. If you can provide me with any historical corrections or additions to any of the problems in this list, please let me know. You will note that I have not yet provided many literature citations; it will take a LONG time to provide all of the relevant references. I hope to be able to include more and more of this information in the future. So please consider this to be a 'working' document, which will repeatedly be updated. Most of these problems are stated in the Garey and Johnson format for NP-complete problems. Unless stated otherwise, by 'Open' I mean that the complexity of the problem is not known to me (no NP-completeness proof exists), neither does any algorithm exist for solving the problem, or no solution is known to exist.
Education Programs At DIMACS
Assistance in educating K12 and undergraduate students about discreet mathematics. Lists programs and open problems in the field.
http://dimacs.rutgers.edu:80/Education/
Interval Computations: Open Problems
open problems. Grand challenge interval problems (by A. Neumaier) GuaranteeingBounds on Uncertainty in Metrology Back to the main menu of the
http://www.cs.utep.edu/interval-comp/openprob.html

41-60 of 174 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Next 20