Related papers: Minimal limit key polynomials
We extend to the general codimension a lower bound for the essential minimum on abelian varieties found in a previous work, under a conjecture about ordinary primes in abelian varieties. This lower bound is the best expected, ``up to an…
Let $\Gamma$ be a totally ordered group. We use Hahn's embedding theorem to construct a totally ordered set $\Gamma\subset \Gamma_{\operatorname{sme}}$ which classifies small extensions of $\Gamma$. This small-extensions closure…
We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in $\re^m$ defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares…
We study Ehrhart series with coefficients in Abelian group rings. This opens new enumeration applications and unifies earlier variants, in particular, polynomial weighted, $q$-weighted, and equivariant Ehrhart series.
We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.
Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…
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…
We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…
We will calculate completely the Grothendieck rings, in the sense of first order logic, of o-minimal expansions of ordered abelian groups by introducing the notion of the bounded Euler characteristic.
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
The main goal of this paper is to characterize the module of K\"ahler differentials for an extension of valuation rings. More precisely, we consider a simple algebraic valued field extension $(L/K,v)$ and the corresponding valuation rings…
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on…
Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…
We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it…
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…
We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…