Degenerations to unobstructed Fano Stanley–Reisner schemes

We construct degenerations of Mukai varieties and linear sections thereof to special unobstructed Fano Stanley–Reisner schemes corresponding to convex deltahedra. This can be used to find toric degenerations of rank one index one Fano threefolds. Furthermore, we show that the Stanley–Reisner ring of the boundary complex of the dual polytope of the associahedron has trivial \(T^2\) . This can be used to find new toric degenerations of linear sections of \(G(2,n)\) .     

Algebra retracts and Stanley–Reisner rings

In a paper from 2002, Bruns and Gubeladze conjectured that graded algebra retracts of polytopal algebras over a field k are again polytopal algebras. Motivated by this conjecture, we prove that graded algebra retracts of Stanley–Reisner rings over a field k are again Stanley–Reisner rings. Extending this result further, we give partial evidence for a conjecture saying that monomial quotients of standard graded polynomial rings over k descend along graded algebra retracts.     

Buchsbaum Stanley–Reisner Rings and Cohen–Macaulay Covers

First, we give a new criterion for Buchsbaum Stanley–Reisner rings to have linear resolutions. Next, we prove that every (d ? 1)-dimensional complex Δ of initial degree d is contained in the same dimensional Cohen–Macaulay complex whose (d ? 1)th reduced homology is isomorphic to that of Δ. We call such a simplicial complex a Cohen–Macaulay cover of Δ. And we also show that all the intermediate complexes between Δ and its Cohen–Macaulay cover are Buchsbaum provided that Δ is Buchsbaum. As an application, we determine the h-vectors of the 3-dimensional Buchsbaum Stanley–Reisner rings with initial degree 3.     

Stanley–Reisner resolution of constant weight linear codes

Given a constant weight linear code, we investigate its weight hierarchy and the Stanley–Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude that the code is of constant weight.     

Arithmetical Ranks of Stanley–Reisner Ideals Via Linear Algebra

We present some examples of squarefree monomial ideals whose arithmetical rank can be computed using linear algebraic considerations.     

Betti numbers of Stanley–Reisner rings determine hierarchical Markov degrees

There are two seemingly unrelated ideals associated with a simplicial complex Δ: one is the Stanley–Reisner ideal I _Δ , the monomial ideal generated by minimal non-faces of Δ, well-known in combinatorial commutative algebra; the other is the toric ideal I _M(Δ) of the facet subring of Δ, whose generators give a Markov basis for the hierarchical model defined by Δ, playing a prominent role in algebraic statistics. In this note we show that the complexity of the generators of I _M(Δ) is determined by the Betti numbers of I _Δ . The unexpected connection between the syzygies of the Stanley–Reisner ideal and degrees of minimal generators of the toric ideal provide a framework for further exploration of the connection between the model and its many relatives in algebra and combinatorics.     

The Stanley–Reisner Ideals of Polygons as Set-Theoretic Complete Intersections

We show that the Stanley–Reisner ideal of the one-dimensional simplicial complex whose diagram is an n-gon is always a set-theoretic complete intersection in any positive characteristic.     

On the Stanley–Reisner ideal of an expanded simplicial complex

Let Δ be a simplicial complex. We study the expansions of Δ mainly to see how the algebraic and combinatorial properties of Δ and its expansions are related to each other. It is shown that Δ is Cohen–Macaulay, sequentially Cohen–Macaulay, Buchsbaum or k-decomposable, if and only if an arbitrary expansion of Δ has the same property. Moreover, some homological invariants like the regularity and the projective dimension of the Stanley–Reisner ideals of Δ and those of their expansions are compared.     

Subalgebras of the Stanley—Reisner Ring

In [2], Billera proved that the R -algebra of continuous piecewise polynomial functions (C ⁰ splines) on a d -dimensional simplicial complex Δ embedded in R ^d is a quotient of the Stanley—Reisner ring A _Δ of Δ. We derive a criterion to determine which elements of the Stanley—Reisner ring correspond to splines of higher-order smoothness. In [5], Lau and Stiller point out that the dimension of C ^r _k (Δ) is upper semicontinuous in the Zariski topology. Using the criterion, we give an algorithm for obtaining the defining equations of the set of vertex locations where the dimension jumps. Received June 2, 1997, and in revised form December 22, 1997, and March 24, 1998.     

Codismantlability and projective dimension of the Stanley–Reisner ring of special hypergraphs

