|
Some computer programs I have created
|
||||||||
| Remark 1: None of the Borland's Turbo Pascal (TP 7.0) programs, that is, my old programs, runs in modern computers. (To run them, we would need an old Windows or DOS environment). Remark 2: Some fire walls may prohibit downloading *.exe files. In this case you can possibly download the corresponding *.fut or *.e&! files and rename them to *.exe . Remark 3: Usually some data files as examples are also provided. As a first step, it is a good idea to give one of them when the program prompts for an input file name. Also, these files contains information how to use the programs. |
||||||||
|
equ2024p, 2024
(Mini-package to find four-element horizontal generating sets of Eq(n) ) (Dev-Pascal 1.9.2, Windows ~10) Download: source files (and almost surely downloadable coded exe files) or exe files |
||||||||
|
fano.mws and gauss-binomial.mws, 2024
(A computation in the square of the subspace lattice of the Fano plane and computing some Gaussian binomial coefficients) (Maple V Release 5 (1997); run this Maple version, say, in Windows XP environment simulated by Oracle VM VirtualBox 6.0 (2019) under, say, Windows 10 Pro) Download: fano (Maple format) , (*.txt) Download: gauss-binomial (Maple format) , (*.txt) Related paper: G. Czédli: Generating subspace lattices, their direct products, and their direct powers; see here or extended arXiv version . |
||||||||
|
mingenfd(r)to-k 2023
(To determine the minimum number of elements that generate a direct power of a free distributive lattice) (Maple V Release 5 (1997); run this Maple version, say, in Windows XP environment simulated by Oracle VM VirtualBox 6.0 (2019) under, say, Windows 10 Pro) Download: Maple worksheet, the program (=worksheet) in plain text file Related paper: G. Czédli: Minimum-sized generating sets of the direct powers of free distributive lattices; see here or extended arXiv version . |
||||||||
|
BooGnFtr 2023
(Two programs for counting the k-element generating vectors of the 2^n-element Boolean lattice) (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10) Download: executable programs, their source files, renamed executable programs, info Related paper: G. Czédli: Generating Boolean lattices by few elements and a protocol for authentication and cryptography based on an NP-complete problem; see here . |
||||||||
|
atoms3 2020
(programs for counting the possible numbers of atoms and coatoms in a small variety lattices) (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10) Download: executable programs, program source files and data files, executable programs renamed to *.fut. Related paper: G. Czédli: Atoms and coatoms in three-generated lattices; see here or in arXiv . |
||||||||
|
isitlatt 2020
(decides whether a poset is a lattice) (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10) This program is a satellite program of atoms3. The program can only be downloaded together with atoms3; see above. |
||||||||
|
Equgen 2020
(programs for counting k-element generating sets of partitions lattices) (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10, and in Maple V. release 5 (1997)) Download: 0-readme1st-egu4gen.txt, equ4genexe.zip, equ4genpas.zip, and equ4genelse.zip . Earlier versions and data for k>4: equmgn.zip and equmgn.exe. (If your system prohibits downloading the latter, then download only the former, unzip it, and read 0-read-me-first.txt in it). Late (and faster) versions of November, 2020 (for counting the 4-element generating set of the direct product Equ(n)*Equ(m); written after that the joint paper below had appeared): download prodequgen-info&data&fut.zip and rename the *.fut files in it into *.exe files (or, instead of renaming, download prodequgen-exe.zip as well). These programs, except the late versions, have been used by the papers: G. Czédli: Four-generated direct powers of partition lattices and authentication"; see here or in arXiv ; G. Czédli and . Oluoch: Four-element generating sets of partition lattices and their direct products; see here or in arXiv. |
||||||||
|
sublatts, a program for counting sublattices
2019 (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10) Download: sublatts.exe = sublatts<filesize>.e&! , sublatts.pas source file , information, data-files (for 83 subnearlattices).zip . (If your system forbids downloading *.exe, then download the *.e&! file and rename it to *.exe.) This program is used in my paper "Planar semilattices and nearlattices with eighty-three subnearlattices"; see, e.g., in arXiv. |
||||||||
|
subsize, a program for counting subuniverses
2019 (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10) Download: subsize.exe = subsize.e&! , subsize.pas source file , information, data-files (for 83 sublattices).zip, data-file(for-127-subsemilattices).zip (If your system forbids downloading *.exe, then download *.e&! and rename it to *.exe.) This program is used in my papers "Eighty-three sublattices and planarity" and "One hundred twenty-seven subsemilattices and planarity". |
||||||||
|
wpflCzG, a program for the word problem of free lattices
2018 (written in Dev-Pascal v. 1.19.2 (Freepascal), runs under Windows 10) Download: wpflCzG.exe = wpflCzG.e&! , information, all files (source and sample inputs) |
||||||||
|
A Maple worksheet to compute slim rectangular lattices
of a given length (2013) For definitions see G. Czédli, T. Dékány, G. Gyenizse and J. Kunos: Save executable Maple worksheet (Maple version V.5) Read it here: Maple.txt. |
||||||||
|
A Maple worksheet to decide if a cyclic (=inscribed) polygon is constructible with compass and ruler (2013)
(A satelite work to the following papers; see it for definitions) |
||||||||
|
A Maple worksheet to compute slim semimodular lattices
of a given length (2011) For definitions see G. Czédli, L. Ozsvárt and B. Udvari: Save executable Maple worksheet (Maple version V.5) Read it here: Maple.txt. |
||||||||
|
A Maple worksheet to verify identities in some modes
(namely, in barycentric algebras) (2011) For definitions see G. Czédli and A. B. Romanowska: Some modes with new algebraic closures, Algebra Universalis, submitted. pdf Save executable Maple worksheet (Maple version V.5) Read it here: Maple html. |
||||||||
|
A Borland's Turbo Pascal program to calculate stronger associations
(2006) For definitions and details see my paper [72]. Executable versions: stras-f.exe (runs faster without range-checking), stras-s.exe (runs safer and slower with several automatic checkings in the code). [stras-f.fut, stras-s.fut] Source files: stras.pas, strasmem.pas, newdelay.pas Example data files: strasdata.zip |
||||||||
|
A Borland's Turbo Pascal program to solve the word problem for lattices
(1995) For (my own) algorithm see my papers [27 ] and [38] Executable version: lwp.exe [lwp.fut] Example data files plus lwp.exe in one zipped file |
||||||||
|
Borland's Turbo Pascal program: Euklid 2.0 - a polynomial calculator (1997)
This program performs calculations with polynomials like an every-day calculator with numbers. (However, the power of this program is limited; for seriuous tasks you need something better, like Maple or Mathematica) . Just after starting, the 3rd line tells you how to use the English version. Related material: all the Maple worksheets (zipped) from our book (with Ágnes Szendrei) "Geometric constructibility" (available only in Hungarian) |
||||||||
|
A Borland's Turbo Pascal program to test if a lattice identity holds in the congruence variety of the variety generated by the quaternion group
Warning: this program does not run in nowaday's computers! The program would need the old environment (DOS and slower computers), or one should adjust the source file to the recent environment. (Using newdelay.pas, like in the 2006 program, could be a solution.) For details cf. my paper [35]. The program is here. |
||||||||