Related papers: Monomization of Power Ideals and Parking Functions
There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals…
We show that there exists a simple generalization of Kazakov's multicritical one-matrix model, which interpolates between the various multicritical points of the model. The associated multicritical potential takes the form of a power series…
The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…
The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
Let $I$ be a homogeneous ideal in a polynomial ring over a field. Let $I^{(n)}$ be the $n$-th symbolic power of $I$. Motivated by results about ordinary powers of $I$, we study the asymptotic behavior of the regularity function $\text{reg}~…
In this article, we investigate when the ordinary and symbolic powers of the Alexander dual of connected ideals of graphs coincide, and provide a complete classification of all such graphs. Furthermore, we prove Conforti--Cornu\`ejols…
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
In this paper, we study the componentwise linearity of powers of edge ideal of a weighted oriented graph $D$. We give a characterization for componentwise linearity of the edge ideal $I(D)$ in terms of forbidden subgraphs of $D$. If $D$ is…
The article studies power complexes and generalized power complexes, and investigates the algebraic structure of their automorphism groups. The combinatorial incidence structures involved are cube-like, in the sense that they have many…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
The two graphs of the title both have vertex set G. In the intersection power graph, x and y are joined if some non-identity element is a power of both; in the power graph, x and y joined if one is a power of the other. Thus the power graph…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
Graph energy and Domination in graphs are most studied areas of graph theory. In this paper we made an attempt to connect these two areas of graph theory by introducing c-dominating energy of a graph $G$. First, we show the chemical…
Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…
The symbolic powers, in general, are not equal to the ordinary powers. Therefore, one interesting question here is for what classes of ideals ordinary and symbolic powers coincide? The answer to this question for squarefree monomial ideals…
Recent work of Ein-Lazarsfeld-Smith and Hochster-Huneke raised the problem of which symbolic powers of an ideal are contained in a given ordinary power of the ideal. Bocci-Harbourne developed methods to address this problem, which involve…
Let $S=K[x_1,\ldots,x_n]$ and let $I$ be the $t$-path ideal of the line graph $L_n$ with $n$-vertices. It is shown that the set of associated prime ideals of $I^s$ is equal to the set of minimal prime ideals of $I$ for all $s\geq 1$, and we…
Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation.…