Searcharxiv⌕ Search

arXiv subjects

Winfried Bruns

Publications and source records attributed to Winfried Bruns.

At least 37 records · Page 2Linked to original sources
arXiv2016

The subdivision of large simplicial cones in Normaliz

Normaliz is an open-source software for the computation of lattice points in rational polyhedra, or, in a different language, the solutions of linear diophantine systems. The two main computational goals are (i) finding a system of generators of the set of lattice points and (ii) counting elements degree-wise in a generating function, the Hilbert Series. In the homogeneous case, in which the polyhedron is a cone, the set of generators is the Hilbert basis of the intersection of the cone and the lattice, an affine monoid. We will present some improvements to the Normaliz algorithm by subdividing simplicial cones with huge volumes. In the first approach the subdivision points are found by integer programming techniques. For this purpose we interface to the integer programming solver SCIP to our software. In the second approach we try to find good subdivision points in an approximating overcone that is faster to compute.

math.CO↗
arXiv2016

Linear resolutions of powers and products

The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see, this condition is strongly correlated to good primary decompositions of the products and good homological and arithmetical properties of the associated multi-Rees algebras. The following families will be discussed in detail: polymatroidal ideals, ideals generated by linear forms and Borel fixed ideals of maximal minors. The main tools are Gröbner bases and Sagbi deformation.

math.AC↗
arXiv2016

Quantum jumps of normal polytopes

We introduce a partial order on the set of all normal polytopes in R^d. This poset NPol(d) is a natural discrete counterpart of the continuum of convex compact sets in R^d, ordered by inclusion, and exhibits a remarkably rich combinatorial structure. We derive various arithmetic bounds on elementary relations in NPol(d), called "quantum jumps". The existence of extremal objects in NPol(d) is a challenge of number theoretical flavor, leading to interesting classes of normal polytopes: minimal, maximal, spherical. Minimal elements in NPol(5) have played a critical role in disproving various covering conjectures for normal polytopes in the 1990s. Here we report on the first examples of maximal elements in NPol(4) and NPol(5), found by a combination of the developed theory, random generation, and extensive computer search.

math.CO↗
arXiv2016

Products of Borel fixed ideals of maximal minors

We study a large family of products of Borel fixed ideals of maximal minors. We compute their initial ideals and primary decompositions, and show that they have linear free resolutions. The main tools are an extension of straightening law and a very surprising primary decomposition formula. We study also the homological properties of associated multi-Rees algebra which are shown to be Cohen-Macaulay, Koszul and defined by a Gröbner basis of quadrics.

math.AC↗
arXiv2015

The power of pyramid decomposition in Normaliz

We describe the use of pyramid decomposition in Normaliz, a software tool for the computation of Hilbert bases and enumerative data of rational cones and affine monoids. Pyramid decomposition in connection with efficient parallelization and streamlined evaluation of simplicial cones has enabled Normaliz to process triangulations of size $\approx 5\cdot 10^{11}$ that arise in the computation of Hilbert series related to combinatorial voting theory.

math.CO↗
arXiv2013

Hilbert regularity of ZZ-graded modules over polynomial rings

Let M be a finitely generated ZZ-graded module over the standard graded polynomial ring R=K[X_1, ..., X_n] with K a field, and let H_M(t)=Q_M(t)/(1-t)^d be the Hilbert series of M. We introduce the Hilbert regularity of M as the lowest possible value of the Castelnuovo-Mumford regularity for an R-module with Hilbert series H_M. Our main result is an arithmetical description of this invariant which connects the Hilbert regularity of M to the smallest k such that the power series Q_M(1-t)/(1-t)^k has no negative coefficients. Finally we give an algorithm for the computation of the Hilbert regularity and the Hilbert depth of an R-module.

math.AC↗
arXiv2013

Partitions of single exterior type

We characterize the irreducible representations of the general linear group GL(V) that have multiplicity 1 in the direct sum of all Schur modules of a given exterior power of V. These have come up in connection with the relations of the lower order minors of a generic matrix. We show that the minimal relations conjectured by Bruns, Conca and Varbaro are exactly those coming from partitions of single exterior type.

math.RT↗
arXiv2013

Relations between the minors of a generic matrix

It is well-known that the Plücker relations generate the ideal of relations of the maximal minors of a generic matrix. In this paper we discuss the relations between minors of a (non-maximal) fixed size. We will exhibit minimal relations in degrees 2 (non-Plücker in general) and 3, and give some evidence for our conjecture that we have found the generating system of the ideal of relations. The approach is through the representation theory of the general linear group.

