Oct 2026· Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
Abstract
Let Hr be the Goodstein hyperoperation hierarchy, so that H3 is exponentiation and H4 tetration. For r ≥ 3 the operation is not associative, so the value of Hr(a1, …, an) depends on the bracketing, that is on a binary tree with n leaves. Write T ≤ev U when evr(T) ≤ evr(U) for every assignment of leaf values ≥ 2, and let ≤St be the Stanley order on those trees, which extends the Tamari order. At rank 3 we determine ≤ev completely: it is the Stanley order. The inclusion ≤St ⊆ ≤ev is due to Chow; we prove its converse, which he left open, constructively and with a bound. If T ≰St U then a single leaf separates them, and the value to put there is written down in advance as M = 2K2, where K is a product of subtree values read off from U. One family of n − 2 assignments, given in closed form, therefore decides the entire order. For every r ≥ 4 we prove that ≤St ⊆ ≤ev, the value increasing strictly along every Stanley cover; the semi-associative law that underlies this is not new, and we say where it is already stated. Equality in that law is settled by one statement covering every rank and every boundary case. The device throughout is the vector of right depths of the leaves. Much of the paper is machine-checked in Lean 4, and it is explicit about what is not. This is a preprint (33 pages; LaTeX source included). It has not been refereed. Use of AI-assisted tools. Generative AI tools (large language models) were used to find the proofs, and also for the computations, the formalisation and the writing. The author directed the work, reviewed and verified the resulting mathematical arguments, and takes full responsibility for the manuscript. The Lean 4 developments that accompany the paper are archived separately: version DOI 10.5281/zenodo.22789946 (tag v1.15.0-pre, the version the paper describes), concept DOI 10.5281/zenodo.22779441. The two files of this deposit are paper/hyper-tamari.tex and paper/hyper-tamari.pdf at commit 77989d1 of github.com/turahigashi/hyper-tamari, and are licensed under CC BY 4.0.
The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.
Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al.· IEEE Transactions on Softwar...· 178 citations· ⚡14
Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.
M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al.· e-Informatica Software Engin...· 157 citations· ⚡17
This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.
Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al.· Empirical Software Engineeri...· 127 citations· ⚡15
The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.
Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al.· Journal of Systems and Softw...· 111 citations· ⚡8
The ongoing work building a Raspberry Pi cluster consisting of 300 nodes is presented, with potential use cases being an inexpensive and green test bed for cloud computing research and a robust and mobile data center for operating in adverse environments.
P. Abrahamsson, S. Helmer, Nattakarn Phaphoom et al.· IEEE International Conferenc...· 110 citations· ⚡7
The results indicate that software developers are a slightly happy population, but the need for limiting the unhappiness of developers remains, and 219 factors representing causes of unhappiness while developing software are identified.
D. Graziotin, Fabian Fagerholm, Xiaofeng Wang et al.· International Conference on...· 84 citations· ⚡6
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.
Microsoft Research Blog· microsoft.comOct 22, 2026
Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.