Related papers: Solving degree, last fall degree, and related inva…
We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which…
We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
We develop a multigraded variant of Castelnuovo-Mumford regularity. Motivated by toric geometry, we work with modules over a polynomial ring graded by a finitely generated abelian group. As in the standard graded case, our definition of…
The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…
We estimate the Castelnuovo-Mumford regularity of ideals in a polynomial ring over a field by studying the regularity of certain modules generated in degree zero and with linear relations. In dimension one, this process gives a new type of…
When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…
The Castelnuovo-Mumford regularity of the Jacobian algebra and of the graded module of derivations associated to a general curve arrangement in the complex projective plane are studied. The key result is an addition-deletion type result,…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
Substantial changes in many parts of the paper. In particular, significantly expanded treatment of monomial ideals and of Castelnuovo-Mumford regularity. Also relation between delta-regularity and Noether normalisation now treated.
The Castelnuovo-Mumford regularity of a graded ring is an important invariant in computational commutative algebra, and there is increasing interest in multigraded generalizations. We study connections between two recent definitions of…
This text consists of five relatively systematic notes on Gr\"obner bases and free resolutions of modules over solvable polynomial algebras.
We prove a formula for the degrees of Ikeda and Naruse's $P$-Grothendieck polynomials using combinatorics of shifted tableaux. We show this formula can be used in conjunction with results of Hamaker, Marberg, and Pawlowski to obtain an…
We introduce certain special polynomials in an arbitrary number of indeterminates over a finite field. These polynomials generalize the special polynomials associated to the Goss zeta function and Goss-Dirichlet $L$-functions over the ring…
We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
We examine several of the normal-form multivariate polynomial rootfinding methods of Telen, Mourrain, and Van Barel and some variants of those methods. We analyze the performance of these variants in terms of their asymptotic temporal…
In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the given equation system significantly faster than what is…
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.…