math.AC↗
arXiv2013

Ideals generated by superstandard tableaux

We investigate products J of ideals of "row initial" minors in the polynomial ring K[X] defined by a generic m-by-n matrix. Such ideals are shown to be generated by a certain set of standard bitableaux that we call superstandard. These bitableaux form a Gröbner basis of J, and J has a linear minimal free resolution. These results are used to derive a new generating set for the Grothendieck group of finitely generated (T_m x GL_n(K))-equivariant modules over K[X]. We employ the Knuth--Robinson--Schensted correspondence and a toric deformation of the multi-Rees algebra that parameterizes the ideals J.

math.AC↗
arXiv2013

Binomial regular sequences and free sums

Recently several authors have proved results on Ehrhart series of free sums of rational polytopes. In this note we treat these results from an algebraic viewpoint. Instead of attacking combinatorial statements directly, we derive them from structural results on affine monoids and their algebras that allow conclusions for Hilbert and Ehrhart series. We characterize when a binomial regular sequence generates a prime ideal or even normality is preserved for the residue class ring.

math.CO↗
arXiv2013

The quest for counterexamples in toric geometry

We discuss an experimental approach to open problems in toric geometry: are smooth projective toric varieties (i) projectively normal and (ii) defined by degree 2 equations? We discuss the creation of lattice polytopes defining smooth toric varieties as well as algorithms checking properties (i) and (ii) and further potential properties, in Particular a weaker version of (ii) asking for scheme-theoretic definition in degree 2.

math.AG↗
arXiv2013

Maximal minors and linear powers

An ideal I in a polynomial ring S has linear powers if all the powers I^k of I have a linear free resolution. We show that the ideal of maximal minors of a sufficiently general matrix with linear entries has linear powers. The required genericity is expressed in terms of the heights of the ideals of lower order minors. In particular we prove that every rational normal scroll has linear powers.

math.AC↗
arXiv2012

The computation of generalized Ehrhart series in Normaliz

We describe an algorithm for the computation of generalized (or weighted) Ehrhart series based on Stanley decompositions as implemented in the offspring NmzIntegrate of Normaliz. The algorithmic approach includes elementary proofs of the basic results. we illustrate the computations by examples from combinatorial voting theory.

math.CO↗
arXiv2010

Hilbert depth of powers of the maximal ideal

The Hilbert depth of a module M is the maximum depth that occurs among all modules with the same Hilbert function as M. In this note we compute the Hilbert depths of the powers of the irrelevant maximal ideal in a standard graded polynomial ring.

math.AC↗
arXiv2010

A Macaulay 2 interface for Normaliz

Normaliz is a tool for the computation of Hilbert bases of normal affine monoids and related tasks. We describe the Macaulay 2 interface to Normaliz. It makes Normaliz accessible for operations on monoid algebras in Macaulay 2 and, conversely, makes Macaulay 2 a frontend for Normaliz.

math.AC↗
arXiv2010

Stanley decompositions and Hilbert depth in the Koszul complex

Stanley decompositions of multigraded modules $M$ over polynomials rings have been discussed intensively in recent years. There is a natural notion of depth that goes with a Stanley decomposition, called the Stanley depth. Stanley conjectured that the Stanley depth of a module $M$ is always at least the (classical) depth of $M$. In this paper we introduce a weaker type of decomposition, which we call Hilbert decomposition, since it only depends on the Hilbert function of $M$, and an analogous notion of depth, called Hilbert depth. Since Stanley decompositions are Hilbert decompositions, the latter set upper bounds to the existence of Stanley decompositions. The advantage of Hilbert decompositions is that they are easier to find. We test our new notion on the syzygy modules of the residue class field of $K[X_1,...,X_n]$ (as usual identified with $K$). Writing $M(n,k)$ for the $k$-th syzygy module, we show that theHilbert depth of M(n,1) is $\lfloor(n+1)/2\rfloor$. Furthermore, we show that, for $n > k \ge \lfloor n/2\rfloor$, the Hilbert depth of $M(n,k)$ is equal to $n-1$. We conjecture that the same holds for the Stanley depth. For the range $n/2 > k > 1$, it seems impossible to come up with a compact formula for the Hilbert depth. Instead, we provide very precise asymptotic results as $n$ becomes large.

math.AC↗