Search Results/Filters    

Filters

Year

Banks



Expert Group











Full-Text


Conference: 

IRANIAN ALGEBRA SEMINAR

Issue Info: 
  • Year: 

    2016
  • Volume: 

    25
Measures: 
  • Views: 

    135
  • Downloads: 

    61
Abstract: 

IN THIS PAPER WE INTRODUCED THE CONCEPT OF COMPLETE ROOTED GRAPHS AND COMPUTE THE HILBERT SERIES OF THEIR BINOMIAL EDGE IDEAL.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 135

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 61
Issue Info: 
  • Year: 

    2015
  • Volume: 

    2
Measures: 
  • Views: 

    160
  • Downloads: 

    101
Abstract: 

WE STUDY SOME IDEALS ASSOCIATED TO (HYPER) GRAPHS. SPECIAL ATTENTION IS GIVEN TO VARIOUS PROPERTIES AND INVARIANTS ARISING FROM THE MINIMAL FREE RESOLUTION OF SUCH IDEALS.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 160

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 101
Issue Info: 
  • Year: 

    2017
  • Volume: 

    6
  • Issue: 

    3
  • Pages: 

    11-18
Measures: 
  • Citations: 

    0
  • Views: 

    277
  • Downloads: 

    107
Abstract: 

In this paper we introduce the concept of generalized trees and compute the Hilbert series of their BINOMIAL EDGE IDEALs

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 277

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 107 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Writer: 

ALIASGARI MALIHE | RAFSANJANI SADEGHI MOHAMMAD REZA

Issue Info: 
  • Year: 

    2013
  • Volume: 

    44
Measures: 
  • Views: 

    159
  • Downloads: 

    111
Abstract: 

EVERY LATTICE L CAN BE DESCRIBED IN TERMS OF A LABEL CODE L AND AN ORTHOGONAL SUBLATTICE L′, IN OTHER WORDS (FORMULA). LET L BE AN INTEGER LATTICE. CONSIDER IL, I L′ AND IL AS BINOMIAL IDEALS ASSOCIATED WITH L, L′ AND L, RESPECTIVELY. WE ESTABLISH A RELATION BETWEEN THEIR BINOMIAL IDEALS. MOREOVER, WE PRESENT THE IDEAL OF A LATTICE ACCORDING TO ANY GENERATING SET OF THE LATTICE. IN ADDITION, USING OUR RESULTS WE OBTAIN THE REDUCED GROBNER BASIS FOR ROOT LATTICE DN AS A CONSEQUENCE A GENERATOR MATRIX FOR THE LABEL CODE OF DN LATTICE.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 159

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 111
Issue Info: 
  • Year: 

    2013
  • Volume: 

    44
Measures: 
  • Views: 

    147
  • Downloads: 

    123
Abstract: 

WE CLASSIFY ALL COMPLETE UNIFORM MULTIPARTITE HYPER-GRAPHS WITH RESPECT TO SOME ALGEBRAIC PROPERTIES, SUCH AS BEING (AL-MOST) COMPLETE INTERSECTION, GORENSTEIN, LEVEL, L -COHEN-MACAULAY, L-BUCHSBAUM, SEQUENTIALLY COHEN-MACAULAY, SEQUENTIALLY SR, UNMIXED, AND SATISFYING SERRE'S CONDITION SR, VIA SOME COMBINATORIAL TERMS.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 147

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 123
Issue Info: 
  • Year: 

    2013
  • Volume: 

    44
Measures: 
  • Views: 

    123
  • Downloads: 

    57
Abstract: 

IN THIS TALK, WE EXPLAIN THE REGULARITY OF EDGE IDEAL OF SOME CLASSES OF GRAPHS IN TERMS OF INVARIANTS OF GRAPHS. WE SHOW THAT FOR A C5-FREE VERTEX DECOMPOSABLE GRAPH G, REG (R/I (G)) = CG, WHERE CG IS THE MAXIMUM NUMBER OF 3-DISJOINT EDGES IN G.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 123

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 57
Author(s): 

MORADI S. | KIANI D.

Issue Info: 
  • Year: 

    2010
  • Volume: 

    36
  • Issue: 

    2
  • Pages: 

    267-277
