A5008660135- Advanced Graph Theory Research
- Matrix Theory and Algorithms
- Complexity and Algorithms in Graphs
- Graph theory and applications
- Poisoning and overdose treatments
- Neurological and metabolic disorders
- Rings, Modules, and Algebras
- Limits and Structures in Graph Theory
- Geometric Analysis and Curvature Flows
- Sepsis Diagnosis and Treatment
- Advanced Topics in Algebra
- Elasticity and Material Modeling
- Algebraic structures and combinatorial models
- Fiber-reinforced polymer composites
- Pneumonia and Respiratory Infections
- Emergency and Acute Care Studies
- Black Holes and Theoretical Physics
- Commutative Algebra and Its Applications
- Metallurgy and Material Forming
- Muscle and Compartmental Disorders
University of Nebraska–Lincoln
2023-2024
Saints Cyril and Methodius University of Skopje
2021
University of Wisconsin–Superior
2018
Background. The aim of this study was to evaluate the ability severity scoring systems predict 30-day mortality in patients with severe community-acquired pneumonia. Methods. included 98 aged ≥18 years community acquired pneumonia hospitalized at Intensive Care Unit University Clinic for Infectious Diseases Skopje, Republic North Macedonia, during a 3-year period. We recorded demographic, clinical and common biochemical parameters. Five scores were calculated admission: CURB 65 (Confusion,...
Ahlswede and Cai proved that if a simple graph has nested solutions (NS) under the edge-isoperimetric problems, lexicographic (lex) order produces NS for its second cartesian power,then lex any finite power. Under very general assumptions, we prove power have NS,then so does Harper asked this is true without restriction. We also conjecture it is. All graphs studied in literature which optimal are regular. This lead Bezrukov Els\"asser to power, then original A counterexample provided.
We determine all maximum weight downsets in the product of two chains, where function is a strictly increasing rank. Many discrete isoperimetric problems can be reduced to downset problem. Our results generalize Lindsay's edge-isoperimetric theorem dimensions several directions. They also imply and strengthen (in directions) result Ahlswede Katona concerning graphs with maximal number adjacent pairs edges. find optimal shifted Ahlswede-Katona Furthermore, are extended posets rank constant...
Macaulay posets are in which an analog of the Kruskal-Katona Theorem holds. rings (also called Macaulay-Lex rings) Macaulay's for lex ideals The study both these objects started with almost a century ago. Since then, two branches have developed separately over past century, last link being Clements-Lindström Theorem. For every ring that is quotient polynomial by homogeneous ideal we define poset monomials. Under certain conditions, prove Correspondence Theorem, if and only its monomials...
We prove a generalization of the Ahlswede-Cai local-global principle. A new technique to handle edge-isoperimetric problems is introduced which we call pull-push method. Our main result includes all previously published results in this area as special cases with only exception problem for grids. With partially answer question Harper on principles. also describe strategy further our so that case grids would be covered, completely settle Harper's question.
We determine all maximum weight downsets in the product of two chains, where function is a strictly increasing rank. Many discrete isoperimetric problems can be reduced to downset problem. Our results generalize Lindsay's edge-isoperimetric theorem dimensions several directions. They also imply and strengthen (in directions) result Ahlswede Katona concerning graphs with maximal number adjacent pairs edges. find optimal shifted Ahlswede-Katona Furthermore, are extended posets rank constant...