Results 11 to 20 of about 125,344 (284)
Characterizing partition functions of the vertex model
Journal of Algebra, 2012 We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of de la Harpe and Jones). We moreover characterize when the vertex model can be taken so that its moment matrix has finite rank.
Draisma, J. +4 more
openaire +8 more sources
Factorization of rational six vertex model partition functions
Nuclear Physics BWe show factorization formulas for a class of partition functions of rational six vertex model. First we show factorization formulas for partition functions under triangular boundary.
Kohei Motegi
doaj +3 more sources
Nullspace vertex partition in graphs [PDF]
Journal of Combinatorial Optimization, 2020 17 pages 6 ...
Irene Sciriha +2 more
openaire +3 more sources
Ordered Vertex Partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modular decomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems.
Ross M. McConnell, Jeremy P. Spinrad
openaire +5 more sources
Distance Domination in Vertex Partitioned Graphs
Mathematica Pannonica, 2022 We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables ...
Frendrup, Allan +2 more
openaire +2 more sources
$k$-Efficient partitions of graphs [PDF]
Communications in Combinatorics and Optimization, 2019 A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$.
M. Chellali +2 more
doaj +1 more source
Which metrics for vertex-cut partitioning? [PDF]
2016 11th International Conference for Internet Technology and Secured Transactions (ICITST), 2016 In this paper we focus on vertex-cut graph partitioning and we investigate how it is possible to evaluate the quality of a partition before running the computation. To this purpose we scrutinize a set of metrics proposed in literature. We carry experiments with the widely-used framework for graph processing Apache GraphX and we perform an accurate ...
Mykhailenko, Hlib +2 more
openaire +2 more sources
Topological strings and 5d T_N partition functions [PDF]
, 2014 We evaluate the Nekrasov partition function of 5d gauge theories engineered by webs of 5-branes, using the refined topological vertex on the dual Calabi-Yau threefolds. The theories include certain non-Lagrangian theories such as the T_N theory.
Hayashi, Hirotaka +2 more
core +3 more sources
Free Bosonic Vertex Operator Algebras on Genus Two Riemann Surfaces I [PDF]
, 2009 We define the partition and $n$-point functions for a vertex operator algebra on a genus two Riemann surface formed by sewing two tori together. We obtain closed formulas for the genus two partition function for the Heisenberg free bosonic string and for
Mason, Geoffrey, Tuite, Michael P.
core +5 more sources
Topological vertex for Higgsed 5d $T_N$ theories [PDF]
, 2015 We analyse the computation of the partition function of 5d $T_N$ theories in Higgs branches using the topological vertex. The theories are realised by a web of $(p,q)$ 5-branes whose dual description may be given by an M-theory compactification on a ...
Hayashi, Hirotaka, Zoccarato, Gianluca
core +3 more sources