AI Chat AI Image Generator AI Video Text to Speech

Combinatorial constructions of intrinsic geometries

04/10/2019

∙

by Stanislaw Ambroszkiewicz, et al.

∙

∙

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine topological spaces. If a pattern of the construction is sufficiently regular and uniform, then the notions of geodesic and curvature can be defined in the space as the limits of their finite versions in the graphs. This gives rise to consider the graphs as finite approximations of the geometry of the space.

research

∙ 04/10/2019

Asymptotic combinatorial constructions of Geometries

An approach to asymptotic finite approximations of geometrical spaces is...

0 Stanislaw Ambroszkiewicz, et al. ∙

research

∙ 01/25/2019

Average sampling and average splines on combinatorial graphs

In the setting of a weighted combinatorial finite or infinite countable ...

0 Isaac Z. Pesenson, et al. ∙

research

∙ 09/19/2017

On the commutativity of the powerspace constructions

We investigate powerspace constructions on topological spaces, with a pa...

0 Matthew de Brecht, et al. ∙

research

∙ 10/29/2021

Construction of APN permutations via Walsh zero spaces

A Walsh zero space (WZ space) for f:F_2^n→ F_2^n is an n-dimensional vec...

0 Benjamin Chase, et al. ∙

research

∙ 07/19/2019

Override and update

Override and update are natural constructions for combining partial func...

0 Marel Jackson, et al. ∙

research

∙ 03/30/2020

On the Weisfeiler-Leman Dimension of Finite Groups

In comparison to graphs, combinatorial methods for the isomorphism probl...

0 Jendrik Brachter, et al. ∙

research

∙ 05/14/2021

Constructions of betweenness-uniform graphs from trees

Betweenness centrality is a measure of the importance of a vertex x insi...

0 David Hartman, et al. ∙