Results 21 to 30 of about 332,227 (273)
Fibers add flavor. Part I. Classification of 5d SCFTs, flavor symmetries and BPS states
Journal of High Energy Physics, 2019 We propose a graph-based approach to 5d superconformal field theories (SCFTs) based on their realization as M-theory compactifications on singular elliptic Calabi-Yau threefolds.
Fabio Apruzzi +4 more
doaj +1 more source
A Note on Brill–Noether Theory and Rank-Determining Sets for Metric Graphs [PDF]
International Mathematics Research Notices, 2012 We produce open subsets of the moduli space of metric graphs without separating edges where the dimensions of Brill‐Noether loci are larger than the corresponding Brill‐Noether numbers. These graphs also have minimal rank-determining sets that are larger than expected, giving counterexamples to a conjecture of Luo.
Chang Mou Lim +2 more
openaire +1 more source
A 5d perspective on the compactifications of 6d SCFTs to 4d N $$ \mathcal{N} $$ = 1 SCFTs
Journal of High Energy Physics, 2022 Compactifying 6d superconformal field theories (SCFTs) to 4d N $$ \mathcal{N} $$ = 1 theories on two-punctured spheres (tubes) and tori with flux is realized using duality domain walls in 5d N $$ \mathcal{N} $$ = 1 Kaluza-Klein (KK) theories, which are ...
Evyatar Sabag, Matteo Sacchi
doaj +1 more source
Classical simulation versus universality in measurement based quantum computation [PDF]
, 2006 We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states, plays a ...
Briegel, H. J. +3 more
core +2 more sources
K-theory and homotopies of 2-cocycles on higher-rank graphs [PDF]
Pacific Journal of Mathematics, 2015 This paper continues our investigation into the question of when a homotopy $ = \{ _t\}_{t \in [0,1]}$ of 2-cocycles on a locally compact Hausdorff groupoid $\mathcal{G}$ gives rise to an isomorphism of the $K$-theory groups of the twisted groupoid $C^*$-algebras: $K_*(C^*(\mathcal{G}, _0)) \cong K_*(C^*(\mathcal{G}, _1)).$ In particular, we ...
openaire +3 more sources
A ranking for the nodes of directed graphs based on game theory (Poster Presentation) [PDF]
PAMM, 2007 AbstractWe introduce a value that allows us to emphasize the importance of each player in a cooperative game when the cooperation possibilities are limited according to the links of an oriented network. The proposed concept of accessibility tries to conjugate the marginal contributions of each node as a game player with the cooperation geometry imposed
Rafael Amer +2 more
openaire +1 more source
IET Cyber-Physical Systems, 2021 Moving target defence (MTD) has been gaining traction to thwart false data injection attacks against state estimation (SE) in the power grid. MTD actively perturbs the reactance of transmission lines equipped with distributed flexible AC transmission ...
Bo Liu, Hongyu Wu
doaj +1 more source
Skew-products of higher-rank graphs and crossed products by semigroups [PDF]
, 2013 We consider a free action of an Ore semigroup on a higher-rank graph, and the induced action by endomorphisms of the $C^*$-algebra of the graph. We show that the crossed product by this action is stably isomorphic to the $C^*$-algebra of a quotient graph.
Maloney, Ben, Pask, David, Raeburn, Iain
core +3 more sources
Water Resources Management, 2022 AbstractThe resilience assessment is crucial for many infrastructures, including water supply and distribution networks. In particular, the identification of the ‘critical’ components (nodes or pipes) whose failure may negatively affect network performances and system resilience is a key issue, with a direct relevance for decision-makers involved in ...
Pagano A., Giordano R., Portoghese I.
openaire +3 more sources
A new approach for ranking decision-making units in data envelopment analysis by using communication game theory [PDF]
Iranian Journal of Numerical Analysis and OptimizationRanking decision making units (DMUs) is an important topic in data en-velopment analysis (DEA). When efficient DMUs or inefficient DMUs have the same efficiency score, the traditional DEA model usually fails to rank all DMUs.
M. Amiri, A. Ashrafi
doaj +1 more source