Related papers: Geometric vs Algebraic Nullity for Hyperpaths
A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
In this note we discuss some arithmetic and geometric questions concerning self maps of projective algebraic varieties.
We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…
We describe a procedure to attach a nilpotent strong homotopy Lie algebra to every simple hypergraph and prove that two hypergraphs are isomorphic if and only if the corresponding strong homotopy Lie algebras are isomorphic. As an…
In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation…
This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…
We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…
We study the algebraic hyperbolicity of certain subvarieties of homogeneous varieties, building on the techniques introduced by Coskun-Riedl, Yeong and Mioranci. This generalizes earlier known results for hypersurfaces to higher…
We consider various $A_{\infty}$-algebras of differential (super)forms, which are related to gauge theories and demonstrate explicitly how certain reformulations of gauge theories lead to the transfer of the corresponding…
Given a graph $G$, one may ask: "What sets of eigenvalues are possible over all weighted adjacency matrices of $G$?" (The weight of an edge is positive or negative, while the diagonal entries can be any real numbers.) This is known as the…
Given a compatible vector field on a compact connected almost-complex manifold, we show in this article that the multiplicities of eigenvalues among the zero point set of this vector field have intimate relations. We highlight a special…
Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…
We obtain eigenvalue equations satisfied by various elliptic modular graphs with five links where two of the vertices are unintegrated. Solving them leads to several non--trivial algebraic identities between these graphs.
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
We give a local parametric description of all holomorphic hypersurfaces in complex Euclidean and projective spaces with constant index of relative nullity, together with applications. This is a complex analogue to the parametrization for…
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…
In this letter we investigate some aspects of the noncommutative differential geometry based on derivations of the algebra of endomorphisms of an oriented complex hermitian vector bundle. We relate it, in a natural way, to the geometry of…
A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…