Related papers: Minimal limit key polynomials
We conjecture a formula supported by computations for the valuation of Kac polynomials of a quiver, which only depends on the number of loops at each vertex. We prove a convergence property of renormalized Kac polynomials of quivers when…
We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…
We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…
The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained.…
This article discusses a way for uniquely setting up the valuations for the minimal generators of the maximal ideal of a one dimensional complete reduced and irreducible local algebra over an algebraically closed field, when treated as a…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…
We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
For an infinite Coxeter system, one can extend the weak right order to the set of infinite reduced words. This is called limit weak order. In [Transformation Groups 18(1), 2013, 179-231], Lam and Pylyavskyy showed that for affine Weyl…
Let $ {\mathbf k} $ be a field and $Q\in {\mathbf k}[x_1, \ldots, x_s]$ a form (homogeneous polynomial) of degree $d>1.$ The ${\mathbf k}$-Schmidt rank $rk_{\mathbf k}(Q)$ of $Q$ is the minimal $r$ such that $Q= \sum_{i=1}^r R_iS_i$ with…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…
In this paper we study an extension of the Polynomial Calculus proof system where we can introduce new variables and take a square root. We prove that an instance of the subset-sum principle, the binary value principle, requires refutations…
Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $\alpha$ under certain assumptions on $\alpha$. We prove a theorem which introduces an auxiliary polynomial…
Let $K$ be a field equipped with a discrete valuation $v$. In a pioneering work, S. MacLane determined all valuations on $K(x)$ extending $v$. His work was recently reviewed and generalized by M. Vaqui\'e, by using the graded algebra of a…
We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability,…
Suppose that $(K,v_0)$ is a valued field, $f(x)\in K[x]$ is a monic and irreducible polynomial and $(L,v)$ is an extension of valued fields, where $L=K[x]/(f(x))$. Let $A$ be a local domain with quotient field $K$ dominated by the valuation…