Walnut 3 is now available! It contains several
new and useful commands.
It is available for download
here.
This version represents additional work done by Laindon C. Burnett
to the previous versions of Walnut written by Hamoon Mousavi and updated
by Aseem Raj Baranwal. For this version, you should type
java Main.Prover to get started, insted of the older
java Main.prover.
Walnut Software
Walnut is a free software program written by Hamoon Mousavi to
solve problems and answer questions, posed in first-order logic,
about automatic and related sequences. It can handle a wide variety
of problems. There are some recent additions to Walnut, written by
Aseem Baranwal.
The old version of Walnut is available at github. For the new version, see above.
After you download it and install it, go to the directory
Walnut/bin and type java Main.prover to get started.
A manual of how to use it is available on the
arxiv.
There is also a text file with some
examples of
how to use Walnut.
Here is a video tutorial
on how to use Walnut:
If you are using Walnut under the Eclipse environment, here are a few tips.
Download the Walnut software. Start Eclipse up. Use the default
workspace. Open "Project" from the File choices, and choose "Walnut".
Next, go to src/Main in the menu choices, right-click on prover.java
or Prover.java
and choose "Run As Java Application". You should now get a window where
you can enter Walnut commands. To see results, go to
the Eclipse file menu, right-click on "Result" and choose "Refresh" and
the results should be there. Thanks to Stepan Holub for this info.
Recently Walnut has been modified by Aseem Baranwal to handle the Pell
number system, and more generally, the Ostrowski number system based
on any quadratic irrational. To use this version of Walnut, visit
https://github.com/aseemrb/walnut. After you download and install it, go to the directory
Ostrowski/bin and type java Main.Prover to get started.
(Note: for the old Walnut, you use lowercase "p" in prover; for the
new version you use uppercase "P" in prover.)
The command "ost name [0 1 2] [3 4]", for example, defines
an Ostrowski number system for the continued fraction [0,1,2,3,4,3,4,3,4,...].
It can then be used by prefacing a query with "?msd_name" or "?lsd_name".
Aseem Baranwal has prepared a brief summary of his additions to
Walnut here.
If you find Walnut useful in your research, please be sure to cite
Hamoon Mousavi as the author of the software, and let me know what you
achieved with it.
Walnut has been used in a variety of papers. A partial list is here
(will be updated):
R. Burns, Factorials and Legendre's three-square theorem: II,
arxiv preprint arXiv:2203.16469 [math.NT],
March 30 2022. Available at https://arxiv.org/abs/2203.16469.
J. Shallit, Note on a Fibonacci parity sequence,
arxiv preprint arXiv:2203.10504 [cs.FL], March 20 2022.
Available at https://arxiv.org/abs/2203.10504.
N. Rampersad, The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word,
arxiv preprint arXiv:2112.04416, December 8 2021.
Available at https://arxiv.org/abs/2112.04416.
N. Rampersad, Prefixes of the Fibonacci word that end with a cube,
arxiv preprint arXiv:2111.09253, November 17 2021.
Available at https://arxiv.org/abs/2111.09253.
J. Shallit, Intertwining of Complementary Thue-Morse Factors,
arxiv preprint arXiv:2203.02917 [cs.FL], March 6 2022.
Available at https://arxiv.org/abs/2203.02917.
J. Shallit,
Sumsets of Wythoff sequences, Fibonacci representation, and beyond,
Periodica Mathematica Hungarica84 (2022), 37--46.
Available here.
Phakhinkon Napp Phunphayap, Prapanpong Pongsriiam, and
Jeffrey Shallit,
Sumsets associated with Beatty sequences, to appear,
Discrete Mathematics.
TP.txt file, place this in the
Word Automata directory of Walnut
C. S. Kaplan and J. Shallit,
A frameless 2-coloring of the plane lattice,
Math. Magazine94 (5) (2021), 353-360.
A limited number of free-eprints are available
here.
shift.txt (put this in the "Automata Library" of Walnut)
fibinc.txt (put this in the "Automata Library" of Walnut)
Jason P. Bell and J. Shallit,
Lie complexity of words, Arxiv preprint, Feb 7 2021,
arXiv:2102.03821 [cs.FL]. Available
here.
Aseem Baranwal, Luke Schaeffer, and Jeffrey Shallit,
Ostrowski-automatic sequences: Theory and applications,
Theor. Comput. Sci.858 (2021) 122-142. Available
here
until March 11 2021.
Aseem Raj Baranwal, Jeffrey Shallit,
Repetitions in infinite palindrome-rich words, arxiv preprint, April 22 2019.
In Mercas R., Reidenbach D. (eds.) Combinatorics on Words. WORDS 2019.
Lecture Notes in Computer Science, vol. 11682, Springer, 2019, pp. 93-105.
Available
here.
Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey Shallit,
New
results on pseudosquare avoidance, arxiv preprint, April 19 2019.
In Mercas R., Reidenbach D. (eds.) Combinatorics on Words. WORDS 2019.
Lecture Notes in Computer Science, vol. 11682, Springer, 2019, pp. 264-274.
Available
here.
T. Clokie, D. Gabric, and J. Shallit,
Circularly squarefree words and unbordered conjugates: a new approach,
arxiv preprint, April 17 2019.
In Mercas R., Reidenbach D. (eds.) Combinatorics on Words. WORDS 2019.
Lecture Notes in Computer Science, vol. 11682, Springer, 2019, pp. 264-274.
Available
here.
Aseem R. Baranwal, Jeffrey Shallit,
Critical exponent
of infinite balanced words via the Pell number system,
arxiv Preprint, February 1 2019.
In Mercas R., Reidenbach D. (eds.) Combinatorics on Words. WORDS 2019.
Lecture Notes in Computer Science, vol. 11682, Springer, 2019, pp. 80-92.
Available
here.
James Currie, Narad Rampersad, Tero Harju, and Pascal Ochem,
Some further results on squarefree arithmetic
progressions in infinite words,
arxiv preprint,
January 18 2019. Appeared in
Theoretical Computer Science799 (2019) 140-148.
James Currie and Narad Rampersad,
On some problems of Harju concerning squarefree
arithmetic progressions in infinite words,
arxiv preprint,
December 5 2018.
Lukasz Merta,
Formal inverses of the generalized Thue-Morse sequences
and variations of the Rudin-Shapiro sequence,
arxiv preprint,
October 8 2018. Appeared in
Discrete Mathematics and Theoretical Computer Science
Vol. 22:1, 2020, #15.
Colin Krawchuk and Narad Rampersad,
Cyclic Complexity of Some Infinite Words and Generalizations,
Integers18A (2018), #A12.
Jeffrey Shallit and Ramin Zarifi,
Circular critical exponents for Thueâ€“Morse factors,
RAIRO Info. Theor., published online 17 January 2019.
Available here.
Pierre Bonardo, Anna E. Frid, Jeffrey Shallit,
"The number of valid factorizations of Fibonacci prefixes",
Theor. Comput. Sci., 2019, to appear.
Available online at https://doi.org/10.1016/j.tcs.2018.12.016.
Jason Bell, Kathryn Hare and Jeffrey Shallit,
When is an automatic set an additive basis?
Proc. Amer. Math. Soc. Ser. B5 (2018), 50-63.
Available here.
Jason Bell, Thomas Finn Lidbetter, and Jeffrey Shallit,
Additive Number Theory via Approximation by Regular Languages,
arxiv preprint, April 23 2018. Appeared in M. Hoshi and S. Seki, eds.,
DLT 2018, LNCS Vol. 11088, Springer, 2018, pp. 121-132.
Here are text files describing how you can verify the results
yourself using Grail and Walnut.
James Currie, Lucas Mol, and Narad Rampersad,
A family of formulas with reversal of high avoidability index,
International Journal of Algebra and Computation27 (2017)
477-493.
A. Rajasekaran, N. Rampersad, J. Shallit,
Overpals, Underlaps, and Underpals,
in WORDS 2017: Combinatorics on Words, 2017, pp. 17-29.
Daniel Goc, Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit,
A New Approach to the Paperfolding Sequences,
in Arnold Beckmann, Victor Mitrana, Mariya Soskova, eds.,
Evolving Computability:
11th Conference on Computability in Europe, CiE 2015, Springer, LNICS,
Vol. 9136, 2015, pp. 34-43. Available
here.
H. Mousavi and J. Shallit,
Mechanical Proofs of Properties of the Tribonacci Word,
in
F. Manea and D. Nowotka, eds.,
WORDS 2015, LNCS 9304, Springer, 2015, pp. 1-21. Here are the
Walnut predicates you can use to reproduce most of the results in this
paper:
Daniel Goc, Narad Rampersad, Michel Rigo, Pavel Salimov,
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving)
Int. J. Found. Comput. Sci.25 (2014), 1097-1110.