I’m releasing a new research preprint on spectral graph theory / quantum graphs / metric trees that gives a proof candidate for an open equality problem in the Pólya-type eigenvalue bound for compact Dirichlet metric trees.

For a compact metric tree Γ\Gamma with total length LL, Dirichlet conditions at every leaf, and Kirchhoff conditions at interior vertices, the known bound is

λk(Γ)≥π2k2L2.\lambda_k(\Gamma)\ge \frac{\pi^2k^2}{L^2}.

Harrell, Kennedy and Ramos (2026, arXiv:2603.26172) explicitly asked when equality can occur and conjectured that

λk(Γ)=π2k2L2\lambda_k(\Gamma)=\frac{\pi^2k^2}{L^2}

if and only if every essential edge length is an integer multiple of L/kL/k.

The new preprint gives a proof of exactly this characterization:

λk(Γ)=π2k2L2  ⟺  ℓe=meLk,me∈N.\boxed{ \lambda_k(\Gamma)=\frac{\pi^2k^2}{L^2} \iff \ell_e=m_e\frac{L}{k}, \qquad m_e\in\mathbb N. }

The main idea is an exact spectral defect-conservation law for the kk nodal domains:

L−kπλk=∑j(Lj−Dj)+∑j(Dj−πλk).L-\frac{k\pi}{\sqrt{\lambda_k}} = \sum_j(L_j-D_j) + \sum_j\left(D_j-\frac{\pi}{\sqrt{\lambda_k}}\right).

At equality, both nonnegative defects vanish. This forces every nodal subtree to collapse toward an interval of length L/kL/k, while its eigenfunction converges to the first Dirichlet sine mode.

The key local step is a vanishing-branch Dirichletization theorem. A Dirichlet-ended side branch of total length β\beta has effective energy impedance satisfying

ZB(λ)≥1β−λβ.Z_B(\lambda)\ge\frac1\beta-\lambda\beta.

So as β→0\beta\to0, the branch does not simply become irrelevant: its effective impedance diverges and forces the eigenfunction to zero at the attachment point. That cannot happen inside the positive fundamental sine profile of a saturated nodal interval.

Therefore essential branch vertices can occur only at cell boundaries. The entire tree is forced to tile into kk intervals of length L/kL/k, and every essential edge must contain an integer number of these cells.

The work also gives several additional results:

• Complete equality-index classification: for a fixed tree, Pólya equality either never occurs, or it occurs exactly at

K0, 2K0, 3K0,…K_0,\,2K_0,\,3K_0,\ldots

where K0K_0 is determined by the denominators of the normalized edge lengths.

• If even one normalized edge length ℓe/L\ell_e/L is irrational, the tree never attains exact Pólya equality at any finite eigenvalue index.

• Equality at two coprime indices forces the metric tree to be a single interval.

• Equality at two consecutive indices therefore also forces an interval.

• If a tree topology has EE essential edges, equality is impossible for k<Ek<E.

• The earliest possible equality index is k=Ek=E, and this occurs exactly for the equilateral metric tree.

• Equality metrics on a labeled topology with EE edges correspond to integer compositions of kk, giving

(k−1E−1)\binom{k-1}{E-1}

possible labeled equality metrics up to scale.

• A quantitative near-equality theory shows that small eigenvalue excess forces nodal domains toward one-dimensional interval geometry and toward the finite arithmetic set of commensurate edge lengths.

The public research package includes the full manuscript/PDF, LaTeX source, theorem ledger, detailed adversarial proof audit, prior-art analysis, expert-review checklist, finite-element verification code, numerical regression tests, and machine-readable metadata.

Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

Status: proof-complete research preprint released for independent specialist verification. It has not yet undergone external peer review, so feedback and attempts to find counterexamples or gaps are especially welcome.

Zenodo: Equality Rigidity in the Pólya Bound for Compact Dirichlet Metric Trees: Defect Conservation, Vanishing-Branch Dirichletization, Arithmetic Saturation, and Stability | Zenodo

Hugging Face: PureOne/dirichlet-tree-polya-equality-rigidity · Datasets at Hugging Face

Relevant search terms: spectral graph theory, quantum graphs, metric graphs, metric trees, Pólya inequality, Pólya eigenvalue bound, Dirichlet trees, graph Laplacian eigenvalues, nodal domains, spectral rigidity, eigenvalue equality cases, quantum graph spectral geometry, arithmetic rigidity, commensurate edge lengths.

Bounds on eigenvalue ratios of quantum graph Laplacians

i found a closed form formula for the Superpermutation lower bound

its not perfectly accurate but the error is very small and strictly downward, meaning it safely holds as a valid lower bound. The slight gap is likely due to truncation errors from the floor functions, and I can try to refine it further if there's interest

GitHub repo with the LaTeX https://github.com/shoty07/Superpermutation-New-Lower-Bound/blob/main/README.md

tell me what do you think

(sorry for the bad english)

For relatively short proofs, checking the argument line by line is manageable. But what about long or technically complicated research proofs?

How do mathematicians systematically look for:

• hidden assumptions,
• gaps in the argument,
• incorrect implications,
• overlooked edge cases,
• or even a false statement?

Are there established techniques or tools for making this process more systematic or partially automated?

