Related papers: A combinatorial description of topological complex…
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,…
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…
Given a simplicial complex $X$, we construct a simplicial complex $\Omega X$ that may be regarded as a combinatorial version of the based loop space of a topological space. Our construction explicitly describes the simplices of $\Omega X$…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…
A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
We introduce and analyze a new geometric structure on topological surfaces generalizing the complex structure. To define this so called higher complex structure we use the punctual Hilbert scheme of the plane. The moduli space of higher…
We study the first step of the weight filtration on the cohomology of a proper complex algebraic variety, which we call the combinatorial part. We obtain a natural upper bound on its size, which gives rather strong information about the…
This is a complete classification of the complex forms of quaternionic symmetric spaces
Let $p$ be a branched covering of a Riemann surface to the Riemann sphere $\mathbb{P}^1$, with branching set $B \subset \mathbb{P}^1$. We define the complexity of $p$ as infinity, if $\mathbb{P}^1 \setminus B$ does not admit a hyperbolic…
In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.
We discuss a classical complexity of finite-dimensional unitary transformations, which can been seen as a computable approximation of classical descriptional complexity of a unitary transformation acting on a set of qubits.
Our main problem is to find finite topological spaces to within homeomorphism, given (also to within homeomorphism) the quotient-spaces obtained by identifying one point of the space with each one of the other points. In a previous version…
The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We define a relative version of tiling cohomology for the purpose of comparing the topology of tiling spaces when one is a factor of the other. We illustrate this with examples, and outline a method for computing the cohomology of tiling…