arXiv subjects

Santanu Mandal

Publications and source records attributed to Santanu Mandal.

12 recordsLinked to original sources

arXiv2025

Classical string profile for a class of DDF amplitudes

In the critical bosonic string theory, we explicitly evaluate the three point scattering amplitude at tree level, of a photon with two massive higher spins. The massive excitations belong to states of the form $A_{-r_1}^{s_1} A_{-r_2}^{s_2}$ where $A_{-n}$ is a DDF creation operator. Next, we take the infinite ``spin'' limit to arrive at the classical string dynamics. We find a rotating ``floppy'' string lying mostly on a plane which develops a transverse kink.

hep-th↗

arXiv2024

Chaotic and Thermal Aspects in the Highly Excited String S-Matrix

We compute tree level scattering amplitudes involving more than one highly excited states and tachyons in bosonic string theory. We use these amplitudes to understand chaotic and thermal aspects of the excited string states lending support to the Susskind-Horowitz-Polchinski correspondence principle. The unaveraged amplitudes exhibit chaos in the resonance distribution as a function of kinematic parameters, which can be described by random matrix theory. Upon coarse-graining these amplitudes are shown to exponentiate, and capture various thermal features, including features of a stringy version of the eigenstate thermalization hypothesis as well as notions of typicality. Further, we compute the effective string form factor corresponding to the highly excited states, and argue for the random walk behaviour of the long strings.

hep-th↗

arXiv2024

On finite groups whose power graph is claw-free

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of the two cyclic subgroups $\langle g_1\rangle, \langle g_2\rangle$ is contained in the other. It is denoted by $P(G)$. The reduced power graph, denoted by $P^*(G),$ is the subgraph of $P(G)$ induced by the non-identity elements. The main purpose of this paper is to explore the finite groups whose reduced power graph is claw-free. In particular we prove that if $P^*(G)$ is claw-free, then either $G$ is solvable or $G$ is an almost simple group. In the second case the socle of $G$ is isomorphic to $PSL(2,q)$ for suitable choices of $q$. Finally we prove that if $P^*(G)$ is claw-free, then the order of $G$ is divisible by at most 5 different primes.

math.GR↗

arXiv2023

Co-maximal subgroup graph characterized by forbidden subgraphs

