Related papers: Graver degrees are not polynomially bounded by tru…

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

We consider standard graded toric rings $R_{\Delta}$ whose generators correspond to the faces of a simplicial complex $\Delta$. When $R_{\Delta}$ is normal, it is shown that its divisor class group is free. For a flag complex $\Delta$ which…

In dieser Diplomarbeit werden einige Gradschranken f\"ur Erzeugendensysteme und Gr\"obnerbasen von torischen Idealen von Flusspolytopen bewiesen. Alle torischen Ideale von Flusspolytopen sind im Grad 3 erzeugt. Glatte…

The degree excess function $\epsilon(I;n)$ is the difference between the maximal generating degree $d(I^n)$ of a homogeneous ideal $I$ of a polynomial ring and $p(I)n$, where $p(I)$ is the leading coefficient of the asymptotically linear…

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals. We show that hypergraphs exhibit a surprisingly general…

Let $(A,\mathfrak{m})$ be a hypersurface local ring of dimension $d \geq 1$ and let $I$ be an $\mathfrak{m}$-primary ideal. We show that there is a non-negative integer $r_I$ (depending only on $I$) such that if $M$ is any non-free maximal…

These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…

In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…

An ideal I is robust if its universal Gr\"obner basis is a minimal generating set for this ideal. In this paper, we generalize the meaning of robust ideals. An ideal is defined as generalized robust if its universal Gr\"obner basis is equal…

In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a…

In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…

We prove that a reduced and irreducible algebraic surface in $\mathbb{CP}^{3}$ containing infinitely many twistor lines cannot have odd degree. Then, exploiting the theory of quaternionic slice regularity and the normalization map of a…

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

We prove that any finite-degree polynomial functor is topologically Noetherian. This theorem is motivated by the recent resolution of Stillman's conjecture and a recent Noetherianity proof for the space of cubics. Via work by…

Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…

Polynomial invariants of a group action often appear only in high degree, and in many representations the invariant ring imposes severe degree constraints before any nontrivial invariants can occur. In contrast, the larger class of unitary…

We study powers of binomial edge ideals associated with closed and block graphs.

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…