In this paper, we generalize the concept of codismantlable graphs to hypergraphs and show that some special vertex decomposable hypergraphs are codismantlable. Then we generalize the concept of bouquet in graphs to hypergraphs to extend some combinatorial invariants of graphs about disjointness of a set of bouquets. We use these invariants to characterize the projective dimension of Stanley–Reisner ring of special hypergraphs in some sense.     

Relative Stanley–Reisner theory and Upper Bound Theorems for Minkowski sums

In this paper we settle two long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of equality. We similarly give a (tight) upper bound theorem for mixed facets of Minkowski sums. This has a wide range of applications and generalizes the classical Upper Bound Theorems of McMullen and Stanley.Our main observation is that within (relative) Stanley–Reisner theory, it is possible to encode topological as well as combinatorial/geometric restrictions in an algebraic setup. We illustrate the technology by providing several simplicial isoperimetric and reverse isoperimetric inequalities in addition to our treatment of Minkowski sums.     

Auslander–Reiten sequences on schemes

Auslander–Reiten sequences are the central item of Auslander–Reiten theory, which is one of the most important techniques for the investigation of the structure of abelian categories. This note considers X, a smooth projective scheme of dimension at least 1 over the field k, and , an indecomposable coherent sheaf on X. It is proved that in the category of quasi-coherent sheaves on X, there is an Auslander–Reiten sequence ending in .     

Unimodal Gorenstein h-vectors without the Stanley–Iarrobino property

The study of the h-vectors of graded Gorenstein algebras is an important topic in combinatorial commutative algebra, which despite the large amount of literature produced during the last several years, still presents many interesting open questions. In this note, we commence a study of those unimodal Gorenstein h-vectors that do not satisfy the Stanley–Iarrobino property. Our main results, which are characteristic free, show that such h-vectors exist: 1) In socle degree e if and only if e≥6; and 2) in every codimension five or greater. The main case that remains open is that of codimension four, where no Gorenstein h-vector is known without the Stanley–Iarrobino property. We conclude by proposing the following very general conjecture: The existence of any arbitrary level h-vector is independent of the characteristic of the base field.     

Alternating triangular schemes for convection–diffusion problems

Explicit–implicit approximations are used to approximate nonstationary convection–diffusion equations in time. In unconditionally stable two-level schemes, diffusion is taken from the upper time level, while convection, from the lower layer. In the case of three time levels, the resulting explicit–implicit schemes are second-order accurate in time. Explicit alternating triangular (asymmetric) schemes are used for parabolic problems with a self-adjoint elliptic operator. These schemes are unconditionally stable, but conditionally convergent. Three-level modifications of alternating triangular schemes with better approximating properties were proposed earlier. In this work, two- and three-level alternating triangular schemes for solving boundary value problems for nonstationary convection–diffusion equations are constructed. Numerical results are presented for a two-dimensional test problem on triangular meshes, such as Delaunay triangulations and Voronoi diagrams.     

Multirate Runge–Kutta schemes for advection equations

Explicit time integration methods can be employed to simulate a broad spectrum of physical phenomena. The wide range of scales encountered lead to the problem that the fastest cell of the simulation dictates the global time step. Multirate time integration methods can be employed to alter the time step locally so that slower components take longer and fewer time steps, resulting in a moderate to substantial reduction of the computational cost, depending on the scenario to simulate [S. Osher, R. Sanders, Numerical approximations to nonlinear conservation laws with locally varying time and space grids, Math. Comput. 41 (1983) 321–336; H. Tang, G. Warnecke, A class of high resolution schemes for hyperbolic conservation laws and convection-diffusion equations with varying time and pace grids, SIAM J. Sci. Comput. 26 (4) (2005) 1415–1431; E. Constantinescu, A. Sandu, Multirate timestepping methods for hyperbolic conservation laws, SIAM J. Sci. Comput. 33 (3) (2007) 239–278]. In air pollution modeling the advection part is usually integrated explicitly in time, where the time step is constrained by a locally varying Courant–Friedrichs–Lewy (CFL) number. Multirate schemes are a useful tool to decouple different physical regions so that this constraint becomes a local instead of a global restriction. Therefore it is of major interest to apply multirate schemes to the advection equation. We introduce a generic recursive multirate Runge–Kutta scheme that can be easily adapted to an arbitrary number of refinement levels. It preserves the linear invariants of the system and is of third order accuracy when applied to certain explicit Runge–Kutta methods as base method.