Papers by Tejasvi S. Tomar https://www.mefyi.com/papers/ 2026-10-19T00:00:00Z Tejasvi Singh Tomarhttps://www.mefyi.com/ A matching threshold of 1.6×10⁻³ for the rotated surface code under circuit-level noise https://www.mefyi.com/papers/surface-code-matching-threshold/ 2026-10-19T00:00:00Z For the rotated surface code under circuit-level noise, the logical error rate of matching decays exponentially in the distance whenever p ≤ 1.6×10⁻³. Sorting networks on 13 inputs need at least 44 comparators https://www.mefyi.com/papers/sorting-networks-13-inputs/ 2026-10-18T00:00:00Z Raises the proved lower bound for 13 inputs from 43 to 44 comparators. Area law for three-dimensional U(1) lattice gauge theory with the Wilson action at every coupling https://www.mefyi.com/papers/u1-wilson-area-law/ 2026-10-18T00:00:00Z Three-dimensional U(1) lattice gauge theory with the Wilson action confines static charges at every coupling. Smale's sixth problem for six bodies in the plane: finiteness of central configurations for generic masses, with a proof formalized in Lean https://www.mefyi.com/papers/smale-6-six-body-generic/ 2026-10-17T00:00:00Z Finiteness for six bodies in the plane at generic masses, outside a proper algebraic subset of the mass space. Complex solution sets of the planar five-body problem at special masses https://www.mefyi.com/papers/five-body-complex-solution-sets/ 2026-10-17T00:00:00Z Explicit complex solution sets at three special mass vectors, one of which carries a continuum of complex solutions. Finiteness at these masses follows without counting. A formal proof in Lean of the finiteness of planar central configurations of five bodies https://www.mefyi.com/papers/smale-6-five-body-lean/ 2026-10-16T00:00:00Z The Lean 4 and Mathlib formalization of the five-body theorem, checked by the kernel and by two independent kernels. The number of planar central configurations of four bodies https://www.mefyi.com/papers/four-body-cc-count/ 2026-10-10T00:00:00Z The number of four-body central configurations for all masses outside a closed null set: always even, between 32 and 50. Smale's sixth problem for five bodies in the plane, with a proof formalized in Lean https://www.mefyi.com/papers/smale-6-five-body/ 2026-10-09T00:00:00Z Every choice of five positive masses gives finitely many planar central configurations, up to similarity. The rank of 3×3 matrix multiplication over F2 is 23 https://www.mefyi.com/papers/rank-3x3-matmul-f2/ 2026-10-08T00:00:00Z Laderman's algorithm uses the fewest multiplications among all bilinear algorithms over F2. Uniqueness of four-body convex central configurations for all masses https://www.mefyi.com/papers/four-body-convex-uniqueness/ 2026-09-27T00:00:00Z For any four positive masses and any cyclic ordering of the bodies there is exactly one strictly convex central configuration with that ordering, up to similarity. Operon Finder: A Deep Learning-based Web Server for Accurate Prediction of Prokaryotic Operons https://www.mefyi.com/papers/operon-finder/ 2023-07-15T00:00:00Z A web server that predicts operons in prokaryotic genomes with a deep-learning model. A resource-efficient deep learning framework for pest and disease detection in plants https://www.mefyi.com/papers/plant-pest-disease-detection/ 2020-08-31T00:00:00Z A lightweight MobileNetV2-based model that identifies plant pests and diseases, optimized to run on Android.