SearcharxivSearch

arXiv subjects

Anand Babu

Publications and source records attributed to Anand Babu.

13 recordsLinked to original sources

Improved bounds for the lazy cops and robbers on generalized hypercubes

In Lazy Cops and Robbers, at most one cop moves on each cop turn. We study the lazy cop number of the generalized hypercube $Q(n,m)$, whose vertex set is ${\{0,1,\ldots,m\}}^n$. For each fixed integer $m\geq2$, we prove the asymptotic upper bound $$c_{\mathrm{L}}(Q(n,m))=O\!\left(\frac{{(m+1)}^n}{n^{3/2}}\right).$$ This result improves the upper bound of Sim, Tan, and Wong by a factor of $\log n$. The proof combines a moving dominating-set argument with an explicit dominating-set construction inside the support classes of each level. As a separate domination result, we show that, for fixed integers $m\geq2$ and $d\geq1$, the Hamming graph $K_m^{\square k}$ has a distance-$d$ dominating set of asymptotic size $O(m^k/k^d)$. This order is optimal up to a constant factor.

math.CO

New bounds on the Graham-Pollak theorem for hypergraphs

For a fixed $r$, let $f_r(n)$ denote the minimum number of complete $r$-partite $r$-uniform hypergraphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. It was known that $f_r(n) \leq (1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$, which was subsequently improved to $f_r(n)\le \left[ \frac{r}{2} \left(\frac{14}{15}\right)^{r/4} +o(1) \right] \binom{n}{\lfloor r/2\rfloor}$. Let $c_r$ be $\displaystyle \lim_{n \to \infty}\frac{f_r(n)}{\binom{n}{\lfloor r/2 \rfloor}}$. It was known that $c_r<1$ for every even $r \geq 4$, while for odd $r$ the smallest known value satisfying $c_r<1$ was $113$. In this note we lower this to $85$ and also provide a constant-factor improvement in the known bounds for $f_r(n)$.

math.CO

Almost balanced ordered biclique covering of graphs

Let $f(n,k)$ be the minimum size of a collection of bicliques such that (i) every edge of the complete graph $K_n$ is covered by at least one and at most $k$ bicliques in the collection, and (ii) for each edge $\{u,v\}$, the number of bicliques in which $u$ appears in the first class and $v$ in the second class differs by at most one from the number of bicliques in which $u$ appears in the second class and $v$ in the first class. For $k=1$, $f(n,k)$ reduces to the biclique partition number of $K_n$, and the Graham-Pollak theorem gives $f(n,1)=n-1$. For $k=2$, $f(n,k)$ is the ordered biclique partition number of $K_n$, for which it is known that $c_1 n^{1/2} \le f(n,2) \le c_2 n^{1/2+o(1)}$ for some positive constants $c_1$ and $c_2$. In this note, we give almost tight bounds for $f(n,k)$ for fixed $k \ge 2$: \[ (1+o(1))c_1(k)\cdot n^{\frac{1}{\lceil k/2\rceil+1}} \le f(n,k) \le (1+o(1))c_2(k)\cdot n^{\frac{1}{\lfloor k/2\rfloor+1}+o(1)}, \] where $c_1(k)$ and $c_2(k)$ are positive constants.

math.CO

Towards Automated Discovery: A Review of Generative Models, Multimodal Learning and Closed-Loop Workflows in Inverse Materials Design

Inverse materials design is shifting materials discovery from forward prediction toward targeted proposal of candidates that satisfy objectives under physical constraints. Here, we review advances in generative crystal structure modeling, multimodal learning, and closed-loop design pipelines for crystalline solids. We survey how generators learn chemical-structural priors from databases to enable controllable sampling of periodic structures, comparing variational autoencoders, normalizing flows, autoregressive models, and diffusion models. Across these families, we examine where feasibility constraints and physical priors enter, from representations and training objectives to sampling-time guidance, screening, and relaxation. We also discuss multimodal learning combining crystal structures, thermodynamic and electronic information, microscopy, spectroscopy, processing context, and scientific text to construct materials representations. Inverse-design strategies integrating conditional generation with latent optimization, Bayesian optimization, reinforcement learning, and active learning are also examined. We highlight recurring failure modes, including surrogate exploitation, diversity collapse, distribution shift, and the stability-synthesizability gap, and outline evaluation based on validity, novelty, uniqueness, stability, and cost. To support credible claims, we define a nine-rung discovery-credibility ladder and propose a minimum reporting standard: declared matching tolerances and database snapshots; separate reporting of uniqueness, training-set memorization, and external rediscovery; novelty as a continuous distance distribution; energy-above-hull distributions with functional and hull version; relaxation-survival and dynamical stability rates; and validation cost per credible hit. Headline validity or S.U.N. rates without these disclosures should be treated as uninformative.

cond-mat.mtrl-sci

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems

The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs needed to partition the edge set of $G$. Lyu and Hicks \cite{lyu2023finding} posed the open problem of whether \( \operatorname{bp}(G) = \operatorname{mc}(G^c) - 1 \) holds for every co-chordal graph or split graph, where \( \operatorname{mc}(G^c) \) denotes the number of maximal cliques in the complement of \( G \). Such a result would extend the celebrated Graham--Pollak theorem to a more general class of graphs. In this note, we answer this problem in the negative by providing a counterexample using a split graph. We also construct an infinite family of counterexamples and prove some structural properties of biclique partitions of split graphs. Finally, we solve an open problem posed by Siewert \cite{siewert2000biclique} on the existence of singular \(n\)-tournaments with binary rank \(n\).

math.CO

MEIDNet: Multimodal generative AI framework for inverse materials design

In this work, we present Multimodal Equivariant Inverse Design Network (MEIDNet), a framework that jointly learns structural information and materials properties through contrastive learning, while encoding structures via an equivariant graph neural network (EGNN). By combining generative inverse design with multimodal learning, our approach accelerates the exploration of chemical-structural space and facilitates the discovery of materials that satisfy predefined property targets. MEIDNet exhibits strong latent-space alignment with cosine similarity 0.96 by fusion of three modalities through cross-modal learning. Through implementation of curriculum learning strategies, MEIDNet achieves ~60 times higher learning efficiency than conventional training techniques. The potential of our multimodal approach is demonstrated by generating low-bandgap perovskite structures at a stable, unique, and novel (SUN) rate of 13.6 %, which are further validated by ab initio methods. Our inverse design framework demonstrates both scalability and adaptability, paving the way for the universal learning of chemical space across diverse modalities.

cond-mat.mtrl-sci

Exact Biclique Partition number of Split Graphs

The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs that partition the edge set of \(G\). The Graham-Pollak theorem states that the complete graph on \( n \) vertices cannot be partitioned into fewer than \( n-1 \) bicliques. In this note, we show that for any split graph \( G \), the biclique partition number satisfies \( \operatorname{bp}(G) = \operatorname{mc}(G^c) - 1 \), where \( \operatorname{mc}(G^c) \) denotes the number of maximal cliques in the complement of \( G \). This extends the celebrated Graham-Pollak theorem to a broader class of graphs.

math.CO

SciQu: Accelerating Materials Properties Prediction with Automated Literature Mining for Self-Driving Laboratories

Assessing different material properties to predict specific attributes, such as band gap, resistivity, young modulus, work function, and refractive index, is a fundamental requirement for materials science-based applications. However, the process is time-consuming and often requires extensive literature reviews and numerous experiments. Our study addresses these challenges by leveraging machine learning to analyze material properties with greater precision and efficiency. By automating the data extraction process and using the extracted information to train machine learning models, our developed model, SciQu, optimizes material properties. As a proof of concept, we predicted the refractive index of materials using data extracted from numerous research articles with SciQu, considering input descriptors such as space group, volume, and bandgap with Root Mean Square Error (RMSE) 0.068 and R2 0.94. Thus, SciQu not only predicts the properties of materials but also plays a key role in self-driving laboratories by optimizing the synthesis parameters to achieve precise shape, size, and phase of the materials subjected to the input parameters.

cond-mat.mtrl-sci

Can Entanglement-enhanced Quantum Kernels Improve Data Classification?

Classical machine learning, extensively utilized across diverse domains, faces limitations in speed, efficiency, parallelism, and processing of complex datasets. In contrast, quantum machine learning algorithms offer significant advantages, including exponentially faster computations, enhanced data handling capabilities, inherent parallelism, and improved optimization for complex problems. In this study, we used the entanglement-enhanced quantum kernel in quantum support vector machine to train complex respiratory data sets. Compared to classical algorithms, our findings reveal that QSVM performs better with 45% higher accuracy for complex respiratory data sets while maintaining comparable performance with linear datasets in contrast to their classical counterparts executed on a 2-qubit system. Through our study, we investigate the efficacy of the QSVM-Kernel algorithm in harnessing the enhanced dimensionality of the quantum Hilbert space for effectively training complex datasets.

quant-ph

Improved Bounds for Multicovering Hypergraphs

The minimum number of bicliques needed to cover the edge set of the complete graph on $n$ vertices is $\lceil \log_2 n \rceil$. The Graham-Pollak theorem states that at least $n-1$ bicliques are required to partition the edge set of the complete graph on $n$ vertices. In this paper, we provide improvements for the generalizations of coverings of graphs and hypergraphs for some specific multiplicities. We also study an extension of the Katona-Szemer\'edi theorem to $r$-uniform hypergraphs.

math.CO

$δ$-PVDF Based Flexible Nanogenerator

Delta ($δ$) phase comprising polyvinylidene fluoride (PVDF) nanoparticles are fabricated through electrospray technique by applying 0.1 MV/m electric field at ambient temperature and pressure, which is 10$^{3}$ times lower than the typical value, required for $δ$-phase transformation. The X-ray diffraction (XRD) and selected area electron diffraction (SAED) patterns are clearly indicating the $δ$-phase formation. The piezo- and ferro- electric response of the $δ$-PVDF nanoparticles has been demonstrated through scanning probe microscopic technique based on piezoresponse force microscopy (PFM). The vertical piezoelectric response, indicated by d$_{33}$ coefficient, is found $\sim$-11 pm/V. Kink propagation model is adopted to justify the $δ$-phase conversion in electrospray system. The electrical response from $δ$-PVDF nanoparticle comprised nanogenerator under the external impacts and acoustic signal indicates that molecular ferroelectric dipoles responsible for piezoelectric responses, are poled in-situ during nanoparticle formation, thus further electrical poling is not necessary.

physics.app-ph

Chip Placement with Deep Reinforcement Learning

In this work, we present a learning-based approach to chip placement, one of the most complex and time-consuming stages of the chip design process. Unlike prior methods, our approach has the ability to learn from past experience and improve over time. In particular, as we train over a greater number of chip blocks, our method becomes better at rapidly generating optimized placements for previously unseen chip blocks. To achieve these results, we pose placement as a Reinforcement Learning (RL) problem and train an agent to place the nodes of a chip netlist onto a chip canvas. To enable our RL policy to generalize to unseen blocks, we ground representation learning in the supervised task of predicting placement quality. By designing a neural architecture that can accurately predict reward across a wide variety of netlists and their placements, we are able to generate rich feature embeddings of the input netlists. We then use this architecture as the encoder of our policy and value networks to enable transfer learning. Our objective is to minimize PPA (power, performance, and area), and we show that, in under 6 hours, our method can generate placements that are superhuman or comparable on modern accelerator netlists, whereas existing baselines require human experts in the loop and take several weeks.

cs.LG

Bounds for the Graham-Pollak Theorem for Hypergraphs

Let $f_r(n)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. An upper bound of $(1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$ was known. Recently this was improved to $\frac{14}{15}(1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$ for even $r \geq 4$. A bound of $\bigg[\frac{r}{2}(\frac{14}{15})^{\frac{r}{4}}+o(1)\bigg](1+o(1)){n \choose \lfloor{\frac{r}{2}}\rfloor}$ was also proved recently. The smallest odd $r$ for which $c_r < 1$ that was known was for $r=295$. In this note we improve this to $c_{113}<1$ and also give better upper bounds for $f_r(n)$, for small values of even $r$.

math.CO