Quantitative Homogenization and Global Lipschitz Estimates for Elasticity with Periodic Rigid Inclusions

Yuanhang Liu, Yuxin Du · SSRN preprint

AI-generated summary: this description was generated by AI for quick orientation; please verify against the original links.

For domain experts: Studies the pure traction problem for linear elasticity with periodically distributed perfectly rigid inclusions. For compatible L² boundary tractions on a Lipschitz domain, it establishes an O(ε¹ᐟ²) error bound in H¹ for a smoothed first-order two-scale expansion. Under the stated stronger boundary smoothness and Hölder traction assumptions, it also proves an ε-uniform global Lipschitz estimate controlling the full gradient in both phases, including each rigid particle's rotation, after normalization modulo rigid motions. A local Neumann comparison estimate, independent of which inclusions are retained in cells cut by an artificial localization boundary, combines cellwise rigidification, divergence-free stress extensions, and duality to support a boundary Campanato iteration. The authors report using AIM to explore theorem formulations, proof frameworks, and parts of the proofs; they independently verified, revised, and finalized all mathematical statements and proofs.

For general readers: How does an elastic material containing a repeating pattern of perfectly rigid particles deform under forces applied to its boundary? This work quantifies the accuracy of a homogenized approximation and, under smoothness assumptions, shows that displacement gradients remain bounded independently of the microscopic period. The bound also controls the rotation of each rigid particle after fixing the overall rigid motion. AIM assisted the mathematical exploration and proof development, with the final statements and proofs independently checked and finalized by the authors.

Yau's number-theoretic conjecture and sharp spectral bounds for quantum harmonic oscillators

Zhiwen Liu, Stephen S.-T. Yau, Hao Zuo · arXiv preprint

AI-generated summary: this description was generated by AI for quick orientation; please verify against the original links.

For domain experts: Proves Yau's conjectured sharp polynomial bound for positive integer points in real right simplices in every dimension n at least 3, whenever the count is nonzero; equality holds precisely for equal integer intercepts. Applications give sharp harmonic-oscillator eigenvalue-count bounds and, for rational frequency ratios, first Riesz-mean bounds via an additional lattice coordinate and interpolation. The authors report using ChatGPT, including through AIM, for language editing, mathematical exposition, and proof details, with all AI-assisted material reviewed and verified by the authors.

For general readers: How many integer grid points fit inside a higher-dimensional simplex? This work resolves Yau's conjecture on that count and uses the result to bound the number of quantum harmonic-oscillator states below a given energy. Equal-frequency oscillators attain the bounds at their energy levels.

Well-posedness of Filtering Equations in Weighted Sobolev Spaces with Unbounded System Coefficients

Zeju Sun, Songlin Zhou, Stephen S.-T. Yau · arXiv preprint

AI-generated summary: this description was generated by AI for quick orientation; please verify against the original links.

For domain experts: Establishes existence and uniqueness for the robust DMZ, stochastic DMZ, and Kushner-Stratonovich equations under suitable assumptions allowing polynomially growing coefficients. Exponential weights support a variational proof, while gauge transformations connect the equations through buffered weighted Sobolev spaces. AIM assisted with identifying and testing the weight scale and organizing proof steps; the authors selected the final assumptions and verified the results.

For general readers: Filtering estimates a hidden system's state from noisy measurements. This work gives conditions ensuring that three central filtering equations have unique solutions even when model coefficients grow without bound. AIM helped explore mathematical tools and draft arguments, with the final results checked by the researchers.

Derivations of Generalized Moduli Algebras of Isolated Hypersurface Singularities

Zhiwen Liu, Stephen S.-T. Yau · arXiv preprint

AI-generated summary: this description was generated by AI for quick orientation; please verify against the original links.

For domain experts: Determines the difference between the dimensions of the Yau algebra and the new Yau algebra of an isolated complex hypersurface singularity in terms of the Hessian corank. The two derivation Lie algebras vanish in the Morse case; when the Hessian corank is one, the new invariant is smaller by one; otherwise their dimensions agree. In particular, equality holds when n is at least 2 and mult(f) is at least 3, proving a conjecture of Chen--Hussain--Yau--Zuo. An exact sequence with end terms given by copies of the Milnor algebra's socle explains the underlying dimension count.

For general readers: This work compares two algebraic measurements of the infinitesimal symmetries of an isolated hypersurface singularity. It shows that their dimensions are usually equal, with a precise one-dimensional exception controlled by the degeneracy of the Hessian, and thereby resolves a previously proposed conjecture.

Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions

Yanqiao Wang, Jin-Peng Liu · arXiv preprint

AI-generated summary: this description was generated by AI for quick orientation; please verify against the original links.

For domain experts: Develops a sign-embedding framework for operator-output quantum algorithms targeting matrix equations and matrix functions. The approach uses augmented matrices, half-plane matrix signs, logarithmic-sinc approximations, and rebalanced shifted inverse families to handle Sylvester-type equations, Lyapunov equations, matrix square roots, matrix geometric means, and Riccati equations.

For general readers: This work explores quantum algorithms for difficult matrix computations that appear in scientific computing and applied mathematics. Its main contribution is a reusable framework that may help quantum computers solve several families of matrix problems more systematically.

AI Mathematician as a Partner in Advancing Mathematical Discovery -- A Case Study in Homogenization Theory

Yuanhang Liu, Beichen Wang, Peng Li, Yang Liu · arXiv preprint

AI-generated summary: this description was generated by AI for quick orientation; please verify against the original links.

For domain experts: Studies AIM-assisted proof development for a homogenization-theory problem. The work combines autonomous reasoning trajectories with targeted human interventions to decompose the proof, select analytical tools, validate intermediate claims, and assemble a complete argument under human oversight.

For general readers: This case study shows how AIM can support mathematicians on a long and technical proof. AIM helps propose reasoning steps and organize the search, while human researchers guide, check, and refine the proof to maintain mathematical rigor.