Related papers: Discrete Algebraic sets in Discrete Manifolds
Many applications of geometry modeling and computer graphics necessite accurate curvature estimations of curves on the plane or on manifolds. In this paper, we define the notion of the discrete geodesic curvature of a geodesic polygon on a…
A graph $G$ is $(k,k')$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and assigns to each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a total…
A singular point of a smooth map F: M -> N of manifolds is a point in M at which the rank of the differential dF is less than the minimum of dimensions of M and N. The classical invariant of the set S of singular points of F of a given type…
Following the previous authors works (joint with I.A.Dynnikov) we develop a theory of the discrete analogs of the differential-geometrical (DG) connections in the triangulated manifolds. We study a nonstandard discretization based on the…
The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…
We consider the curve graph in the cases where it is not a Farey graph, and show that its Gromov boundary is linearly connected. For a fixed center point c and radius r, we define the sphere of radius r to be the induced subgraph on the set…
Let $R$ be a finite-dimensional algebra over an algebraically closed field $F$ graded by an arbitrary group $G$. We prove that $R$ is a graded division algebra if and only if it is isomorphic to a twisted group algebra of some finite…
In this paper, we consider a class of Morse-Smale diffeomorphisms defined on a closed 3-manifold (non-necessarily orientable) under the assumption that all their saddle points have the same dimension of the unstable manifolds. The simplest…
Any smooth, closed oriented 4-manifold has a surface diagram of arbitrarily high genus g>2 that specifies it up to diffeomorphism. The goal of this paper is to prove the following statement: For any smooth, closed oriented 4-manifold M,…
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…
We present new explicit decompositions of manifolds via so-called fold maps into lower dimensional spaces. Fold maps form a nice class of so-called generic maps, generalizing Morse functions naturally. To understand the topologies and the…
In a previous paper we outlined how discrete torsion can be understood geometrically as an analogue of orbifold U(1) Wilson lines. In this paper we shall prove the remaining details. More precisely, in this paper we describe gerbes in terms…
It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…
The degree set of a finite simple graph $G$ is the set of distinct degrees of vertices of $G$. A theorem of Kapoor, Polimeni & Wall asserts that the least order of a graph with a given degree set $\mathscr D$ is $1+\max \mathscr D$.…
In this article, we introduce the notion of a wedge of graphs and provide detailed computations for the independence complex of a wedge of path and cycle graphs. In particular, we show that these complexes are either contractible or wedges…
The independence polynomial of a graph $G$ evaluated at $-1$, denoted here as $I(G;-1)$, has arisen in a variety of different areas of mathematics and theoretical physics as an object of interest. Engstr\"om used discrete Morse theory to…
The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
Motivated by recent interest in the spectrum of the Laplacian of incomplete surfaces with isolated conical singularities, we consider more general incomplete m-dimensional manifolds with singularities on sets of codimension at least 2. With…