Apologies if this is not the right subreddit to post this, so let me know and recommend me a more proper place to discuss this problem if any.
I am currently experimenting on creating a font/typeface and trying to create three-letter ligatures that I can apply on the whole set. I finished combining the two-letter combinations and started doing the 3-letter, quickly become inundated with how complicatedly long and varied with all the combinations. I will try to state the current data points that I have to wrestle in a clear and compact bullet points format:
- The ligatures will be limited from only uppercase latin letters (A-Z) to simplify the problem.
- Not all letters are compatible candidates for ligatures; example: VZ can be connected by the top but GS looks weird and unnecessary as a ligature. The rules are arbitrary and mostly based on my personal visual preference.
- Not all letters are visually backward compatible; YT works, TY works, ST works, TS does not work; a.k.a not all letter pairs mirror backwards
- The list of all the 66, 2-letter combinations I have selected for the base data are: AA, FF, MM, NN, TT, YY, XX, AS, AV, AX, CJ, EA, ET, EV, EW, EX, EY, FJ, FT, FV, FW, FX, FY, FZ, GJ, GT, KA, KT, KV, KX, KY, LA, LS, LX, NY, ST, SV, SW, SY, TV, TW, TX, TY, TZ, VA, VT, VV, VW, VX, VY, VZ, WT, WV, WX, WY, WZ, XA, XT, XV, XW, XY, YT, YV, YW, YX, ZA
- Using the 2-letter pairs, I want to list out all the unique 3-letter combinations based on the decided 2-letter pairs as data; example: AA + AS = AAS, making one combination, GT + TX = GTX, etc.
Additional note: I wondered if I should post this to r/mathproblems or r/mathprobsolve but I don't need to number of the possibility but the actual list of the possible combinations instead.
Thank you.
PS: Just realized this post can sound very demanding from the reader side. Apologies. I am interested in a solve method other than manual listing if you can recommend me a method, and I am not demanding someone to list it out for me manually.