Zobrazeno 1 - 10
of 6 595
pro vyhledávání: '"Roy, Amit"'
Let $I(G)^{[k]}$ denote the $k^{th}$ square-free power of the edge ideal $I(G)$ of a graph $G$. In this article, we provide a precise formula for the depth of $I(G)^{[k]}$ when $G$ is a Cohen-Macaulay forest. Using this, we show that for a Cohen-Maca
Externí odkaz:
http://arxiv.org/abs/2409.06021
In this article, we give combinatorial formulas for the regularity and the projective dimension of $3$-path ideals of chordal graphs, extending the well-known formulas for the edge ideals of chordal graphs given in terms of the induced matching numbe
Externí odkaz:
http://arxiv.org/abs/2405.15897
Let $G$ be a finite simple graph and let $NI(G)$ denote the closed neighborhood ideal of $G$ in a polynomial ring $R$. We show that if $G$ is a forest, then the Castelnuovo-Mumford regularity of $R/NI(G)$ is the same as the matching number of $G$, th
Externí odkaz:
http://arxiv.org/abs/2401.04683
Autor:
Patra, Sourav Kanti, Roy, Amit
Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $r$ be a positive integer. We consider the hypergraph $\mathrm{Con}_r(G)$ whose vertices are the vertices of $G$ and the (hyper)edges are all $A\subseteq V(G)$ such that $|A|=r+1$ and
Externí odkaz:
http://arxiv.org/abs/2311.07308
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active area of rese
Externí odkaz:
http://arxiv.org/abs/2311.02430
Autor:
Glauche, Ingmar, Kuhn, Matthias, Baldow, Christoph, Schulze, Philipp, Rothe, Tino, Liebscher, Hendrik, Roy, Amit, Wang, Xiaoning, Roeder, Ingo
Longitudinal monitoring of BCR-ABL transcript levels in peripheral blood of CML patients treated with tyrosine kinase inhibitors (TKI) revealed a typical biphasic response. Although second generation TKIs like dasatinib proved more efficient in achie
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A32495
https://tud.qucosa.de/api/qucosa%3A32495/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A32495/attachment/ATT-0/
Publikováno v:
The 17th ACM International Conference on Web Search and Data Mining (WSDM-2024)
Graph Anomaly Detection (GAD) is a technique used to identify abnormal nodes within graphs, finding applications in network security, fraud detection, social media spam detection, and various other domains. A common method for GAD is Graph Auto-Encod
Externí odkaz:
http://arxiv.org/abs/2306.01951
Autor:
Roy Arpita, Kunwar Srijal, Bhusal Utsav, Idris Dahir Sagir, Alghamdi Saad, Chidambaram Kumarappan, Qureshi Absar Ahmed, Qusty Naeem F., Khan Abduljawad Abdulshakor, Kaur Kirtanjot, Roy Amit
Publikováno v:
Green Processing and Synthesis, Vol 13, Iss 1, Pp 282-9 (2024)
Over the past few decades, nanotechnology has gained momentum because of its potential to create a safer and healthier living environment using eco-friendly approaches. This study describes a safer, more dependable, and ecologically friendly techniqu
Externí odkaz:
https://doaj.org/article/240be5a3bd8d4fc680f57f07099c18ff
Handwritten circuit diagrams from educational scenarios or historic sources usually exist on analogue media. For deriving their functional principles or flaws automatically, they need to be digitized, extracting their electrical graph. Recently, the
Externí odkaz:
http://arxiv.org/abs/2301.03155
Autor:
Sahni, Mohit, Mishra, Rahul Kumar, Gupta, Aarti, Thapa, Bhim Sen, Thakur, Anjali, Khan, Azmat Ali, Pandit, Soumya, Sharma, Kuldeep, Roy, Amit, Malik, Abdul, Jadhav, Dipak A.
Publikováno v:
In Desalination 15 October 2024 587