Skip to content
#explainable ai Open access

An infinite family of non-star trees admitting Laplacian peak state transfer

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications

Abstract

Unrefereed AI-assisted preprint, version 0.2.2, 9 October 2026. No author affiliation is given. For each m >= 1, set q = m^2 + m + 1. Attach q intermediate vertices to a root and q - 1 leaves to each intermediate vertex. This produces infinitely many pairwise nonisomorphic non-star trees of order q^2 + 1, with root Laplacian spectral support {0, m^2 + 1, (m + 1)^2 + 1}. The symbolic argument establishes Laplacian peak state transfer at time pi from the root to an intermediate vertex for odd m and to a leaf for even m, addressing Open Problem 7.1 of Coutinho, Guo and Schmeits, arXiv:2505.11986v4. The ten-vertex m = 1 member is their known Figure 10 example. Phase alignment is an application of their Lemma 5.2 and Corollary 5.3; the general peak-time classification follows their Theorem 5.4 and Corollary 5.5. The contribution presented here is the explicit infinite family and its spectral coefficients, targets and gcd calculation. For the specified pairs, all positive peak times are odd multiples of pi/g, where g = 5 when m = 2 mod 5 and otherwise g = 1. Novelty and priority are not certified. Peak transfer means attaining the mutual-projector absolute-sum bound, not unit amplitude. The probabilities tend to zero along both parity subsequences. This does not establish perfect transfer, efficient long-distance quantum communication or a classification of all trees. Exact standard-library reruns check actual full-tree Laplacians for m = 1..5, quotients for m = 1..1000, and gcd/phase regressions for m = 1..10000. Those finite checks support, not replace, the symbolic all-parameter proof and the analytic all-real-time Bezout argument. No complete Lean or other proof-assistant verification is supplied. 本研究は、清水竣平が個人の自主研究として企画・進行した、AIを活用した数学探索です。清水は探索方針の指示、検証の手配、成果の取りまとめを担当しました。証明の構成、計算による検証、原稿作成の大部分にはAIを使用しています。検証方法とその範囲は本文に記載しており、人間の専門家による査読は未実施です。 This work is an AI-assisted mathematical exploration initiated and coordinated by Shunpei Shimizu as a personal independent research project. Shimizu directed the exploration, arranged verification, and compiled the results. AI systems performed most proof construction, computational checking, and manuscript preparation. The verification methods and their scope are documented in the manuscript. The work has not received specialist human peer review. The submitter has not independently certified every mathematical step. Separate AI analyses and implementations are not human refereeing. No cited-author or institutional endorsement is implied. Read peak_trees_en_v0.2.2.tex first. The current package is Quantum_peak_trees_publication_v0.2.2_20261009.zip; QUANTUM_TREES_README_PUBLICATION_v0.2.2_EN.md explains its contents. Version 0.2.2 removes author affiliation; mathematical text, equations, statements, proofs and verification programs are unchanged from version 0.2.1. The current package omits old manuscript sources and old full ZIPs. Earlier verification records retain their original dates; they are not human peer review. The built-in LaTeX compiler failed at Windows environment setup before TeX diagnostics. No PDF has been generated or visually verified; editable TeX and exact-check code are supplied. Documentation clarification, 10 October 2026. The retained README_EN.txt and README_JA.md are historical documentation; the corresponding preserved v0.1.0 copies describe the 8 October 2026 working draft. QUANTUM_TREES_README_PUBLICATION_v0.2.1_EN.md describes the superseded v0.2.1 package. Their source names, payload inventories, draft-status statements and no-Publish instructions are dated history, not the current record state or operative instructions. Independent checks in those documents mean separate AI analyses or implementations, not human refereeing. The current entrypoints are peak_trees_en_v0.2.2.tex, Quantum_peak_trees_publication_v0.2.2_20261009.zip and QUANTUM_TREES_README_PUBLICATION_v0.2.2_EN.md. Refer to the current TeX for the argument where historical checker comments mention an absent review.md. This notice makes no change to the mathematical manuscript or verification programs. Publication packaging clarification, 10 October 2026. In addition to the three historical READMEs identified above, the two QUANTUM_TREES_ATTRIBUTION_AI_ROLE_ADDENDUM files and novelty_attribution_math_monitor_review_20261009.zip are dated supplementary review records. The r1 addendum and the current v0.2.2 manuscript give the operative author and AI contribution disclosure. The novelty archive also compares other manuscripts; those comparisons are context, not additional results of this Quantum record. Earlier private-save and no-publication instructions describe past workflow only. Current scientific claims are the explicitly stated tree-family construction and specified-pair peak times. No mathematical content, verification program or frozen historical attachment is changed by this clarification.

View source

Similar papers

#artificial intelligence Conference Open access Apr 2020

ECCOLA - a Method for Implementing Ethically Aligned AI Systems

The method, ECCOLA, is presented, which aims at making the high-level AI ethics principles more practical, making it possible for developers to more easily implement them in practice.

Ville Vakkuri, Kai-Kristian Kemell, P. Abrahamsson · 64 citations · ⚡6
#computer vision Review Apr 2024

AI-powered Code Review with LLMs: Early Results

The goal is to not only refine the accuracy of the LLM-based tool but also to underscore its potential in streamlining the software development lifecycle through proactive code improvement and education.

Z. Rasheed, Malik Abdul Sami, Muhammad Waseem et al. · 62 citations · ⚡3
#computer vision Open access Mar 2024

LLM-based agents for automating the enhancement of user story quality: An early report

The use of large language models to automatically improve the user story quality in Austrian Post Group IT agile teams is explored, with a reference model for an Autonomous LLM-based Agent System developed and implemented at the company.

Zheying Zhang, M. Rayhan, Tomas Herda et al. · 48 citations · ⚡4
#computer vision Review Mar 2024

System for systematic literature review using multiple AI agents: Concept and an empirical evaluation

This paper introduces a novel multi-AI-agent system designed to fully automate SLRs, and demonstrates how it substantially reduces the time and effort traditionally required for SLRs while maintaining comprehensiveness and precision.

Abdul Malik Sami, Z. Rasheed, Kai-Kristian Kemell et al. · 44 citations · ⚡2
#computer vision Feb 2024

Can Large Language Models Serve as Data Analysts? A Multi-Agent Assisted Approach for Qualitative Data Analysis

The proposed LLM-based multi-agent system automates qualitative data analysis process, creating opportunities for researchers and practitioners, and future improvements focus on enhancing multilingual performance and integrating continuous expert feedback.

Z. Rasheed, Muhammad Waseem, Aakash Ahmad et al. · 41 citations
#artificial intelligence Conference Open access Jun 2018

The Key Concepts of Ethics of Artificial Intelligence

It is suggested that the focus on finding keywords is the first step in guiding and providing direction for future research in the AI ethics field.

Ville Vakkuri, P. Abrahamsson · 39 citations · ⚡2

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.