Related papers: Discrete Differential Calculus on Simplicial Compl…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
A weighted simplicial complex is a simplicial complex with values (called weights) on the vertices. In this paper, we consider weighted simplicial complexes with $\mathbb{R}^2$-valued weights. We study the weighted homology and the weighted…
We find an interpretation of the complex of variational calculus in terms of the Lie conformal algebra cohomology theory. This leads to a better understanding of both theories. In particular, we give an explicit construction of the Lie…
Weighted hypergraphs are generalizations of weighted simplicial complexes. In recent years, weighted Laplacians of weighted simplicial complexes have been studied. In 2016, as a generalization of the homology of simplicial complexes, the…
This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…
We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.
The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…
For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the…
We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…
We discuss the construction of finite noncommutative geometries on Hopf algebras and finite groups in the `quantum groups approach'. We apply the author's previous classification theorem, implying that calculi in the factorisable case…
Derived differential manifolds are constructed using the usual homotopy theory of simplicial rings of smooth functions. They are proved to be equivalent to derived differential manifolds of finite type, constructed using homotopy sheaves of…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
In a series of publications we developed "differential geometry" on discrete sets based on concepts of noncommutative geometry. In particular, it turned out that first order differential calculi (over the algebra of functions) on a discrete…
Let $\mathcal{K}$ be a finite pure simplicial $d$-complex, with oriented facets $\{F_i\}$, which is boundaryless in the sense that $\sum\partial F_i=0$. We call such a $\mathcal{K}$ an \textit{admissible $d$-complex}. Given an admissible…
We have established a coherent framework for applying variational methods to partial differential equations on hypergraphs, which includes the propositions of calculus and function spaces on hypergraphs. Several results related to the…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
We provide a recursive construction of an acyclic matching (also known as a gradient vector field, an equivalent notion to a discrete Morse function) on the independence complex of a graph with a simplicial vertex using given acyclic…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
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 conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…