Higher chain formula proved by combinatorics
From MaRDI portal
Publication:2380210
zbMath1226.05010MaRDI QIDQ2380210
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233371
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)
Related Items (17)
Renormalising SPDEs in regularity structures ⋮ Generically, Arnold-Liouville systems cannot be bi-Hamiltonian ⋮ Stein's method for functions of multivariate normal random variables ⋮ On the functions generated by the general purpose analog computer ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Analytic regularity and solution approximation for a semilinear elliptic partial differential equation in a polygon ⋮ Interpolation properties of generalized plane waves ⋮ The \(n\)th order implicit differentiation formula for two variables with an application to computing all roots of a transcendental function ⋮ A roadmap for generalized plane waves and their interpolation properties ⋮ A hybrid method and unified analysis of generalized finite differences and Lagrange finite elements ⋮ Convergent meshfree approximation schemes of arbitrary order and smoothness ⋮ Stability of a Planar Front in a Class of Reaction-Diffusion Systems ⋮ Parameterized splitting theorems and bifurcations for potential operators. II: Applications to quasi-linear elliptic equations and systems ⋮ Global analysis of the generalised Helfrich flow of closed curves immersed in ℝⁿ ⋮ ARPIST: provably accurate and stable numerical integration over spherical triangles ⋮ Curiosities and counterexamples in smooth convex optimization ⋮ Beyond gevrey regularity: Superposition and propagation of singularities
This page was built for publication: Higher chain formula proved by combinatorics
