Results 101 to 110 of about 8,525 (305)

Genus two partition and correlation functions for fermionic vertex operator superalgebras I

, 2010
We define the partition and n-point correlation functions for a vertex operator superalgebra on a genus two Riemann surface formed by sewing two tori together. For the free fermion vertex operator superalgebra we obtain a closed formula for the genus two
Alexander Zuevsky, Zuevsky, Alexander, Zuevsky, A., Tuite, Michael P., Tuite, M., Michael P. Tuite   +5 more
core   +1 more source

PET Imaging of Cardiac Inflammation in Viral Myocarditis Using a DPP4‐Targeted Probe

Advanced Science, EarlyView.
This study describes a DPP4‐targeted PET probe for imaging myocardial inflammation by selectively targeting activated immune cells. Derived from the clinically approved small‐molecule inhibitor linagliptin, the probe demonstrates favorable biodistribution with specific cardiac uptake in myocarditis.
Wanhao Gao, Wenzhu Hu, Du Tang, Xinxin Liu, Kun Yu, Lixia Feng, Minyu Liao, Wang Lin, Wenqiang Zhu, Sanjay Rajagopalan, Xiaoli Lan, Jixin Zhong, Dao Wen Wang, Dawei Jiang, Xiaoquan Rao   +14 more
wiley   +1 more source

Weighted Partition Vertex and Edge Cover

CoRR
We study generalizations of the classical Vertex Cover and Edge Cover problems that incorporate group-wise coverage constraints. Our first focus is the \emph{Weighted Prize-Collecting Partition Vertex Cover} (WP-PVC) problem: given a graph with weights on both vertices and edges, and a partition of the edge set into $ω$ groups, the goal is to select a ...
Rajni Dabas, Samir Khuller, Emilie Rivkin   +2 more
openaire   +2 more sources

Vertex partition problems in digraphs

Anais do III Encontro de Teoria da Computação (ETC 2018), 2018
Let D be a digraph and k be a positive integer. Linial (1981) conjec tured that the k-norm of a k-minimum path partition of a digraph D is at most max{ΣC∈C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it.
M. Sambinelli, C. N. Lintzmayer, C. N. da Silva, O. Lee   +3 more
openaire   +2 more sources

Ecological Adaptation Mechanisms Underlying Successful Plant Reproduction

Advanced Science, EarlyView.
During floral induction, various environmental and endogenous signals converge to regulate the florigen protein, which is transported from leaves to the SAM to initiate flowering. Within the SAM, a complex network of receptor kinases and small peptides orchestrates floral development with high spatiotemporal precision.
Hang Zhao, Shenghui Huo, Yue Xing, Shuxin Zhang, Guilin Li, Yihui Liu, Chongyang Jin, Fuguang Li, Xiaoyang Ge   +8 more
wiley   +1 more source

Cylinder partition function of the 6-vertex model from algebraic geometry

, 2020
We compute the exact partition function of the isotropic 6-vertex model on a cylinder geometry with free boundary conditions, for lattices of intermediate size, using Bethe ansatz and algebraic geometry.
Zhang, Yang, Nepomechie, Rafael I., Nepomechie, Rafael I, Jiang, Yunfeng, Bajnok, Zoltan, Jacobsen, Jesper Lykke   +5 more
core   +1 more source

4d/2d Correspondence: Instantons and W-Algebras [PDF]

, 2012
In this thesis, we study the 4d/2d correspondence of Alday-Gaiotto-Tachikawa, which relates the class of 4-dimensional N=2 gauge theories (theories of class S) to a 2-dimensional conformal field theory. The 4d gauge theories are obtained by compactifying
Song, Jaewon
core   +1 more source

3D Large‐Scale Subwavelength‐Resolution Sound Sheet Tomography Based on an Active and Programmable Circular Meta‐Array

Advanced Science, EarlyView.
A programmable 2048‐element circular ultrasound array combined with a compact acoustic lens produces a thin “sound sheet” over a large field of view, and records echoes with wide angular diversity across the ring aperture. Coherence‐enhanced beamforming converts full‐matrix data into high‐contrast tomographic slices, delivering near‐diffraction‐limited
Qiu‐De Zhang, Zi‐Bin Lin, Zhuo Chen, Zhao‐Hui Liu, Jin‐Lian He, Jun‐Jie Song, Long‐Sheng Zeng, Liang Zhou, Ming‐Yue Ding, Yu‐Gui Peng, Ming Yuchi, Xue‐Feng Zhu   +11 more
wiley   +1 more source

On Partition Dimension and Domination of Abid-Waheed 〖(AW)〗_r^4 Graph

مجلة بغداد للعلوم
A graph denoted by H, which has a simple link between its vertices, possesses the set of vertices V(H) . Given a graph,  a set that is dominant, is a subset of vertex set  such that any vertex outside of  is close to at least one vertex inside of .
Jalal Hatem Hussein Bayati , Abid Mahboob, Muhammad Waheed Rasheed , Dur e Najaf   +3 more
doaj   +1 more source

On The Partition Dimension of Disconnected Graphs

Journal of Mathematical and Fundamental Sciences, 2017
For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni, Edy Tri Baskoro , Suhadi Wido Saputro   +2 more
doaj   +1 more source