Search arXiv⌕ Search

arXiv subjects

Pushparaj Devadiga

Publications and source records attributed to Pushparaj Devadiga.

3 recordsLinked to original sources

Topological Deep Learning Challenge 2026: Bridging the Gap

This paper describes the 2026 edition of the Topological Deep Learning Challenge: Bridging the Gap, hosted at the second Topology, Algebra, and Geometry in Data Science (TAG-DS) Conference. Where previous editions grew the modelling and data ecosystem of Topological Deep Learning (TDL), this edition set out to place Graph Neural Networks (GNNs) and Topological Neural Networks (TNNs) side by side under a single evaluation pipeline. Participants implemented recent state-of-the-art architectures in TopoBench, with Track 1 covering GNNs and Track 2 covering TNNs. They evaluated these implementations on shared synthetic benchmarks generated with GraphUniverse, which independently controls homophily, average degree and degree-distribution heaviness. The challenge yielded 68 qualifying submissions from 34 teams, spanning the graph, simplicial, cellular, hypergraph and combinatorial domains. For the first time, submissions were also tracked on a public leaderboard, which we summarize and analyze here. Our analysis finds that the differences between the submitted tracks are strongly task-dependent: the mean accuracy gap is modest on community detection, while on triangle counting the Track 1 mean error is 1.85 times the Track 2 mean. Several structurally informed GNNs also outperform the Track 2 mean on triangle counting.

cs.LG↗

The Geometric Function Atlas: Using What We Know About Radius Problems to Solve New Ones

Usually, radius problems between Ma--Minda classes are solved one pair at a time, by fitting a disk inside the target region, providing a sufficient but not always the sharp radius. The same class appearing under different names makes comparison of results harder, with mistakes and duplication eluding detection. The Geometric Function Atlas catalogs radius problems using exact generators and a direction (source $\to$ target), ensuring unique identification. For each problem, we then compute the radius numerically, together with the point where the image first meets the target boundary. This helps us identify the sharp estimate which guides the proof we write. With this system, we were able to refine two earlier stated estimates, the disk radius for the sine $\to$ modified sigmoid and sine $\to$ rational cases from $\operatorname{arsinh} c$ to $\arcsin c$, and correct earlier stated values for the crescent and exponential classes: the sharp radius is $\sin 1$ from crescent to exponential, and $\log(1+\sqrt2)$ from exponential to crescent. All four proofs follow a common strategy: an estimate that is exact at the contact point, followed by the standard extremal function. Applying the method, we derive fifteen further sharp radii, four of them known.

math.CV↗

Geometric Function Atlas: certified computing for geometric function theory in Python

We describe geometric-function-atlas, our open-source Python package for the sharp extremal problems of geometric function theory. We organise it around a catalogue of thirty-nine Ma--Minda starlike generators. From this catalogue we compute exact Taylor coefficients, closed-form Fekete--Szegő constants, exact coefficients of the Ma--Minda extremal function, and admissibility screens. Our verifier answers membership questions for normalised polynomials at three levels of evidence: a floating-point grid screen, an exact sufficient condition decided in rational arithmetic, and a certified interval enclosure at the worst screened point. Every answer names the level at which we obtained it. We ship a checksummed artifact snapshot with three hundred and six coefficient certificates and seven hundred and two directed inclusion radii. Eight reviewed radius lanes carry certificates whose proof chains we replay symbolically, and we re-execute every coefficient certificate through our exact Schur-parameter machinery on request. We emit all results through one versioned envelope that records the method, the evidence status, the assumptions, and the artifact identifiers. Two optional laboratories apply the same discipline to cryptographic S-box metrics and to image-quality metrics. We present our design, state as propositions what each tier establishes, follow one radius lane from screen to replayed certificate, report measured timings, and place our package among symbolic-algebra, rigorous-numerics, and mathematical-database software. We release geometric-function-atlas under the MIT licence on the Python Package Index and at https://github.com/Prasanna28Devadiga/geometric-function-atlas.

cs.MS↗