Topics
semigroupBuilding
discrete groupChemical compound
Abstract: This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth manifolds are deduced. When the sequences of polyhedra are obtained by the action of a discrete group or semigroup, further control is given by geometric, topologic and complexity observables. We give a set of relevant examples to illustrate the results, both in infinite and finite dimensions.
29 pages.We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewh...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
AbstractIn this paper we study the rate of the best approximation of a given function by semialgebra...
Abstract. Simplicial complexes consist of a set of vertices together with des-ignated subsets. They ...
AbstractUsing ideas from shape theory we embed the coarse category of metric spaces into the categor...
We describe an algorithm that takes as an input a CW complex and returns a simplicial complex of the...
Many questions from a variety of areas of mathematics lead one to the problem of analyzing the topol...
Given a metric space X and an element α ∈ πn(X), how does the minimal geometric complexity of a repr...
Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M...
Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M...
29 pages.We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewh...
AbstractWe consider particular types of discrete approximations to tensor fields on manifolds sugges...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
AbstractWe consider particular types of discrete approximations to tensor fields on manifolds sugges...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
29 pages.We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewh...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
AbstractIn this paper we study the rate of the best approximation of a given function by semialgebra...
Abstract. Simplicial complexes consist of a set of vertices together with des-ignated subsets. They ...
AbstractUsing ideas from shape theory we embed the coarse category of metric spaces into the categor...
We describe an algorithm that takes as an input a CW complex and returns a simplicial complex of the...
Many questions from a variety of areas of mathematics lead one to the problem of analyzing the topol...
Given a metric space X and an element α ∈ πn(X), how does the minimal geometric complexity of a repr...
Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M...
Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M...
29 pages.We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewh...
AbstractWe consider particular types of discrete approximations to tensor fields on manifolds sugges...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
AbstractWe consider particular types of discrete approximations to tensor fields on manifolds sugges...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
29 pages.We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewh...
We suggest an approach based on geometric invariant theory to the fundamental lower bound problems i...
AbstractIn this paper we study the rate of the best approximation of a given function by semialgebra...
Add to ORKG