نتایج جستجو برای: annihilating ideal graph
تعداد نتایج: 282855 فیلتر نتایج به سال:
Masur and Smillie, 1993, proved precisely which singularity index lists arise from pseudo-Anosov mapping classes. In search of an analogous theorem for outer automorphisms of free groups, Handel and Mosher, 2011, ask: Is each connected, simplicial, (2r − 1)-vertex graph the ideal Whitehead graph of a fully irreducible φ ∈ Out(Fr)? We answer this question in the negative by exhibiting, for each ...
The Riemann-Roch theorem on a graph G is closely related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When G is a saturated graph, these ideals are generic and the Scarf complex is a minimal free resolution. Otherwise, syzygies are obtained by degeneration...
We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...
Spectral properties of special matrices matrices have been widely applied. We focus on monomial matrices over a finite field Fp, p 6= 2. We describe a way to find the minimal annihilating polynomial, a set of linearly independent eigenvectors.
let $r$ be a commutative ring with zero-divisor set $z(r)$. the total graph of $r$, denoted by$t(gamma(r))$, is the simple (undirected) graph with vertex set $r$ where two distinct vertices areadjacent if their sum lies in $z(r)$.this work considers minimum zero-sum $k$-flows for $t(gamma(r))$.both for $vert rvert$ even and the case when $vert rvert$ is odd and $z(g)$ is an ideal of $r$it is s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید