1 3 Werner M.Seiler Page 1 1 3 algorithms and computation in mathematics 24 Involution
The Formal Theory of Differential Equations and its Applications in Computer Algebra Werner …

Let J⊂ I be monomial ideals. We show that the Stanley depth of I/J can be computed in a
finite number of steps. We also introduce the fdepth of a monomial ideal which is defined in …

A long-standing conjecture of Stanley states that every Cohen–Macaulay simplicial complex
is partition-able. We disprove the conjecture by constructing an explicit counterexample …

Full article: Depth and Stanley Depth of Multigraded Modules Skip to Main Content Taylor
and Francis Online homepage Taylor and Francis Online homepage Log in | Register Cart 1.Home …

At the MONICA conference “MONomial Ideals, Computations and Applications” at the CIEM,
Castro Urdiales (Cantabria, Spain) in July 2011, I gave three lectures covering different …

Much of the existing literature on involutive bases concentrates on their efficient algorithmic
construction. By contrast, we are here more concerned with their structural properties …

In this paper we list a number of open problems and conjectures on Hilbert functions and
syzygies. Some of the problems are closely related to Algebraic Geometry, Combinatorics …

In this paper, we answer a question posed by Herzog, Vladoiu, and Zheng. Their motivation
involves a 1982 conjecture of Richard Stanley concerning what is now called the Stanley …

History and Background Richard P. Stanley is well known for his fundamental and important
contributions to combinatorics and its relationship to algebra and geometry, in particular in …

Stanley decompositions of multigraded modules 𝑀 over polynomial rings have been
discussed intensively in recent years. There is a natural notion of depth that goes with a …