Related papers: On stable and fixed polynomials

Let $G$ be a reductive affine algebraic group, and let $X$ be an affine algebraic $G$-variety. We establish a (poly)stability criterion for points $x\in X$ in terms of intrinsically defined closed subgroups $H_{x}$ of $G$, and relate it…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

We give a proof of the fact that for an FB-module the properties of being "representation stable" (RS) and "having a polynomial character" (PC) are equivalent. We obtain optimal estimates for the gap between the ranks of the polynomiality…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ with the maximal ideal $\frak{m}=(x_1,...,x_n)$. Let $\astab(I)$ and $\dstab(I)$ be the smallest integer $n$ for which $\Ass(I^n)$ and $\depth(I^n)$ stabilize,…

We discuss the higher order stabilization of the coefficients of the colored Jones polynomial. In particular, we find an expression for the second stable sequence of the colored Jones polynomial of a certain class of knots. We also…

We prove an analogue of the Madsen-Weiss theorem for high dimensional manifolds. For example, we explicitly describe the ring of characteristic classes of smooth fibre bundles whose fibres are connected sums of g copies of S^n x S^n, in the…

A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…

We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let $p(x,y)$ be a polynomial of degree $d$ with $N$ positive coefficients and no negative coefficients, such that $p=1$…

In this paper, we compare the index of ass-stability $\text{astab}(I)$ and the index of $\text{v}$-stability $\text{vstab}(I)$ of powers of a graded ideal $I$. We prove that $\text{astab}(I)=1\le\text{vstab}(I)$ for any graded ideal $I$ in…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

We prove that the sequence of MacLane key polynomials constructed in \cite{Mac1} and \cite{Sp2} for a valuation extension $(K,\nu)\subset (K(x),\mu)$ is finite, provided that both $\nu$ and $\mu$ are divisorial and $\mu$ is centered over an…

Let u be a word over the positive integers P. Motivated by a question involving crystal graphs, Sagan and Wilson initiated the study of the centralizer of u in the plactic monoid which is the set C(u) = {w | uw is Knuth equivalent to wu}.…

This is essentially an expository note based on S. Paul's works on the stability of pairs. Its connection to K-stability will be also discussed.

We show that, if a sequence of non-zero polynomials in $\mathbb{Z}[X_1,X_2]$ take small values at translates of a fixed point $(\xi,\eta)$ by multiples of a fixed rational point within the group $\mathbb{C}\times\mathbb{C}^*$, then $\xi$…

We study the relation (and differences) between stability and Property (S) in the simple and stably finite framework. This leads us to characterize stable elements in terms of its support, and study these concepts from different sides :…

A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…

We show that many definitions of stability found in the learning theory literature are equivalent to one another. We distinguish between two families of definitions of stability: distribution-dependent and distribution-independent Bayesian…

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…