Related papers: Minimal limit key polynomials

Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other…

Let $(K, \nu)$ be a valued field, the notions of \emph{augmented valuation}, of \emph{limit augmented valuation} and of \emph{admissible family} of valuations enable to give a description of any valuation $\mu$ of $K [x]$ extending $\nu$.…

Association rules express implication formed relations among attributes in databases of itemsets. The apriori algorithm is presented, the basis for most association rule mining algorithms. It works by pruning away rules that need not be…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

In this paper, we find bounds for the eigenvalues of matrix polynomials. In particular, we find generalizations of Cauchy's classical Theorem for distribution of eigenvalues of matrix polynomial.

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…

We develop a theory of Jacobi polynomials for parabolic subgroups of finite reflection groups that specializes to the cases studied by Heckman and Opdam in which the whole group and the trivial group are considered. For the intermediate…

This work investigates the invariance of the non-necessarily finite uniform dimension and related concepts for subextensions in skew polynomial rings \mbox{$ \mathbb{S}=R[ \mathbf{\mathrm{X}}; \mathbf{\alpha} , \mathbf{\delta} ]$} of…

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

We show how $\ell$-ifications, which are companion forms of matrix polynomials, namely, lower order matrix polynomials with the same eigenvalues as a given complex square matrix polynomial, can be used in combination with other recent…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

A well-known problem in the theory of polynomials over finite fields is the characterization of minimal value set polynomials (MVSPs) over the finite field $\mathbb{F}_q$, where $q = p^n$. These are the nonconstant polynomials $F \in…

We investigate distality and existence of distal expansions in valued fields and related structures. In particular, we characterize distality in a large class of ordered abelian groups, provide an AKE-style characterization for henselian…

We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields.

We study the limiting zero distribution of orthogonal polynomials with respect to some particular exponential weights exp(-nV(z)) along contours in the complex plane. We are especially interested in the question under which circumstances…

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower bounds on the volumes of flow and transportation polytopes.…