On approximation of asymmetric separators of the \(n\)-cube

DOI10.1186/1687-1812-2012-2zbMath1273.54045OpenAlexW2107747167WikidataQ59292484 ScholiaQ59292484MaRDI QIDQ361217

Marian Turzański, Jan P. Boroński

Publication date: 28 August 2013

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2012-2

zbMATH Keywords

algorithmfixed pointconnected separators

Mathematics Subject Classification ID

Unicoherence, multicoherence (54F55) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20) Software, source code, etc. for problems pertaining to general topology (54-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial analog of a theorem of F.J. Dyson
• The computation of fixed points and applications
• Algorithms for finding connected separators between antipodal points
• An \(n\)-dimensional version of Steinhaus' chessboard theorem
• Non-cooperative games
• The Game of Hex and the Brouwer Fixed-Point Theorem
• A characterization of unicoherence in terms of separating open sets
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping
• Incidence Relations in Unicoherent Spaces

This page was built for publication: On approximation of asymmetric separators of the \(n\)-cube