On approximation of asymmetric separators of the \(n\)-cube (Q361217): Difference between revisions
From MaRDI portal
Latest revision as of 18:59, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On approximation of asymmetric separators of the \(n\)-cube |
scientific article |
Statements
On approximation of asymmetric separators of the \(n\)-cube (English)
0 references
28 August 2013
0 references
A combinatorial result is proved with the following simplified version implying the Brouwer fixed point theorem: Let \(f:V\to \mathbb R\) be a function defined on the set of vertices of a triangulation of the cube \(I^n\). Suppose for any vertices \(v_1\in \{0\}\times I^{n-1}, v_2\in \{1\}\times I^{n-1}\) one has \(f(v_1)f(v_2)\leq 0\). Then there is a subcollection \(S\subseteq T\) of \(n\)-simplices such that 1) for every simplex \(\sigma \in S\) there is an edge \([v,u]\) such that \(f(v)f(u)\leq 0\); 2) the union \(\bigcup S\) separates \(I^n\) between \(\{ 0\}\times I^{n-1}\) and \(\{1\}\times I^{n-1}\). The methods are based on some earlier results of the present authors with P. Minc.
0 references
connected separators
0 references
algorithm
0 references
fixed point
0 references