In this communication, the co-maximal subgroup graph $Γ(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the necessary and sufficient conditions for $Γ(G)$ to be a cluster graph, triangle-free graph, claw-free graph, cograph, chordal graph, threshold graph and split graph. For the case of finite nilpotent group, we are able to classify it entirely. Moreover, we derive the complete structure of finite abelian group $G$ such that $Γ(G)$ is a split graph. We leave the readers with a few unsolved questions.

math.CO↗

arXiv2023

Further study on forbidden subgraphs of power graph

The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are adjacent if and only if either $u=v^m$ or $v=u^n$ for some positive integers $m$, $n$. Forbidden subgraph has a significant role in graph theory. In our previous work \cite{cmm}, we consider five important classes of forbidden subgraphs of power graph which include perfect graphs, cographs, chordal graphs, split graphs and threshold graphs. In this communication, we go even further in that way. This study, inspired by the articles \cite{celmmp,dong,ck}, examines additional $4$ significant forbidden classes, including chain graphs, diamond-free graphs, $\{P_{5}, \overline{P_{5}}\}$-free graphs and $\{P_{2}\cup P_{3}, \overline{P_{2}\cup P_{3}}\}$-free graph. The finite groups whose power graphs are chain graphs, diamond-free graphs, and $\{P_{2}\cup P_{3}, \overline{P_{2}\cup P_{3}}\}$-free graphs have been successfully identified in this work. In case of $\{P_{5}, \overline{P_{5}}\}$-free graphs, we completely determine all the nilpotent groups, direct product of two groups, finite simple groups whose power graph is $\{P_{5}, \overline{P_{5}}\}$-free.

math.CO↗

arXiv2023

Intersection subgroup graph with forbidden subgraphs

Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $Γ_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some non-trivial subgroup $K$ of $G$; two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K=\{e\}$, where $e$ is the identity element of $G$. In this communication, we explore the groups whose intersection subgroup graph belongs to several significant graph classes including cluster graphs, perfect graphs, cographs, chordal graphs, bipartite graphs, triangle-free and claw-fee graphs. We categorize each nilpotent group $G$ so that $Γ_S(G)$ belongs to the above classes. We entirely classify the simple group of Lie type whose intersection subgroup graph is a cograph. Moreover, we deduce that $Γ_{S}(G)$ is neither a cograph nor a chordal graph if $G$ is a torsion-free nilpotent group.

math.CO↗

arXiv2023

Laplacian eigenvalues and eigenspaces of cographs generated by finite sequence

In this paper we consider particular graphs defined by $\overline{\overline{\overline{K_{α_1}}\cup K_{α_2}}\cup\cdots \cup K_{α_k}}$, where $k$ is even, $K_α$ is a complete graph on $α$ vertices, $\cup$ stands for the disjoint union and an overline denotes the complementary graph. These graphs do not contain the $4$-vertex path as an induced subgraph, i.e., they belong to the class of cographs. In addition, they are iteratively constructed from the generating sequence $(α_1, α_2, \ldots, α_k)$. Our primary question is what invariants or graph properties can be deduced form a given sequence. In this context, we compute the Lapacian eigenvalues and the corresponding eigenspaces, and derive a lower and an upper bound for the number of distinct Laplacian eigenvalues. We also determine the graphs under consideration with a fixed number of vertices that either minimize or maximize the algebraic connectivity (that is the second smallest Laplacian eigenvalue). The clique number is computed in terms of a generating sequence and a relationship between it and the algebraic connectivity is established.

math.CO↗

arXiv2023

A short note on cospectral and integral chain graphs for Seidel matrix

In this brief communication, we investigate the cospectral as well integral chain graphs for Seidel matrix, a key component to study the structural properties of equiangular lines in space. We derive a formula that allows to generate an infinite number of inequivalent chain graphs with identical spectrum. In addition, we obtain a family of Seidel integral chain graphs. This contrapositively answers a problem posed by Greaves ["Equiangular line systems and switching classes containing regular graphs", Linear Algebra Appl., (2018)] ("Does every Seidel matrix with precisely three distinct rational eigenvalues contain a regular graph in its switching class?"). Our observation is- "no".

math.CO↗

arXiv2022

Spectral properties of $\mathcal{C}$-graphs

Assumed to be undirected, simple, and connected are all of the graphs in this study, and adjacency matrix $A$ serves as the associated matrix. In this paper we show that it is possible to relate a creation sequence for a type of cographs (we call it $\mathcal{C}$-graphs). Those cographs can be defined by a finite sequence of natural numbers. Using that sequence we obtain the inertia of the cograph under consideration. An extended eigenvalue-free set from $(-1,0)$ to $\big{[}\frac{-1-\sqrt{2}}{2}, -1)\cup (-1, 0) \cup (0, \frac{-1+\sqrt{2}}{2}\alpha_{min}\big{]}$, (where $\alpha_{min}\geq1$ is the smallest integer of the creation sequence) is obtained for the cographs under consideration. Additionally, an exact formula is found for the characteristic polynomial.

math.CO↗

arXiv2022

On the spectrum and energy of Seidel matrix for chain graphs

We study various spectral properties of the Seidel matrix $S$ of a connected chain graph. We prove that $-1$ is always an eigenvalue of $S$ and all other eigenvalues of $S$ can have multiplicity at most two. We obtain the multiplicity of the Seidel eigenvalue $-1$, minimum number of distinct eigenvalues, eigenvalue bounds, characteristic polynomial, lower and upper bounds of Seidel energy of a chain graph. It is also shown that the energy bounds obtained here work better than the bounds conjectured by Haemers. We also obtain the minimal Seidel energy for some special chain graphs of order $n$. We also give a number of open problems.

math.CO↗

arXiv2022

AQuaMoHo: Localized Low-Cost Outdoor Air Quality Sensing over a Thermo-Hygrometer

Efficient air quality sensing serves as one of the essential services provided in any recent smart city. Mostly facilitated by sparsely deployed Air Quality Monitoring Stations (AQMSs) that are difficult to install and maintain, the overall spatial variation heavily impacts air quality monitoring for locations far enough from these pre-deployed public infrastructures. To mitigate this, we in this paper propose a framework named AQuaMoHo that can annotate data obtained from a low-cost thermo-hygrometer (as the sole physical sensing device) with the AQI labels, with the help of additional publicly crawled Spatio-temporal information of that locality. At its core, AQuaMoHo exploits the temporal patterns from a set of readily available spatial features using an LSTM-based model and further enhances the overall quality of the annotation using temporal attention. From a thorough study of two different cities, we observe that AQuaMoHo can significantly help annotate the air quality data on a personal scale.

cs.CY↗

arXiv2021

On the Seidel spectrum of threshold graphs

In this paper, we analyse spectral properties of Seidel matrix (denoted by $S$) of connected threshold graphs. We compute the characteristic polynomial and determinant of Seidel matrix of threshold graphs. We derive formulas for the multiplicity of the eigenvalues $\pm 1$ of $S$. Further we determine threshold graphs with at most 5 distinct Seidel eigenvalues. Finally we construct families of Seidel cospectral threshold graphs.

math.CO↗