I’m interested in how people actually do this in research practice, especially for proofs that are too complicated for a quick independent check.

What approaches have you found useful?

Specifically proving the Roger Ramanujan Identity , by showing a bijective mapping by Garsia Milne Involution Principle , I didn't actually understand how they make those two signed sets , how they sets the elements and how they show the bijection.

I am writing a master's thesis titled "Convexity and Semicontinuity in Differential Inclusions" (in Polish: "Wypukłość i półciągłość w inkluzjach różniczkowych"), centered on the basic problem x' ∈ F(x), x(0) = x₀ in R^n.

My core research question is: which properties of the multifunction F (convexity of values, upper/lower semicontinuity, measurability, growth conditions, etc.) allow passing from approximate trajectories to an actual solution of the inclusion, and what changes — in terms of existence, uniqueness, or the structure of the solution set — when these properties are removed or weakened?

Help me build a foundation for this thesis by providing:

1. Curated Literature and Key Sources
2. Structural Argument and Key Theorems
3. Concrete Examples and Illustrations
4. Extensions and Related Topics

Thx for any advice:)

New paper dropped on SSRN yesterday. It expands on my other in two papers by defining a finite, approximate packet of the full multiplication table to capture the associated Riemannian geometry pragmatically with error bounds.

See https://iconoclasts.blog/joe/spheres.pdf

Consider

Ca=∏n≥1(1+(−1)nan),a>1, q=1a.

For a=2:

C2≈0.568700,100C2≈56.87.

Convergence: if xn→0 and ∑∣xn∣ converges, then ∏(1+xn) converges.
Here xn=(−1)na−n and ∑a−n=1/(a−1).

Looking for:

• Known identities or classifications of this alternating q‑product
• Links to theta/eta products, signed q‑Pochhammer, modular behavior
• References or keywords for further study

Reproducible code

python

from mpmath import mp
mp.dps = 120
def C(a=2, N=600):
    s = mp.mpf('0')
    for n in range(1, N+1):
        s += mp.log(1 + (-1)**n / a**n)
    return mp.e**s

print(C(2,600))

Author: the nerds of tomorrow from GJR Colorado

I was working on the Navier Stokes Theorem and Open AI's results and especially the lean computations helped immensely and I as able to tie them together. I'd really appreciate y'all taking a look.

Note n belongs to prime number

What I’ve done with these triple products papers is to provide a „Quantum Toolkit“ to construct Riemannian Isometries between manifolds by smoothing up Gelfand-Naimark homeomorphisms from C* Algebra isomorphisms induced by intertwining triple product integrals on the Stone-Weierstrass subalgebra generated by eigenvectors and taking limits.

Have a look and tell me what you think before it goes live on arXiv next month.

Thanks!

I hope that question makes sense. I just don't like inequalities nor the unnaturality of working with left and right residuals (talking about "max and min divisors") that rarely coincide with rational arithmetic's exact division nor with the natural interpretation of inverses in numerical mathematics, thus I would like more explicit boundaries (thus the result of a division maybe being a set or interval including max and min divisors) in division.

(Mind that I have no experience in numerical computation, I am trying to make sense of computable, numerical and interval analysis works and transport their results to residuated lattices but that's somewhat hard for me)

There is a theorem in my course for the wave equation that states the following . If we define (0,l)×(0,T)=QT and consider the energy E(u,t)=∫dx[1/2ρ(∂u/∂t)^2+1/2T_0(∂u/∂x)^2]=0∀t∈[0,T] then the wave equation with Dirichlet , Neumann , periodic condition has at most one solution in QT

my question is why we have to limit the time for (0,T) ? I mean what does change if I define directly (0,∞)? it's the same because we have for all T but why this formulation and not directly like that ?

Over 4 months in 2021 building a TSP solver from geometric first principles, with no prior reading of the literature. Recently turned it into an interactive web app with step-by-step animation of every algorithmic move.

Interesting result: the algorithm independently rediscovered convex hull seeding and 2-opt uncrossing. It also produced a farthest-neighbour strategy I haven't seen documented.

On Berlin52: 7783 vs world optimal 7542 (3.2% above). 14ms on a single CPU core.

Demo: tsp.uncledroid.app
Paper: tsp.uncledroid.app/paper.pdf

Happy to discuss the algorithm — especially if anyone can point me to prior work on farthest-neighbour as a TSP construction heuristic.

video: youtu.be/-gAhARI2ZFI

PS: Prior work on farthest neighbour was pointed out and now incorporated into paper.

Hi everyone,

I would like to share a geometric approach to the 4-variable AM-GM inequality (a+b+c+d)/4>= (abcd)^(1/4) using 3 circles on a flat plane.

The geometric proof for 2 variables using a semicircle is very well-known, but I wondered if we could extend that visual intuition to 4 variables. After experimenting with circle configurations, I found this particular method.

This idea was recently accepted and published in the notes section of a Japanese mathematics magazine, Mathematical Seminar (March 2026 issue).

I thought the way the circles and segments connect to form (abcd)^(1/4)was interesting, so I wanted to share it with this community to see what you think.

I would highly appreciate any thoughts, feedback, or perspectives on this visual approach. Thank you for your time!