Measures: 
  • Citations: 

    0
  • Views: 

    373
  • Downloads: 

    181
Abstract: 

We give upper bounds for the regularity of EDGE IDEAL of some classes of graphs in terms of invariants of graph. We introduce two numbers a’ (G) and n (G) depending on graph G and show that for a vertex decomposable graphG, reg (R/I (G)) £ min{a’ (G), n (G)} and for a shellable graph G, reg (R/I (G))£n (G). Moreover, it is shown that for a graphG, where Gc is a d-tree, we have pd (R/I (G)) =maxvÎV (G) {degG (v)}.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 373

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 181 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2014
  • Volume: 

    1
Measures: 
  • Views: 

    152
  • Downloads: 

    60
Abstract: 

LET G BE A DIRECTED GRAPH WITH N VERTICES AND M EDGES, AND I (B) A BINOMIAL IDEAL CORRESPONDED TO THE INCIDENCE MATRIX B OF THE GRAPH G. ALSO BY REMOVING THE I’TH ROW OF B, A NEW MATRIX IS MADE AND IS CALLED BI. IN THIS PAPER IT IS SHOWN THAT THE HEIGHTS OF I (B) AND I (BI) ARE EQUAL TO N-1 AND THE DIMENSIONS OF I (B) AND I (BI) ARE EQUAL TO M-N+1. THEN A SUFFICIENT AND NECESSARY CONDITION IS GIVEN FOR I (BI) TO BE PRIME. A SUFFICIENT COMBINATORIAL CONDITION IS GIVEN FOR I (B) AND I (BI) TO BE COMPLETE INTERSECTIONS. FINALLY A FREE COMPLEX FOR I (B) WILL BE PRESENTED AND, FOR SPECIFIC GRAPHS, A FREE RESOLUTION WILL BE STATED FOR I (B).

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 152

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 60
Author(s): 

Damadi Hamid | RAHMATI FARHAD

Issue Info: 
  • Year: 

    2018
  • Volume: 

    7
  • Issue: 

    2
  • Pages: 

    35-46
Measures: 
  • Citations: 

    0
  • Views: 

    376
  • Downloads: 

    105
Abstract: 

Let G be a simple, oriented connected graph with n vertices and m EDGEs. Let I (B) be the BINOMIAL IDEAL associated to the incidence matrix B of the graph G. Assume that IL is the lattice IDEAL associated to the rows of the matrix B. Also let Bi be a sub matrix of B after removing the i -th row. We introduce a graph theoretical criterion for G which is a sufficient and necessary condition for I (B) =I (Bi) and I (Bi) =IL. After that we introduce another graph theoretical criterion for G which is a sufficient and necessary condition for I (B) =IL. It is shown that the heights of I (B) and I (Bi) are equal to n - 1 and the dimensions of I (B) and I (Bi) are equal to m - n+1; then I (Bi) is a complete intersection IDEAL.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 376

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 105 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2002
  • Volume: 

    20
  • Issue: 

    1 (Specail Issue)
  • Pages: 

    35-42
Measures: 
  • Citations: 

    1
  • Views: 

    1362
  • Downloads: 

    0
Abstract: 

Aim: This study was designed to determine any profile changes and indentify the role of the most significant factors responsible for these changes.Materials and Methods: Cephalograms of 56 class II Division I patients (36 female and 18 male with mean age of 10 years) were used to analysis any changes in the perioral soft tissue profile before and after the treatment. A correlation analysis and multiple regression analysis (forward) revealed complex interaction between dentition, bony structures and soft tissues of the perioral area.Results: Retraction at the upper lip and increase in lower lip length in boys were more predictable than that of others. Significant soft tissue changes occured in response to orthodontic treatment, Upper lip retraction was shown to be related to the following factors: a- Retraction of upper incisal EDGEs during treatment, b-Retraction of Point A, c- Pretreatment upper sulcus thickness and d- Retraction of sulcus superior.Conclusion: A greater increase in lower lip length takes place with greater amount of maxillary incisa1 EDGE retraction during treatment and a greater amount of sulcus superior retraction.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 1362

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button