| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
09 February 2025 |
|
| | | |
|
Article overview
| |
|
Quadratic Generated Normal Domains From Graphs | Drew J. Lipman
; Michael A. Burr
; | Date: |
1 Sep 2016 | Abstract: | Determining whether an arbitrary subring $R$ of $k[x_1^{pm 1},ldots,
x_n^{pm 1}]$ is a normal domain is, in general, a nontrivial problem, even in
the special case of a monomial generated domain. In this paper, we consider the
case where $R$ is a quadratic-monomial generated domain. For the ring $R$, we
consider the combinatorial structure that assigns an edge in a mixed directed
signed graph to each monomial of the ring. In this paper we use this
relationship to provide a combinatorial characterization of the normality of
$R$, and, when $R$ is not normal, we use the combinatorial characterization to
compute the normalization of $R$. | Source: | arXiv, 1609.0089 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|