Graph parameters from symplectic group invariants
نویسندگان
چکیده
منابع مشابه
Graph parameters from symplectic group invariants
In this paper we introduce, and characterize, a class of graph parameters obtained from tensor invariants of the symplectic group. These parameters are similar to partition functions of vertex models, as introduced by de la Harpe and Jones, [P. de la Harpe, V.F.R. Jones, Graph invariants related to statistical mechanical models: examples and problems, Journal of Combinatorial Theory, Series B 5...
متن کاملThe symplectic vortex equations and invariants of Hamiltonian group actions
In this paper we define invariants of Hamiltonian group actions for central regular values of the moment map. The key hypotheses are that the moment map is proper and that the ambient manifold is symplectically aspherical. The invariants are based on the symplectic vortex equations. Applications include an existence theorem for relative periodic orbits, a computation for circle actions on a com...
متن کاملLocal Symplectic Invariants for Curves
To the best of our knowledge, the study of the local symplectic invariants of submanifolds of Euclidean space was initiated by Chern and Wang in 1947, [6]. They considered mainly the case of curves and hypersurfaces, and obtained structure equations defining a set of local symplectic differential invariants for these objects. We should explain at this stage that by “symplectic invariants” we me...
متن کاملMore Constraints on Symplectic Forms from Seiberg-witten Invariants
Recently, Seiberg and Witten (see [SW1], [SW2], [W]) introduced a remarkable new equation which gives differential-topological invariants for a compact, oriented 4-manifold with a distinguished integral cohomology class which reduces mod(2) to the 2nd Steiffel-Whitney class of the manifold. A brief mathematical description of these new invariants is given in the recent preprint [KM1]. Using the...
متن کاملPolynomial graph invariants from homomorphism numbers
The number of homomorphisms hom(G,Kk) from a graph G to the complete graph Kk is the value of the chromatic polynomial of G at a positive integer k. This motivates the following (cf. [3]): Definition 1 A sequence of graphs (Hk), k = (k1, . . . , kh) ∈ N , is strongly polynomial if for every graph G there is a polynomial p(G; x1, . . . , xh) such that hom(G,Hk) = p(G; k1, . . . , kh) for every k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2017
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2016.10.002