Experimental Mathematics publishes original papers featuring formal results inspired by experimentation, conjectures suggested by experiments, and data supporting significant hypotheses.
Experiment has always been, and increasingly is, an important method of mathematical discovery. (Gauss declared that his way of arriving at mathematical truths was "through systematic experimentation.") Yet this tends to be concealed by the tradition of presenting only elegant, fully developed, and rigorous results.
Experimental Mathematics was founded in the belief that theory and experiment feed on each other, and that the mathematical community stands to benefit from a more complete exposure to the experimental process. The early sharing of insights increases the possibility that they will lead to theorems: An interesting conjecture is often formulated by a researcher who lacks the techniques to formalize a proof, while those who have the techniques at their fingertips have been looking elsewhere. Even when the person who had the initial insight goes on to find a proof, a discussion of the heuristic process can be of help, or at least of interest, to other researchers. There is value not only in the discovery itself, but also in the road that leads to it.
The essential ingredients of a paper published in Experimental Mathematics are two: some experimental aspect, and relevance to mathematics proper. The word "experimental" is conceived broadly: Many mathematical experiments these days are carried out on computers, but others are still the result of pencil-and-paper work, and there are other experimental techniques, like building physical models. As for the second ingredient, we emphasize the distinction between experimental mathematics and applied mathematics. We like to hear about interesting applications to the "real world," but our focus is on work that will have a theoretical impact and contribute to the development of mathematical ideas.
Within this framework, here are some types of paper that we regard as suitable for publication. (Before submitting a paper, please review the Submission Guidelines.)
Experiments that give rise to new theorems or new conjectures, or lend support to existing conjectures, or point to areas that ought to be investigated.
New theorems proved with the help of experimental results are highly acceptable, and authors should submit the formal proofs as well as information about the experiments—it is not our purpose to encourage the proliferation in different journals of papers based on the same piece of research.
When a new result cannot be proved, conjectures should be formulated as precisely as possible: "There is clearly something going on that needs to be explained" is not enough. The discussion should make clear why the conjecture is interesting, what prior work contributed to it, what one could deduce from it, and what special cases one can already prove.
Computer experiments should be reported in such a way that they can be repeated by other researchers. Ideally, the programs used for the experiment should be made freely available in electronic form to other researchers, to the extent that this is within the author's control. This will allow others to check whether all borderline cases have been tested, whether the author's interpretation of the results is the only one possible, and so on. Referees are encouraged to request programs for testing, and authors are expected to comply even if they will not make the programs publicly available.
Results of computer experiments should be presented in such a way as to be graspable by humans. This is seldom the case with long chunks of computer output. For this reason, printouts of interactive computer sessions will not be published, except perhaps for short excerpts illustrating specific points. Computer-generated tables can be published, after appropriate reformatting, if their reference value is commensurate with their size.
Algorithms for the solution or exploration of mathematical problems, including theoretical or experimental analyses of complexity. We use the word algorithm in a somewhat loose sense: A procedure does not need to terminate in all cases in order to be useful in mathematical exploration.
Publishability depends partly on the intrinsic interest of the algorithm or proof of complexity, and partly on the importance of the mathematical problem at which it is directed. Description of a previously known algorithm may be acceptable if the algorithm is put to an original use or if new information about its complexity is uncovered.
Discussion of practical issues. Papers discussing techniques and pitfalls involved in experimentation will be published if they present an original contribution and have a core of mathematical interest. If there is a non-obvious phenomenon to describe, we would like to hear about it.
In conclusion, many mathematicians have been reluctant to publish experimental results. Those who have tried it have sometimes found the best-known mathematical journals unwilling to accept such material, regardless of merit. Experimental Mathematics is an effort to change this situation. We envision it as something akin to a journal of experimental science: a forum where experiments can be described, conjectures posed, techniques debated, and standards set. We strongly believe that such a forum will further the healthy development of mathematics.
PEER REVIEW
 
All submitted manuscripts are subject to initial appraisal by the Editors-in-Chief, and, if found suitable for further consideration, to peer review by independent and anonymous expert referees. All peer review is single blind and submission is online via  ScholarOne Manuscripts.
 
Publication office: Taylor & Francis Group, 530 Walnut Street, Suite 850, Philadelphia, PA 19106

Editor-in-Chief 

Sergei Tabachnikov  - Penn State University, PA , USA 

Incoming Editor-in-Chief 

Alex Kontorovich - Rutgers University, NJ , USA 

Founding Editor 

David B.A. Epstein - University of Warwick, Coventry, UK 

Associate Editors

Jayadev Athreya - University of Washington, Seattle, WA, USA 
David Bailey - University of California, Davis, CA, USA 
Kathrin Bringmann - University of Cologne, Cologne, Germany 
Joe P. Buhler - Center for Communications Research, NJ, USA 
Rafael de la Llave - Georgia Institute of Technology, GA, USA 
Jan Draisma - University of Bern, Bern, Switzerland 
Ronald L. Graham - University of California, San Diego, CA, USA 
Sinan Gunturk - New York University, NY, USA 
Brendan Hassett - Brown University, RI, USA 
Derek Holt - University of Warwick, Coventry, UK 
Sarah Koch - University of Michigan, Ann Arbor, MI, USA 
Sadayoshi Kojima - Waseda University, Tokyo, Japan 
Robert Kusner - University of Massachusetts, Amherst, MA, USA  
Mark Levi - Pennsylvania State University, University Park, PA, USA 
Lillian Pierce - Duke University, Durham, NC 
Albert Marden - University of Minnesota, MN, USA 
Kaisa Matomäki - University of Turku, Finland 
Walter Neumann - Columbia University, NY, USA 
Wilhelm Plesken - Rhein.-Westf. Technische Hochschule Aachen, Aachen, Germany 
Michael Pohst - Technische Universität Berlin, Berlin, Germany 
Igor Rivin - Temple University, USA 
Peter C. Sarnak - IAS Princeton, NJ, USA 
Yuri Tschinkel- New York University, NY, USA