Related papers: Determinantal Conditions for Modules of Generalize…
Suppose $R$ is a $\mathbb{Q}$-Gorenstein $F$-finite and $F$-pure ring of prime characteristic $p>0$. We show that if $I\subseteq R$ is a compatible ideal (with all $p^{-e}$-linear maps) then there exists a module finite extension $R\to S$…
Given a graph $G$, we have the adjacency matrix $A(G)$ and degree diagonal matrix $D(G)$. The $Q$-spectrum is the all eigenvalues of $Q$-matrix $Q(G)=A(G)+D(G)$. A class of graphs is determined by their generalized $Q$-spectrum (DGQS for…
A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undirected graph G is a mapping $\lambda$ from the set of vertices (resp. the set of edges) of G to the set of labels {1,. .. , r} such that no non-trivial automorphism of G…
A subset $S$ of vertices in a planar graph $G$ is a free set if, for every set $P$ of $|S|$ points in the plane, there exists a straight-line crossing-free drawing of $G$ in which vertices of $S$ are mapped to distinct points in $P$. In…
Let $G$ be a group with identity $e$ and $R$ a commutative $G$-graded ring with a nonzero unity $1$. In this article, we introduce the concepts of graded $r$-submodules and graded special $r$-submodules, which are generalizations for the…
A graph neural network transforms features in each vertex's neighborhood into a vector representation of the vertex. Afterward, each vertex's representation is used independently for predicting its label. This standard pipeline implicitly…
A graphical model is an undirected network representing the conditional independence properties between random variables. Graphical modeling has become part and parcel of systems or network approaches to multivariate data, in particular…
A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex in $V(G) \setminus S$ is adjacent to a vertex in $S$. A restrained dominating set of $G$ is a dominating set $S$ with the additional restraint that the graph $G…
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
A labelling of a graph is an assignment of labels to its vertex or edge sets (or both), subject to certain conditions, a well established concept. A labelling of a graph G of order n is termed a numbering when the set of integers {1,...,n}…
A cohomological criterion for the complete reducibility of modules of finite length satisfying a composability condition for a meromorphic open-string vertex algebra $V$ has been given by Qi and the author. In order to apply this criterion,…
Linear structural equation models relate the components of a random vector using linear interdependencies and Gaussian noise. Each such model can be naturally associated with a mixed graph whose vertices correspond to the components of the…
We will prove that if $G$ and $H$ are modules over a principal ideal domain $R$ such that the endomorphism rings $\mathrm{End}_R(R\oplus G)$ and $\mathrm{End}_R(R\oplus H)$ are isomorphic then $G\cong H$. Conversely, if $R$ is a Dedekind…
The essential annihilating-ideal graph $\mathcal{EG}(R)$ of a commutative unital ring $R$ is a simple graph whose vertices are non-zero ideals of $R$ with non-zero annihilator and there exists an edge between two distinct vertices $I,J$ if…
Let $X$ be any smooth simply connected projective surface. We consider some moduli space of pure sheaves of dimension one on $X$, i.e. $\mhu$ with $u=(0,L,\chi(u)=0)$ and $L$ an effective line bundle on $X$, together with a series of…
Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we completely determine the tuples $(\dim R/I(G), \depth (R/I(G)), \reg (R/I(G)))$ when the number of vertices is fixed for any graphs $G$.
For a graph class $\mathcal{G}$, we define the $\mathcal{G}$-modular cardinality of a graph $G$ as the minimum size of a vertex partition of $G$ into modules that each induces a graph in $\mathcal{G}$. This generalizes other module-based…
A piecewise smooth domain is said to have generic corners if the corners are generic CR manifolds. It is shown that a biholomorphic mapping from a piecewise smooth pseudoconvex domain with generic corners in complex Euclidean space that…
Given a vector bundle $E$ of rank $r$ and degree $d$ on a curve $C$ of genus $g$, one can associate to $E$ in a natural way several other vector bundles. For example, one can take wedge powers of $E$. If $E$ is generated by global sections,…
We show that if a planar graph $G$ has a plane straight-line drawing in which a subset $S$ of its vertices are collinear, then for any set of points, $X$, in the plane with $|X|=|S|$, there is a plane straight-line drawing of $G$ in which…