نتایج جستجو برای: stanley
تعداد نتایج: 4104 فیلتر نتایج به سال:
We study Stanley decompositions and show that Stanley’s conjecture on Stanley decompositions implies his conjecture on partitionable Cohen-Macaulay simplicial complexes. We also prove these conjectures for all Cohen-Macaulay monomial ideals of codimension 2 and all Gorenstein monomial ideals of codimension 3.
Sprout-borne Salmonella outbreaks in Finland have increased during the last 10 years. The latest two were caused by Salmonella enterica serovar Bovismorbificans (antigenic structure 6,8:r:1,5) in 1994 and S. enterica serovar Stanley (4,5, 12:d:1,2) in 1995. In this study, the restriction fragment length polymorphism of genomic DNA after pulsed-field gel electrophoresis (PFGE) and antimicrobial ...
This article describes the robot Stanley, which won the 2005 DARPA Grand Challenge. Stanley was developed for high-speed desert driving without manual intervention. The robot’s software system relied predominately on state-of-the-art arti cial intelligence technologies, such as machine learning and probabilistic reasoning. This article describes the major components of this architecture, and di...
We study Stanley decompositions and show that Stanley’s conjecture on Stanley decompositions implies his conjecture on partitionable Cohen-Macaulay simplicial complexes. We also prove these conjectures for all Cohen-Macaulay monomial ideals of codimension 2 and all Gorenstein monomial ideals of codimension 3.
In this paper, we prove that the Stanley–Reisner ideal of any connected simplicial complex of dimension ≥ 2 that is locally complete intersection is a complete intersection ideal. As an application, we show that the Stanley–Reisner ideal whose powers are Buchsbaum is a complete intersection ideal.
ing and Indexing ServicesThe Journal is indexed by Accounting and Tax Index, Emerald ManagementReviews (Online Edition), Environmental Science and Pollution Manage-ment, Risk Abstracts (Online Edition), and Banking Information Index. Disclaimer The Publisher, Morgan Stanley, its affiliates, and the Editorcannot be held responsible for errors or any consequences arising fromt...
A long-standing conjecture of Stanley states that every Cohen– Macaulay simplicial complex is partitionable. We disprove the conjecture by constructing an explicit counterexample. Due to a result of Herzog, Jahan and Yassemi, our construction also disproves the conjecture that the Stanley depth of a monomial ideal is always at least its depth.
We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I ⊂ S = K[x 1 , ..., x n ] and prove that Janet's algorithm gives the squarefree Stanley decomposition of S/I for a squarefree monomial ideal I. We have also shown that the Janet's algorithm gives a partition of a simplicial complex.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید