A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Automated conjecture making in number theory using HR, Otter and Maple
2005
Journal of symbolic computation
Preserved Fulltext
We add some automation to this discovery process by using the HR theory formation system to make conjectures about Maple functions supplied by the user. ...
We describe the core functionality of HR which enables it to form a theory, and the additional functionality implemented in order for HR to work with Maple functions. ...
We would also like to thank the anonymous referees from the Calculemus conference for their interesting comments and suggestions about this work, and the organisers of that conference, at which this material ...
doi:10.1016/j.jsc.2004.12.003
fatcat:uho7tj76sfcdxi3jdi6brc2d3a
Automated Proofs of Many Conjectured Recurrences in the OEIS made by R.J. Mathar
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this case study we demonstrate, and actually fully implement (in an accompanying Maple package), how to turn many conjectures made in the OEIS by R.J. ...
", as opposed to "proved conjecture" (alias theorem). ...
The Maple package SCHUTZENBERGER.txt While many of the needed functions can be found in the Maple package gfun [SZ] mentioned above, we found it more convenient to write our own Maple code, SCHUTZENBERGER.txt ...
arXiv:1707.04654v2
fatcat:rx4pu2s75vh2bmavt5eypzu2ui
On Euler's "Misleading Induction", Andrews' "Fix", and How to Fully Automate them
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Usually he had an uncanny intuition on how many "special cases" one needs before one can formulate a plausible conjecture, but one time he was "almost fooled", only to find out that his conjecture was ...
But in order to turn the empirical proof into a full-fledged rigorous proof, we must make sure that we check sufficiently many (but still not that many!) special cases. ...
Interlude: Even Giants make stupid conjectures We are a little surprised that Euler could have believed, even for a second, that Eq. (Leonhard) is true for all n. ...
arXiv:1304.1226v1
fatcat:4vxjgraagjfqfkbfg4pccqhqem
Liebe Opa Paul, ich bin auch ein experimental Scientist!
2003
Advances in Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
B 22 (n, r + 2)B 11 (n, r + 1) = 1, which Maple (or Mathematica, etc.) can verify routinely, and hence prove the conjecture. ...
He also talked about Algorithmic Paradigms. In particular, about Hierarchy, Adaptivity, and (De)composition. ...
doi:10.1016/s0196-8858(03)00025-3
fatcat:vsimtlj3unfsjosinuenmrplja
The Holonomic Ansatz II. Automatic Discovery(!) And Proof(!!) of Holonomic Determinant Evaluations
2007
Annals of Combinatorics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The main functions are Rproof, RproofP, SRproof, SRproofI, to find out about them, in DET, type ezra(FunctionName);. For example, with help for Rproof, type ezra(Rproof);. ...
Let me just mention that DaveH works by conjecturing recurrences for many rows (i.e. for fixed n), and then using the procedure GR1 that guesses rational functions in order to guess a unified recurrence ...
doi:10.1007/s00026-007-0317-y
fatcat:cpf42huawjgzrk2ltoqz35xqn4
Disturbing the Dyson Conjecture (in a GOOD Way)
2006
Experimental Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a case study in experimental yet rigorous mathematics by describing an algorithm, fully implemented in both Mathematica and Maple, that automatically conjectures, and then automatically proves ...
, closed-form expressions extending Dyson's celebrated constant term conjecture. ...
/Maple needs to supply a conjecture. ...
doi:10.1080/10586458.2006.10128959
fatcat:gp65lz4pufbl7o47kgirygcfye
Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Monthly Problem, to prove a nice explicit formula for the generating function for the number of n-letter words in H,T that have as many occurrences of HT as HH. ...
What About Several Distinguished Words? ...
But there is another way to make everything fully rigorous. Via the holonomic ansatz! ...
arXiv:1112.6207v1
fatcat:a2kmc7oyznashdv3py5j6rcnau
Explicit expressions for the moments of the size of an (n, dn-1)-core partition with distinct parts
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We exhibit formulas for the moments of the size, as functions of d with n fixed, and vice versa. We conjecture that the distribution is asymptotically normal as n approaches infinity. ...
In particular, we conjectured that the distribution is asymptotically normal. ...
Then X d,n is a random variable, so it makes sense to inquire about its distribution. ...
arXiv:1702.05634v2
fatcat:xgo7biva3zdgtnyu72vu5c5hw4
A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)
1992
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
expected, and required about 50 mathematician-hours, 10 (Maple) programmerhours, (the mathematician and programmer being myself), and 10 CPU-hours to consfruct the proof. ...
A naive approach is to 'solve' F( Y, x, t) 'explicitly', say by radicals, and verify that it satisfies the functional equation G = 0 of Step 1. However, Maple was unable to do it. ...
Appendix: A Maple program for Steps 3 and 4 # this is the functional equation of step 1, derived humanly in # Section 2 G := PHI -l/(1 -x*t) -x*t*(P -t*PHI)*(P -PHI)/(lt)^2: G := normal (G): G := numer ...
doi:10.1016/0012-365x(92)90351-f
fatcat:cpo37xbg3rfh3fy6ubsbm5io6q
Rademacher's infinite partial fraction conjecture is (almost certainly) false
2013
Journal of difference equations and applications (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Other Versions
function for partitions of integers into at most N parts exist and equal particular values that he specified. ...
In his book Topics in Analytic Number Theory, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating ...
after about n = 150. ...
doi:10.1080/10236198.2012.678837
fatcat:gldzcpwzxfhhleiqhum53ssg7q
Integrals Involving Rudin–Shapiro Polynomials and Sketch of a Proof of Saffari's Conjecture
[chapter]
2017
Analytic Number Theory, Modular Forms and q-Hypergeometric Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Equivalently, the generating function R 1 (t) is given by ...
Preface: Krishna Alladi One of the greatest disciples of Srinivasa Ramanujan, who did so much to make him a household name in the mathematical community, and far beyond, is Krishnaswami "Krishna" Alladi ...
Added May 27, 2016: Brad Rodgers, independently, and simultaneously, found a (complete) proof of Saffari's conjecture, that he is writing up now and will soon post in the arxiv. ...
doi:10.1007/978-3-319-68376-8_15
fatcat:hgv6fw5r7rhuvpoyno4jgzw3ye
A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We develop a finite-state automata approach, implemented in a Maple package ToadsAndFrogs available from our websites, for conjecturing, and then rigorously proving, values for large families of positions ...
In particular, we prove a conjecture of Jeff Erickson. ...
Then he improved the program by making use of the symbolic computation capability of Maple, to formulate conjectures, and prove the values of game-positions. ...
arXiv:0710.4951v1
fatcat:lwztsd45ibbprhltq4bkspcuqe
Dave Robbins' art of guessing
2005
Advances in Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Luckily, the unclassified ten percent of Dave's work is more than enough to make him immortal. ...
Once we have the notion of ASM, it is not hard, with Maple once again, to conjecture (DaveHoward). ...
Using classical stuff about Schur functions, one easily gets that the number of Gelfand-Zeitlin patterns with bottom row equaling 12 . . . n is 2 n(n−1)/2 . ...
doi:10.1016/j.aam.2004.04.004
fatcat:tvr33wlxmrgdvhetfhrtnfnvae
Using Technology in a Differential Equations Course: Lessons Learned Implementing a New Paradigm
2011
CODEE Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In an attempt to make the course more interesting and less daunting, a new paradigm was adopted-a paradigm that incorporates technology as a core component of the course, rather than just an "add on. " ...
Based on the direction field, make a conjecture about the asymptotic behavior of the solutions. ...
You will need to insert the points [ Based on your graph, make a conjecture about the relationship between the optimal harvesting rate and the initial sardine biomass. ...
doi:10.5642/codee.201108.01.01
fatcat:wlr4clhgqnhkple735yok4gbfy
Integrals Involving Rudin-Shapiro Polynomials and Sketch of a Proof of Saffari's Conjecture
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Continuing pioneering work of Christophe Doche and Laurent Habsieger from 2004, we develop computer algebra algorithms, implemented in Maple, for finding the (necessarily rational) generating function ...
proof of Saffari's conjecture here http://arxiv.org/abs/1606.01637] . ...
confirming Hugh Montgomery's conjecture, as well as giving the generating functions for 1 ≤ m < n ≤ N . ...
arXiv:1605.06679v2
fatcat:vm2eobpgmzc7hgr47tdf736yey
« Previous
Showing results 1 — 15 out of 5,002 results