Archive

Year

Volume(Issue)

Issues

مرکز اطلاعات علمی SID1
اسکوپوس
مرکز اطلاعات علمی SID
ریسرچگیت
strs
Author(s): 

SAMODIVKIN VLADIMIR

Issue Info: 
  • Year: 

    2017
  • Volume: 

    6
  • Issue: 

    3
  • Pages: 

    1-9
Measures: 
  • Citations: 

    0
  • Views: 

    29067
  • Downloads: 

    12090
Abstract: 

Please click on PDF to view the abstract.

Yearly Impact:

View 29067

Download 12090 Citation 0 Refrence 0
Author(s): 

SAEEDI MAHDIS | RAHMATI FARHAD

Issue Info: 
  • Year: 

    2017
  • Volume: 

    6
  • Issue: 

    3
  • Pages: 

    11-18
Measures: 
  • Citations: 

    0
  • Views: 

    32673
  • Downloads: 

    13133
Abstract: 

In this paper we introduce the concept of generalized trees and compute the Hilbert series of their binomial edge ideals

Yearly Impact:

View 32673

Download 13133 Citation 0 Refrence 0
Issue Info: 
  • Year: 

    2017
  • Volume: 

    6
  • Issue: 

    3
  • Pages: 

    19-36
Measures: 
  • Citations: 

    0
  • Views: 

    34198
  • Downloads: 

    11558
Abstract: 

Binary array pairs with optimal/ideal correlation values and their algebraic counterparts \difference set pairs" (DSPs) in abelian groups are studied. In addition to generalizing known 1-dimensional (sequences) examples, we provide four new recursive constructions, unifying previously obtained ones. Any further advancements in the construction of binary sequences/arrays with opti-mal/ideal correlation values (equivalently cyclic/abelian difference sets) would give rise to richer classes of DSPs (and hence binary perfect array pairs). Discrete signals arising from DSPs nd applications incryptography, CDMA systems, radar and wireless communications.

Yearly Impact:

View 34198

Download 11558 Citation 0 Refrence 0
Author(s): 

MCKAY BRENDAN D.

Issue Info: 
  • Year: 

    2017
  • Volume: 

    6
  • Issue: 

    3
  • Pages: 

    37-43
Measures: 
  • Citations: 

    0
  • Views: 

    37831
  • Downloads: 

    12972
Abstract: 

In 1991, McKay and Radziszowski proved that, however each 3-subset of a 13-set is assigned one of two colours, there is some 4-subset whose four 3-subsets have the same colour. More than 25 years later, this remains the only non-trivial classical Ramsey number known for hypergraphs. In this article, we nd all the extremal colourings of the 3-subsets of a 12-set and list some of their properties. We also provide an answer to a question of Dudek, La Fleur, Mubayi and Rodl about the size-Ramsey numbers of hypergraphs.

Yearly Impact:

View 37831

Download 12972 Citation 0 Refrence 0
Issue Info: 
  • Year: 

    2017
  • Volume: 

    6
  • Issue: 

    3
  • Pages: 

    45-59
Measures: 
  • Citations: 

    0
  • Views: 

    27973
  • Downloads: 

    11556
Abstract: 

.Please click on PDF to view the abstract

Yearly Impact:

View 27973

Download 11556 Citation 0 Refrence 0