English
Related papers

Related papers: The Borsuk-Ulam-property, Tucker-property and cons…

200 papers

A combinatorial group-theoretic hypothesis is presented that serves as a necessary and sufficient condition for a union of connected Cockcroft two-complexes to be Cockcroft. This hypothesis has a component that can be expressed in terms of…

Group Theory · Mathematics 2009-09-25 William A. Bogley

We prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives…

Combinatorics · Mathematics 2025-09-10 Florian Frick , Zoe Wellner

This paper establishes a Borsuk-Ulam type theorem for PL-manifolds with a finite group action, depending on the free equivariant cobordism class of a manifold. In particular, necessary and sufficient conditions are considered for a manifold…

Combinatorics · Mathematics 2012-09-19 Oleg R. Musin

A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…

Dynamical Systems · Mathematics 2012-01-18 Chris Bernhardt

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

Computational Complexity · Computer Science 2007-05-23 Luca Trevisan

Relative property (T) has recently been used to construct a variety of new rigidity phenomena, for example in von Neumann algebras and the study of orbit-equivalence relations. However, until recently there were few examples of group pairs…

Group Theory · Mathematics 2007-05-23 Talia Fernos

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…

Probability · Mathematics 2012-07-24 Philip Herriger

We give an intuitive combinatorial proof of Ky Fan's covering lemma based on the Borsuk-Ulam theorem. We then show how this approach can be generalized to Ky Fan's covering lemma for several linear orders.

Combinatorics · Mathematics 2025-07-31 Bogdan Chornomaz

We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…

Algebraic Topology · Mathematics 2008-07-28 Tathagata Basak

Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…

Statistical Mechanics · Physics 2016-08-31 N. Destainville , R. Mosseri , F. bailly

We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…

Machine Learning · Computer Science 2023-11-06 Zachary Chase , Bogdan Chornomaz , Shay Moran , Amir Yehudayoff

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

Mathematical Physics · Physics 2017-11-22 Philippe Di Francesco

We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.

Combinatorics · Mathematics 2012-01-23 Masanori Ando

A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…

Combinatorics · Mathematics 2007-05-23 Rade T. Zivaljevic

This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…

Dynamical Systems · Mathematics 2021-08-04 Russell Lodge , Yauhen Mikulich , Dierk Schleicher

In the article "Construction of the continuous hull for the combinatorics of a regular pentagonal tiling of the plane" we constructed the continuous hull for the combinatorics of "A regular pentagonal tiling of the plane", and in the…

Dynamical Systems · Mathematics 2013-05-07 Maria Ramirez-Solano

The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…

Combinatorics · Mathematics 2014-03-12 Karim Alexander Adiprasito

In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.

Algebraic Topology · Mathematics 2010-12-09 Behrooz Mashayekhy , Hanieh Mirebrahimi

Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…

Geometric Topology · Mathematics 2021-12-30 Christoph Dorn , Christopher L. Douglas

The main goal of this paper is to present the application of structural sums, mathematical objects originating from the computational materials science, in construction of a feature space vector of 2D random composites simulated by…

Computational Engineering, Finance, and Science · Computer Science 2019-06-19 Wojciech Nawalaniec