scientific article; zbMATH DE number 3326387
From MaRDI portal
Publication:5605168
zbMath0205.28402MaRDI QIDQ5605168
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On the linear classification of even and odd permutation matrices and the complexity of computing the permanent ⋮ Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices ⋮ Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians ⋮ Graphs determined by polynomial invariants ⋮ The combinatorial approach yields an NC algorithm for computing Pfaffians ⋮ Full ellipsoid embeddings and toric mutations ⋮ Factors and factorizations of graphs—a survey ⋮ A quadratic identity for the number of perfect matchings of plane graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ A new approach to solving three combinatorial enumeration problems on planar graphs ⋮ Families of convex tilings ⋮ Valiant's holant theorem and matchgate tensors ⋮ Computational complexity of counting problems on 3-regular planar graphs ⋮ Complexity of Ising Polynomials ⋮ Replacing Pfaffians and applications ⋮ Drawing 4-Pfaffian graphs on the torus ⋮ Dimers on surface graphs and spin structures. I ⋮ Generating bricks ⋮ Dimer coverings of 1-slab cubic lattices ⋮ Edge vectors on plabic networks in the disk and amalgamation of totally non-negative Grassmannians ⋮ Mahler measure for a quiver symphony ⋮ Arctic curves phenomena for bounded lecture Hall tableaux ⋮ Spectral curves of periodic Fisher graphs ⋮ A conjecture of Norine and Thomas for abelian Cayley graphs ⋮ Integrability of limit shapes of the six vertex model ⋮ The \(Z\)-invariant Ising model via dimers ⋮ Holographic algorithms by Fibonacci gates ⋮ Holographic algorithms without matchgates ⋮ The Pfaffian property of graphs on the Möbius strip based on topological resolution ⋮ On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) ⋮ Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts ⋮ Topological string amplitudes and Seiberg-Witten prepotentials from the counting of dimers in transverse flux ⋮ The Pfaffian property of Cayley graphs on dihedral groups ⋮ Almost exact matchings ⋮ Characterizations of graphs having orientations satisfying local degree restrictions ⋮ Lozenge tiling function ratios for hexagons with dents on two sides ⋮ From cycle rooted spanning forests to the critical Ising model: an explicit construction ⋮ Unnamed Item ⋮ Graph coverings and twisted operators ⋮ Loop Groups, Clusters, Dimers and Integrable Systems ⋮ Pfaffian orientations for a type of bipartite graph ⋮ Enumeration of perfect matchings of the Cartesian products of graphs ⋮ Principal minors Pfaffian half-tree theorem ⋮ Dehn coloring and the dimer model for knots ⋮ Deterministically isolating a perfect matching in bipartite planar graphs ⋮ Using edge generating function to solve monomer-dimer problem ⋮ A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory ⋮ Walks and cycles on a digraph with application to population dynamics ⋮ On the Complexity of Holant Problems ⋮ Pattern densities in non-frozen planar dimer models ⋮ Pseudo-centrosymmetric matrices, with applications to counting perfect matchings ⋮ Identities between dimer partition functions on different surfaces ⋮ On the Monomer–Dimer Problem of Some Graphs ⋮ On the evolution of random graphs over expanding square lattices ⋮ Non-colliding paths in the honeycomb dimer model and the Dyson process ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ The Even Cycle Problem for Directed Graphs ⋮ Critical resonance in the non-intersecting lattice path model ⋮ The complexity of planar Boolean \#CSP with complex weights ⋮ Conformal limit for dimer models on the hexagonal lattice ⋮ The Pfaffian property of Cartesian products of graphs ⋮ On the 2D Ising Wulff crystal near criticality ⋮ Clifford gates in the Holant framework ⋮ Dimer model: Full asymptotic expansion of the partition function ⋮ Probability distributions related to tilings of non-convex polygons ⋮ A simple explanation for the ``shuffling phenomenon for lozenge tilings of dented hexagons ⋮ Limit shapes, real and imagined ⋮ Limit shapes for the asymmetric five vertex model ⋮ Limit shapes of the stochastic six vertex model ⋮ Pfaffian orientations and perfect matchings of scale-free networks ⋮ A generalisation of the honeycomb dimer model to higher dimensions ⋮ Tilings of non-convex polygons, skew-Young tableaux and determinantal processes ⋮ Height fluctuations in the honeycomb dimer model ⋮ The \(Z\)-Dirac and massive Laplacian operators in the \(Z\)-invariant Ising model ⋮ A polyomino tiling problem of Thurston and its configurational entropy ⋮ Counting the number of perfect matchings, and generalized decision trees ⋮ A dimer ABC: ⋮ Boundary partitions in trees and dimers ⋮ On the computational complexity of the Jones and Tutte polynomials ⋮ A Complete Dichotomy Rises from the Capture of Vanishing Signatures ⋮ Kasteleyn theorem, geometric signatures and KP-II divisors on planar bipartite networks in the disk ⋮ Pfaffian pairs and parities: counting on linear matroid intersection and parity problems ⋮ A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems ⋮ A new proof of a characterisation of Pfaffian bipartite graphs ⋮ Counting edge-injective homomorphisms and matchings on restricted graph classes ⋮ FKT is not universal -- a planar holant dichotomy for symmetric constraints ⋮ On hearing the shape o f combinatorial drums ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs ⋮ How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids ⋮ Bipartite Perfect Matching is in Quasi-NC ⋮ The multinomial tiling model ⋮ A characterization of convertible (0,1)-matrices ⋮ Spanning trees and dimer problem on the Cairo pentagonal lattice ⋮ Advanced determinant calculus: a complement ⋮ Colouring non-even digraphs ⋮ A characterisation of Pfaffian near bipartite graphs ⋮ Matching theory and Barnette's conjecture ⋮ Computation of sparse circulant permanents via determinants ⋮ Enumeration of perfect matchings of a type of Cartesian products of graphs ⋮ AMOEBAS AND INSTANTONS
This page was built for publication:
