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
The lifted root number conjecture for fields of prime degree over the rationals: an approach via trees and Euler systems, Remark on the dimer problem, Perfect matchings and perfect squares, Dimer problem for some three dimensional lattice graphs, Dimers on the \(3^3 . 4^2\) lattice, Symmetries of plane partitions and the permanent-determinant method, Bipartite dimer representation of squares of 2d-Ising correlations, On blockwise symmetric matchgate signatures and higher domain \#CSP, On the theory of matchgate computations, Exact arborescences, matchings and cycles, On blockwise symmetric signatures for matchgates, Convertible subspaces of Hessenberg-type matrices, On very sparse circulant \((0,1)\) matrices, A fast computer algorithm for finding the permanent of adjacency matrices, On the asymptotics of dimers on tori, Quadri-tilings of the plane, Matchings in benzene chains, Chiral flavors and M2-branes at toric CY\({}_4\) singularities, Lozenge tilings of hexagons with cuts and asymptotic fluctuations: a new universality class, NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem, Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values, \(P\) versus \(NP\) and geometry, Partition function of periodic isoradial dimer models, \(q\)-distributions on boxed plane partitions, Pfaffian graphs embedding on the torus, On the optimality of the Arf invariant formula for graph polynomials, A sufficient condition for Pfaffian graphs on the torus, Holographic algorithms: from art to science, The parity of a thicket, The critical \(Z\)-invariant Ising model via dimers: Locality property, Negation can be exponentially powerful, Generalized domino-shuffling., Current fluctuations of the stationary ASEP and six-vertex model, The walk distances in graphs, An efficient tree decomposition method for permanents and mixed discriminants, Towards a theory of frustrated degeneracy., General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems, Discrete Dirac operators on Riemann surfaces and Kasteleyn matrices, Holographic algorithms beyond matchgates, Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Counting dimer coverings on self-similar Schreier graphs, Phased graphs and graph energies, Pfaffian polyominos on the Klein bottle, An exact upper bound to the maximum number of perfect matchings in cubic pseudographs, Signature theory in holographic algorithms, On the algebraic complexity of some families of coloured Tutte polynomials, A collapse theorem for holographic algorithms with matchgates on domain size at most 4, The Pfaffian property of circulant graphs, Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes, State matrix recursion method and monomer-dimer problem, Binary linear codes via 4D discrete Ihara-Selberg function, Face-width of Pfaffian braces and polyhex graphs on surfaces, Discrete Dirac operators, critical embeddings and Ihara-Selberg functions, Branching random walk in random environment phase transitions for local and global growth rates, An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs, Counting the number of perfect matchings in \(K_{5}\)-free graphs, Minimally non-Pfaffian graphs, Holey matrimony: marrying two approaches to a tiling problem, Dimers, crystals and quantum Kostka numbers, An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values, Signed lozenge tilings, Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials, Elliptically distributed lozenge tilings of a hexagon, How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs, Alternating-sign matrices and domino tilings. II, Spin systems on \(k\)-regular graphs with complex edge functions, Alternating-sign matrices and domino tilings. I, Critical temperature of periodic Ising models, On symmetric signatures in holographic algorithms, Local statistics of realizable vertex models, A little statistical mechanics for the graph theorist, Resonance structure counts in parallelogram-like benzenoids with holes, Dimers, tilings and trees, The critical \(Z\)-invariant Ising model via dimers: the periodic case, The graph bottleneck identity, The Tutte-Potts connection in the presence of an external magnetic field, Spanning trees of 3-uniform hypergraphs, The free-fermionic \(C_2^{(1)}\) loop model, double dimers and Kashaev's recurrence, The Pfaffian sign theorem for the dimer model on a triangular lattice, Generalizing the divisibility property of rectangle domino tilings, Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices, Double handled brane tilings, Dimers on surface graphs and spin structures. II, The combinatorics of N. G. de Bruijn, A binomial approximation method for the Ising model, Shuffling algorithm for boxed plane partitions, Dimers on graphs in non-orientable surfaces, Holographic algorithms: the power of dimensionality resolved, On Kekulé structures count, Matchings in graphs on non-orientable surfaces, Loop statistics in the toroidal honeycomb dimer model, Non-integrable dimers: universal fluctuations of tilted height profiles, Exact and asymptotic enumeration of perfect matchings in self-similar graphs, Strong orientations without even directed circuits, Approximating the number of monomer-dimer coverings of a lattice., Fluxes, Laplacians, and Kasteleyn's theorem, The computational complexity of knot and matroid polynomials, Odd \(K_{3,3}\) subdivisions in bipartite graphs, Graphical condensation of plane graphs: a combinatorial approach, GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST, Double interlacing in random tiling models, Perfect matchings, rank of connection tensors and graph homomorphisms, TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT, Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain, Classification of a Class of Counting Problems Using Holographic Reductions, Elliptic dimers on minimal graphs and genus 1 Harnack curves, Isoradial immersions, Weakly nonplanar dimers, Asymptotics of noncolliding q-exchangeable random walks, Holographic algorithms on domains of general size, A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory, The Schwarzian octahedron recurrence (dSKP equation) I: explicit solutions, Undirected determinant and its complexity, Laplace and Dirac operators on graphs, Beyond windability: approximability of the four-vertex model, Classical Ising model test for quantum circuits, Random-link matching problems on random regular graphs, On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices, Monomer-dimer problem on random planar honeycomb lattice, Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP, Counting over non-planar graphs, Dimers and the critical Ising model on lattices of genus \(>1\), Subtraction-free complexity, cluster transformations, and spanning trees, Unnamed Item, Combinatorics of the double-dimer model, A matrix model for plane partitions, Planar Maximum Matching: Towards a Parallel Algorithm, The geometry of dimer models, Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, Circulant L-ensembles in the thermodynamic limit, 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
