Related papers: Combinatorial differential geometry and ideal Bian…
This paper is a continuation of arXiv:0809.1158, dealing with a general, not-necessarily torsion-free, connection. It characterizes all possible systems of generators for vector-field valued operators that depend naturally on a set of…
We give a global geometric decomposition of continuously differentiable vector fields on $\mathbb{R}^n$. More precisely, given a vector field of class $\mathcal{C}^{1}$ on $\mathbb{R}^{n}$, and a geometric structure on $\mathbb{R}^n$, we…
In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain…
Direct integration technique is used to study the proper conformal vector fields in non conformally flat Bianchi type-1 space-times. Using the above mentioned technique we have shown that a very special class of the above space-time admits…
The paper studies the complex 1-dimensional polynomial vector fields with real coefficients under topological orbital equivalence preserving the separatrices of the pole at infinity. The number of generic strata is determined, and a…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…
We give an elegant formulation of the structure equations (of Cartan) and the Bianchi identities in terms of exterior calculus without reference to a particular basis and without the exterior covariant derivative. This approach allows both…
The paper studies the generic complex 1-dimensional polynomial vector fields of the form $iP(z)\frac{\partial}{\partial z}$, where $P$ is a polynomial with real coefficients, under topological orbital equivalence preserving the separatrices…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
The powerful concept of an operator ideal on the class of all Banach spaces makes sense in the real and in the complex case. In both settings we may, for example, consider compact, nuclear, or $2$--summing operators, where the definitions…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
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…
Motivated by the supersymmetric version of Dirac's theory, chiral models in field theory, and the quest of a geometric fundament for the Standard Model, we describe an approach to the differential geometry of vector bundles on…
The graph alignment problem explores the concept of node correspondence and its optimality. In this paper, we focus on purely geometric graph alignment methods, namely our newly proposed Ricci Matrix Comparison (RMC) and its original form,…
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 (in the limit) topological spaces. If a pattern of the…
The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads…