نتایج جستجو برای: annihilator graph
تعداد نتایج: 198304 فیلتر نتایج به سال:
We describe the two-sided ideals in the universal enveloping algebras of the Lie algebras of vector fields on the line and the circle which annihilate the tensor density modules. Both of these Lie algebras contain the projective subalgebra, a copy of sl2. The restrictions of the tensor density modules to this subalgebra are duals of Verma modules (of sl2) for Vec(R) and principal series modules...
We study the representation theory of braids and ties algebra, or bt -algebra, E n ( q ) . Using cellular basis { m s t } for obtained in previous joint work with J. Espinoza we introduce two kinds permutation modules M λ Λ show that tensor product module V ⊗ is a direct sum 's. dual its action on annihilator ideal I enjoys nice compatibility property respect to finally quotient algebra / , sho...
The sl3 colored Jones polynomial of the trefoil knot is a q-holonomic sequence of two variables with natural origin, namely quantum topology. The paper presents an explicit set of generators for the annihilator ideal of this q-holonomic sequence as a case study. On the one hand, our results are new and useful to quantum topology: this is the first example of a rank 2 Lie algebra computation con...
The Orlik-Solomon algebra A of a matroid is isomorphic to the quotient of an exterior algebra E by a defining ideal I . We find an explicit presentation of the annihilator ideal of I or, equivalently, the E-module dual to A. As an application of that we provide a necessary, combinatorial condition for the algebra A to be quadratic. We show that this is stronger than matroid being line-closed th...
let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and $e_{n,m}$ be the graph obtained from a path $p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of $k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$, and by joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$ to $v_{d_{n,m}-2}$. zhang, liu and zhou [on the maximal eccentric connectivity ind...
the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this graph. also we give a relation between the order graph and prime graph of a group.
let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...
in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.
Let f be a real-valued real analytic function in several variables. Then we associate with each algebraic local cohomology class u with support in f = 0 a distribution (generalized function) ρ(u) in terms of the residue of fλ + with respect to λ at a negative integer. Then ρ constitutes a homomorphism of modules over the sheaf of analtyic functions but not over the sheaf of differential operato...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید