Related papers: Determinantal Conditions for Modules of Generalize…

Determinantal point process have recently been used as models in machine learning and this has raised questions regarding the characterizations of conditional independence. In this paper we investigate characterizations of conditional…

The polarization dependences of the G, D, and 2D (G$'$) bands in Raman spectra at graphene bulk and edge are examined theoretically. The 2D and D bands have different selection rules at bulk and edge. At bulk, the 2D band intensity is…

A dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G) \setminus D$ is adjacent to at least one vertex in $D$. A set $L\subseteq V(G)$ is a locating set of $G$ if every vertex in $V(G) \setminus L$ has…

We study the moduli space $\mathcal{AS}_{g}$ of Artin-Schreier curves of genus $g$ over an algebraically closed field $k$ of positive characteristic $p$. The moduli space is partitioned by irreducible strata, where each stratum…

Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor\frac{n}{2}\rfloor$. However, for several families of graphs, we have $\gamma(G) \le…

Let $R$ be a commutative ring with nonzero identity and $I$ a proper ideal of $R$. The {\it ideal-based zero-divisor graph} of $R$ with respect to the ideal $I$, denoted by $\Gamma_I(R)$, is the graph on vertices $\{x \in R\setminus I \mid…

Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…

We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and…

We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…

A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class--a…

Let $\delta$ and $\Delta$ be the minimum and the maximum degree of the vertices of a simple connected graph $G$, respectively. The distinguishing index of a graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of…

There are characteristic classes that are the obstructions to the vanishing of the differentials in the Lyndon-Hochischild-Serre spectral sequence of an extension of an integral lattice L by a group G. These characteristic classes exist in…

A proper edge $t$-coloring of a graph $G$ is a coloring of edges of $G$ with colors $1,2,...,t$ such that each of $t$ colors is used, and adjacent edges are colored differently. The set of colors of edges incident with a vertex $x$ of $G$…

The regular graph of ideals of the commutative ring $R$, denoted by $\Gamma_{reg}(R)$, is a graph whose vertex set is the set of all non-trivial ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if either $I$…

Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely…

The sum-essential graph $ \mathcal{S}_R(M) $ of a left $R$-module $M$ is a graph whose vertices are all nontrivial submodules of $M$ and two distinct submodules are adjacent iff their sum is an essential submodule of $M$. Properties of the…

The generalized Verlinde formulae expressing traces of mapping classes corresponding to automorphisms of certain Riemann surfaces, and the congruence relations on allowed modular representations following from them are presented. The…

A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u)…

A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\rm…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…