Related papers: Combinatorial constructions of intrinsic geometrie…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We discuss here geometric structures of condensed matters by means of a fundamental topological method. Any geometric pattern can be universally represented by a decomposition space of a topological space consisting of the infinite product…
For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
We illustrate connections between differential geometry on finite simple graphs G=(V,E) and Riemannian manifolds (M,g). The link is that curvature can be defined integral geometrically as an expectation in a probability space of…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized…
We investigate harmonic maps from weighted graphs into metric spaces that locally admit unique centers of gravity, like Alexandrov spaces with upper curvature bounds. We prove an existence result by constructing an iterative geometric…
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…
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…
First we introduce a generalization of symmetric spaces to parabolic geometries. We provide construction of such parabolic geometries starting with classical symmetric spaces and we show that all regular parabolic geometries with smooth…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We give a relationship that yields an effective geometric way of evaluating mean curvature of surfaces. The approach is reminiscent of the Gauss's contour based evaluation of intrinsic curvature. The presented formula may have a number of…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
It is shown that four-dimensional generalized symmetric spaces can be naturally equipped with some additional structures defined by means of their curvature operators. As an application, those structures are used to characterize generalized…