Some Combinatorial Lemmas in Topology
From MaRDI portal
Publication:3845873
DOI10.1147/RD.45.0518zbMATH Open0109.15603DBLPjournals/ibmrd/Kuhn60OpenAlexW2050984357WikidataQ56286474 ScholiaQ56286474MaRDI QIDQ3845873FDOQ3845873
Authors: Harold W. Kuhn
Publication date: 1960
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.45.0518
Cited In (59)
- Efficient P1-FEM for any space dimension in \textsc{Matlab}
- Nonlocal-interaction vortices
- Dimensions of exactly divergence-free finite element spaces in 3D
- Mosco convergence of gradient forms with non-convex interaction potential
- Discrete approximation of nonlocal-gradient energies
- Note on quasi-optimal error estimates for the pressure for shear-thickening fluids
- Stable parameterization of continuous and piecewise-linear functions
- Cubical Sperner lemmas as applications of generalized complementary pivoting
- Flots et tensions dans un graphe
- What is the smallest possible constant in Céa's lemma?
- A search routine for a Sperner simplex
- Geometric integration over irregular domains with application to level-set methods
- The eight-tetrahedra longest-edge partition and Kuhn triangulations
- Discrete advection-diffusion equations on graphs: maximum principle and finite volumes
- Piecewise linear approximations of multivariate functions: A multiresolution-based compression algorithm suitable for circuit implementation
- Homotopies for computation of fixed points
- Understanding PPA-completeness
- Zwei kombinatorisch-geometrische Sätze vom Typus Sperner-Tucker-Ky Fan
- Optimistic MILP modeling of non-linear optimization problems
- A remark on the invariance of dimension
- Homotopies for computation of fixed points on unbounded regions
- On the combinatorial antipodal-point lemmas
- Lattice-based high-dimensional Gaussian filtering and the permutohedral lattice
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Digital architectures realizing piecewise-linear multivariate functions: two FPGA implementations
- Hybridization methods for the analysis of nonlinear systems
- An improvement of fixed point algorithms by using a good triangulation
- Red-green refinement of simplicial meshes in \(d\) dimensions
- Construction and shape optimization of simplicial meshes in \(d\)-dimensional space
- Delaunay simplices in diagonally distorted lattices
- Envy-free division of multi-layered cakes
- A simplicial algorithm for the nonlinear complementarity problem
- Kombinatorik bewerteter Komplexe
- Adaptive approximation by multivariate smooth splines
- Topologic proofs of some combinatorial theorems
- On discrete maximum principles for nonlinear elliptic problems
- The topological correctness of PL approximations of isomanifolds
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
- Sandwich method for finding fixed points
- Force-stepping integrators in Lagrangian mechanics
- On triangulations for computing fixed points
- A unified approach to complementarity in optimization
- An Odd Theorem
- Local Bisection for Conformal Refinement of Unstructured 4D Simplicial Meshes
- A new subdivision for computing fixed points with a homotopy algorithm
- Simplicial isosurfacing in arbitrary dimension and codimension
- On triangulations for computing fixed points
- Tetrahedral grid refinement
- The HOL Light theory of Euclidean space
- Robust second-order accurate discretizations of the multi-dimensional Heaviside and Dirac delta functions
- Almost envy-free allocations with connected bundles
- A decomposition algorithm for \(N\)-player games
- Piecewise-linear modelling and simulation of nonlinear networks
- A Note on Piecewise Linear and Multilinear Table Interpolation in Many Dimensions
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
- Almost envy-free allocations with connected bundles
- Approximation by linear combinations of multivariate B-splines
- Covering and packing with spheres by diagonal distortion in \(\mathbb R^n\)
- Probability density function estimation with the frequency polygon transform
This page was built for publication: Some Combinatorial Lemmas in Topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3845873)