SearcharxivSearch

arXiv subjects

Ashwin Murali

Publications and source records attributed to Ashwin Murali.

5 recordsLinked to original sources

DeepRetro: Retrosynthetic Pathway Discovery using Iterative LLM Reasoning

The synthesis of complex natural products remains one of the grand challenges of organic chemistry. We present DeepRetro, a major advancement in computational retrosynthesis that enables the discovery of viable synthetic routes for complex molecules typically considered beyond the reach of existing retrosynthetic methods. DeepRetro is a novel, open-source framework that tightly integrates large language models (LLMs), traditional retrosynthetic engines, and expert human feedback in an iterative design loop. Prior approaches rely solely on template-based methods or unconstrained LLM outputs. In contrast, DeepRetro combines the precision of template-based methods with the generative flexibility of LLMs, controlled by rigorous chemical validity checks and enhanced by recursive refinement. This hybrid system dynamically explores and revises synthetic pathways, guided by both algorithmic checks and expert chemist feedback through an interactive user interface. While DeepRetro achieves strong performance on standard retrosynthesis benchmarks, its true strength lies in its ability to propose novel, viable pathways to highly complex natural products-targets that have historically eluded automated planning. Through detailed case studies, we illustrate how this approach enables new routes for total synthesis and facilitates human-machine collaboration in organic chemistry. Beyond retrosynthesis, DeepRetro represents a working model for how to leverage LLMs in scientific discovery. We provide a transparent account of the system's design, algorithms, and human-feedback loop, enabling broad adaptation across scientific domains. By releasing DeepRetro as an open-source tool, we aim to empower chemists to tackle increasingly ambitious synthetic targets, accelerating progress in drug discovery, materials design, and beyond.

q-bio.QM

Adiabatic modulation of driving protocols in periodically driven quantum systems

We consider a periodically driven system where the high-frequency driving protocol consists of a sequence of potentials switched on and off at different instants within a period. We explore the possibility of introducing an adiabatic modulation of the driving protocol by considering a slow evolution of the instants when the sequence of potentials is switched on/off. We examine how this influences the long-term dynamics of periodically driven quantum systems. By assuming that the slow and fast timescales in the problem can be decoupled, we derive the stroboscopic (effective) Hamiltonian for a four-step driving sequence up to the first order in perturbation theory. We then apply this approach to a spin-$1/2$ system, where the adiabatic modulation of the driving protocol is chosen to produce an evolving emergent magnetic field that interacts with the spin. We study the emergence of diabolical points and diabolical loci in the parameter space of the effective Hamiltonian. Further, we study the topological properties of the maps of the adiabatic paths in the parameter space to the eigenspace of the effective Hamiltonian. In effect, we obtain a technique for tuning the topological properties of the eigenstates by selecting different adiabatic evolutions of the driving protocol, characterized by distinct paths in parameter space. This technique can be applied to any periodic driving protocol to achieve desirable topological effects.

quant-ph

Digraph homomorphism problem and weak near unanimity polymorphism

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $ϕ$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is polynomial-time solvable. This gives proof of the dichotomy conjecture (now dichotomy theorem) by Feder and Vardi. Our approach is combinatorial, and it is simpler than the two algorithms found by Bulatov and Zhuk. We have implemented our algorithm and show some experimental results. We use our algorithm together with the recent result [38] for recognition of Maltsev polymorphisms and decide in polynomial time if a given relational structure $\mathcal{R}$ admits a weak near unanimity polymorphism.

cs.CC

Digraphs Homomorphism Problems with Maltsev Condition

We consider a generalization of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$, HOM($H$). In this setting, we are given an input digraph $G$ together with a list function from $G$ to $2^H$. The goal is to find a homomorphism from $G$ to $H$ with respect to the lists if one exists. We show that if the list function is a Maltsev polymorphism then deciding whether $G$ admits a homomorphism to $H$ is polynomial time solvable. In our approach, we only use the existence of the Maltsev polymorphism. Furthermore, we show that deciding whether a relational structure $\mathcal{R}$ admits a Maltsev polymorphism is a special case of finding a homormphism from a graph $G$ to a graph $H$ and a list function with a Maltsev polymorphism. Since the existence of Maltsev is not required in our algorithm, we can decide in polynomial time whether the relational structure $\mathcal{R}$ admits Maltsev or not. We also discuss forbidden obstructions for the instances admitting Maltsev list polymorphism. We have implemented our algorithm and tested on instances arising from linear equations, and other types of instances.

cs.DS

Dichotomy for Digraph Homomorphism Problems

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $ϕ$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is polynomial time solvable? This gives a proof of the dichotomy conjecture (now dichotomy theorem) by Feder and Vardi [29]. Our approach is combinatorial, and it is simpler than the two algorithms found by Bulatov [9] and Zhuk [46] in 2017. We have implemented our algorithm and show some experimental results.

cs.CC