Related papers: Gauge-string duality, monomial bases and graph det…
Let M be a module over a commutative ring R. In this paper, we continue our study of annihilating-submodule graph AG(M) which was introduced in (The Zariski topology-graph of modules over commutative rings, Comm. Algebra., 42 (2014),…
QDMR is a meaning representation for complex questions, which decomposes questions into a sequence of atomic steps. While state-of-the-art QDMR parsers use the common sequence-to-sequence (seq2seq) approach, a QDMR structure fundamentally…
Fix a base field F, a finite field K and consider a sequence of central simple F-algebras A_1,...,A_n. In this note we provide some results toward a classification of the indecomposable motives lying in the motivic decompositions of…
The classical Rees construction (of common use in commutative algebra and Hodge theory) interpolates between filtrations, viewed as ${\mathbb G}_m$-equivariant vector bundles on the affine line, and their associated gradings. Various…
In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…
Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…
In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…
We develop a systematic framework for realizing general anomaly-free chiral 6D supergravity theories in F-theory. We focus on 6D (1, 0) models with one tensor multiplet whose gauge group is a product of simple factors (modulo a finite…
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…
Spatial noncommutativity is similar and can even be related to the non-Abelian nature of multiple D-branes. But they have so far seemed independent of each other. Reflecting this decoupling, the algebra of matrix valued fields on…
This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…
We give general expressions for singular vectors of the N=2 superconformal algebra in the form of {\it monomials} in the continued operators by which the universal enveloping algebra of N=2 is extended. We then show how the algebraic…
We introduce a presentation of the Chow ring of a matroid by a new set of generators, called "simplicial generators." These generators are analogous to nef divisors on projective toric varieties, and admit a combinatorial interpretation via…
We develop geometric approach to A-infinity algebras and A-infinity categories based on the notion of formal scheme in the category of graded vector spaces. Geometric approach clarifies several questions, e.g. the notion of homological unit…
Motivated by chemical applications, we revisit and extend a family of positive definite kernels for graphs based on the detection of common subtrees, initially proposed by Ramon et al. (2003). We propose new kernels with a parameter to…
The primary purpose is to introduce and explore projective varieties, $\text{GRASS}_{\bf d}(\Lambda)$, parametrizing the full collection of those modules over a finite dimensional algebra $\Lambda$ which have dimension vector $\bf d$. These…
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…
This article introduces PAGE, a parameterized generative interpretive framework. PAGE is capable of providing faithful explanations for any graph neural network without necessitating prior knowledge or internal details. Specifically, we…
Let $G$ be a graph(directed or undirected) having $k$ number of blocks. A $\mathcal{B}$-partition of $G$ is a partition into $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is induced subgraph of…