Related papers: Quadratic Generated Normal Domains From Graphs

For any graph, one can construct a ring, called the edge ring, which is a quadratic-monomial generated subring of the Laurent polynomial ring $k[x_1^{\pm 1},\dots,x_n^{\pm 1}]$. In fact, every quadratic-monomial generated subring of this…

Let A be a finitely generated commutative algebra over a field K with a presentation A=K < X_{1}, ..., X_{n} | R >, where R is a set of monomial relations in the generators X_{1}, ..., X_{n}. So A = K[S], the semigroup algebra of the monoid…

Given an arbitrary graph G, we study its basic covers algebra, which is the symbolic fiber cone of the Alexander dual of the edge ideal of G. Extending results of Villarreal and Benedetti-Constantinescu-Varbaro, valid only in the case when…

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…

Analyzing nodal domains is a way to discern the structure of eigenvectors of operators on a graph. We give a new definition extending the concept of nodal domains to arbitrary signed graphs, and therefore to arbitrary symmetric matrices. We…

Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…

In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

For a graded domain $R=k[X_0,...,X_m]/J$ over an arbitrary domain $k$, it is shown that the ideal generated by elements of degree $\geq mA$, where $A$ is the least common multiple of the weights of the $X_i$, is a normal ideal.

Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we…

Given a causal graph representing the data-generating process shared across different domains/distributions, enforcing sufficient graph-implied conditional independencies can identify domain-general (non-spurious) feature representations.…

We prove the existence and uniqueness of radial graphs over a given domain of $\mathbb{S}^{n}$ having boundary on the sphere $\mathbb{S}^{n}$ and whose mean curvature at every point equals a prescribed positive function satisfying suitable…

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…

Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…

Let $\Delta$ be a 1-dimensional simplicial complex. Then $\Delta$ may be identified with a finite simple graph $G$. In this article, we investigate the toric ring $R_G$ of $G$. All graphs $G$ such that $R_G$ is a normal domain are…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…