On linear algebraic semigroups. III.
Putcha, Mohan S. (1981)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Putcha, Mohan S. (1981)
International Journal of Mathematics and Mathematical Sciences
Similarity:
M. Deza, S. Onn (1995)
Discrete & computational geometry
Similarity:
Athanasiadis, Christos A. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
I. Bárány, A.M. Vershik (1992)
Geometric and functional analysis
Similarity:
Bayer, Margaret M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bárány, Imre, Kantor, Jean-Michel (1999)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Beck, Matthias (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Thomas Kahle, Walter Wenzel, Nihat Ay (2009)
Kybernetika
Similarity:
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes, and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.
H. Maehara (1995)
Discrete & computational geometry
Similarity:
Prakash Santhanakrishnan, Andrei Zelevinsky (1994)
Discrete & computational geometry
Similarity:
Qiumei Wang, Jianming Zhan, R.A. Borzooei (2017)
Open Mathematics
Similarity:
In this paper, we study a kind of soft rough semigroups according to Shabir’s idea. We define the upper and lower approximations of a subset of a semigroup. According to Zhan’s idea over hemirings, we also define a kind of new C-soft sets and CC-soft sets over semigroups. In view of this theory, we investigate the soft rough ideals (prime ideals, bi-ideals, interior ideals, quasi-ideals, regular semigroups). Finally, we give two decision making methods: one is for looking a best a parameter...