English
Related papers

Related papers: The Homomorphism Submodule Graph

200 papers

Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for…

Commutative Algebra · Mathematics 2020-08-13 Takayuki Hibi , Hiroju Kanno , Kyouko Kimura , Kazunori Matsuda , Adam Van Tuyl

Suppose a compact torus $T$ acts on a closed smooth manifold $M$. Under certain conditions, Guillemin and Zara associate to $(M, T)$ a labeled graph $\mG_M$ where the labels lie in $H^2(BT)$. They also define the subring $H_T^*(\mG_M)$ of…

Algebraic Topology · Mathematics 2012-07-24 Yukiko Fukukawa

Let $\xx= x_1,\ldots,x_r$ denote a system of elements of a commutative ring $R$. For an $R$-module $M$ we investigate when $\xx$ is $M$-pro-regular resp. $M$-weakly pro-regular as generalizations of $M$-regular sequences. This is done in…

Commutative Algebra · Mathematics 2024-04-23 Peter Schenzel

An eigenvalue of the adjacency matrix of a graph is said to be \emph{main} if the all-1 vector is not orthogonal to the associated eigenspace. In this work, we approach the main eigenvalues of some graphs. The graphs with exactly two main…

Combinatorics · Mathematics 2026-02-17 Nair Abreu , Domingos M. Cardoso , Francisca A. M. França , Cybele T. M. Vinagre

We study how the partial group (co)homology of a group $G$ with coefficient in a partial representation $M$ can be described using the usual group (co)homology. To address this, we introduce the concept of the \textit{universal…

Algebraic Topology · Mathematics 2025-10-16 Emmanuel Jerez

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

Combinatorics · Mathematics 2017-03-02 Jakub Przybyło

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Group Theory · Mathematics 2017-06-19 Teng Fang , Xin Gui Fang , Binzhou Xia , Sanming Zhou

Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…

Dynamical Systems · Mathematics 2022-02-01 Xuan Kien Phung

Modular graph forms are a class of modular covariant functions which appear in the genus-one contribution to the low-energy expansion of closed string scattering amplitudes. Modular graph forms with holomorphic subgraphs enjoy the…

High Energy Physics - Theory · Physics 2019-02-20 Jan E. Gerken , Justin Kaidi

The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…

Combinatorics · Mathematics 2017-08-01 Takahiro Matsushita

We give a geometric perspective on the algebra of Drinfeld modular forms for congruence subgroups $\Gamma\leq \GL_2(\bbF_q[T]).$ In particular, we describe an isomorphism between the section ring of a line bundle on the stacky modular curve…

Number Theory · Mathematics 2024-10-15 Jesse Franklin

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…

Combinatorics · Mathematics 2026-01-27 Daniel Neuen , Tim Seppelt

For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks…

Computational Complexity · Computer Science 2020-02-20 Karolina Okrasa , Paweł Rzążewski

The modern theory of homogeneous structures begins with the work of Roland Fra\"iss\'e. The theory developed in the last seventy years is placed in the border area between combinatorics, model theory, algebra, and analysis. We turn our…

Combinatorics · Mathematics 2026-01-13 Bojana Pavlica , Christian Pech , Maja Pech

We show that if $G$ is an infinitesimal elementary supergroup scheme of height $\leq r$, then the cohomological spectrum $|G|$ of $G$ is naturally homeomorphic to the variety $\mathcal{N}_r(G)$ of supergroup homomorphisms $\rho:…

Representation Theory · Mathematics 2019-03-01 Christopher M. Drupieski , Jonathan R. Kujawa

Let $R$ be a commutative Noetherian ring, $\fa$ an ideal of $R$ and $\mathcal{D}(R)$ denote the derived category of $R$-modules. We investigate the theory of local homology in conjunction with Gorenstein flat modules. Let $X$ be a…

Commutative Algebra · Mathematics 2012-01-17 Fatemeh Mohammadi Aghjeh Mashhad , Kamran Divaani-Aazar

An $H$-graph is an intersection graph of connected subgraphs of a suitable subdivision of a fixed graph $H$. Many important classes of graphs, including interval graphs, circular-arc graphs, and chordal graphs, can be expressed as…

Data Structures and Algorithms · Computer Science 2022-06-28 Deniz Ağaoğlu Çağırıcı , Peter Zeman

A module $M$ is called an automorphism-invariant module if every isomorphism between two essential submodules of $M$ extends to an automorphism of $M$. This paper introduces the notion of dual of such modules. We call a module $M$ to be a…

Rings and Algebras · Mathematics 2012-08-27 S. Singh , Ashish K. Srivastava

Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…

Combinatorics · Mathematics 2023-01-25 Blas Fernández

Given a graph $\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\H{o}s-R\'{e}nyi graph process with host $\Gamma$ as follows. A permutation $e_1,\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\leq m$ we let…

Combinatorics · Mathematics 2018-11-09 Tony Johansson