ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Law
Education
Medicine / Sub specialtie
Medicine / Pharmacology
Biology
Economy
Physical
all records (28)

Languages
English
German

Countries
Italy
Australia
USA
Canada
South Africa
United Kingdom
Argentina
India
Indonesia
Brazil
all records (18)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (19)

Filter  
 
70  Articles
1 of 7 pages  |  10  records  |  more records»
There is mounting evidence that forward heart failure as manifested by low cardiac output alone does not define the degree of renal dysfunction in cardiorenal syndrome. As a result, the term “congestive renal failure” was coined in 2012 by Ross to depict ... see more

-

AbstractThis study reviews the oversight roles played by municipal councillors in Alfred Nzo District Municipality, Eastern Cape Province, South Africa. The objective is to determine the appropriate strategies that can be recommended for improving effecti... see more

Let HH be an nn-generated numerical semigroup such that its tangent cone grmK[H]\operatorname{gr}_\mathfrak{m} K[H] is defined by quadratic relations. We show that if n<5n then grmK[H]\operatorname{gr}_\mathfrak{m} K[H] is Cohen-Macaulay, and... see more

Let G=(V,E)G=(V,E) be a graph. If GG is a König graph or if GG is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ?G\Delta_{G} is pure shellable, R/I?R/I_{\Delta} is Cohen-Macaulay, GG is unmixed vertex decomp... see more

We study the Hilbert function and the Hilbert series of the vertex cover algebra A(G), where G is a Cohen-Macaulay bipartite graph.

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable bi-Cohen-Macaulay graphs are... see more

We introduce a new family of simple graphs, so called, growing graphs. We investigate ways to modify a given simple graph G combinatorially to obtain a growing graph. One may obtain infinitely many growing graphs from a single simple graph. We show that a... see more

Cho (R, m) là vành giao hoán Noether và Q(R) là vành các thuong toàn ph?n c?a R. M?c dích c?a bài báo này là nghiên c?u c?u trúc c?a các vành trung gian gi?a R và Q(R). G?i X là t?p t?t c? các l?p tuong duong [I], trong dó I là ideal c?a R ... see more

1 of 7 pages  |  10  records  |  more records»