scientific article; zbMATH DE number 3047763
From MaRDI portal
Publication:5786986
zbMath0030.40903MaRDI QIDQ5786986
Publication date: 1948
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, Planar and Toroidal Morphs Made Easier, New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs, Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere, The Grassmann-Berezin calculus and theorems of the matrix-tree type, Realistic enzymology for post-translational modification: zero-order ultrasensitivity revisited, The rational parameterisation theorem for multisite post-translational modification systems, Obtaining the long-term behavior of master equations with finite state space from the structure of the associated state transition network, Universal Tutte polynomial, GKSL generators and digraphs: computing invariant states, Exact computation of heat capacities for active particles on a graph, Shifted de Bruijn Graphs, Node balanced steady states: unifying and generalizing complex and detailed balanced steady states, Planar and toroidal morphs made easier, Tilings of convex polygons, Balanced vertex weightings and arborescences, Bideterminants, arborescences and extension of the matrix-tree theorem to semirings, Orthogonal trades in complete sets of MOLS, Critical parameters for singular perturbation reductions of chemical reaction networks, Generalized bicycles, Tiling the Plane with Different Hexagons and Triangles, An enumeration of equilateral triangle dissections, A program for computing identity-kernels from certain directed graphs, Multistationarity in structured reaction networks, Laplacian dynamics with synthesis and degradation, Variable elimination in post-translational modification reaction networks with mass-action kinetics, A new decomposition of the graph Laplacian and the binomial structure of mass-action systems, Hopf algebras and Tutte polynomials, Tiling by incongruent equilateral triangles without requiring local finiteness, Generating functions and counting formulas for spanning trees and forests in hypergraphs, Chemical reaction network approaches to biochemical systems theory, Tiling of rectangles with squares and related problems via Diophantine approximation, Oriented spanning trees and stationary distribution of digraphs, Uniform Approximation of Solutions by Elimination of Intermediate Species in Deterministic Reaction Networks, Sufficient Conditions for Linear Stability of Complex-Balanced Equilibria in Generalized Mass-Action Systems, Bernoulli Factories for Flow-Based Polytopes, Commute times for a directed graph using an asymmetric Laplacian, Combinatorial Bernoulli factories, The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods, Distances of group tables and Latin squares via equilateral triangle dissections, A version of Tutte's polynomial for hypergraphs, The Alexander polynomial of planar even valence graphs, Laplacian dynamics on general graphs, On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class, A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem., An Elementary Proof of a Matrix Tree Theorem for Directed Graphs, Binary functions, degeneracy, and alternating dimaps, The symbiotic relationship of combinatorics and matrix theory, Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials, Graphical criteria for positive solutions to linear systems, Counting trees with random walks, The interlace polynomial of a graph, Unnamed Item, Line-digraphs, arborescences and theorems of Tutte and Knuth, Coding multitype forests: Application to the law of the total population of branching forests, Higher matrix-tree theorems and Bernardi polynomial, Tilings of convex sets by mutually incongruent equilateral triangles contain arbitrarily small tiles, Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths, Matrix tree theorems, Tilings of convex polygons by equilateral triangles of many different sizes, The \(Z\)-Dirac and massive Laplacian operators in the \(Z\)-invariant Ising model, Exact distribution of word counts in shuffled sequences, Transportation networks: Old and new, Pfaffian pairs and parities: counting on linear matroid intersection and parity problems, Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors, On existence of compound perfect squared squares of small order, Leaky Electricity: 1-Chain Formulas for the Current and Voltage, Bicubic planar maps, A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces, A generalization of the all minors matrix tree theorem to semirings, Miscellaneous Digraph Classes, A Proof of Tuite’s Trinity Theorem and a New Determinant Formula, Lower bounds for positive roots and regions of multistationarity in chemical reaction networks, Euler circuits and DNA sequencing by hybridization, Classical results for alternating virtual links, Alexander polynomial and spanning trees, On the dissection of rectangles into right-angled isosceles triangles, Some properties of a multidigraph by semi-incidence matrices, Forest matrices around the Laplacian matrix, A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean, Matrix-tree theorem of digraphs via signless Laplacians, Some determinant expansions and the matrix-tree theorem, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, A Combinatorial Proof of the All Minors Matrix Tree Theorem
