Related papers: On stable and fixed polynomials
Grunewald, Mennicke and Vaserstein proved that the Bass stable rank of $\mathbb{Z}[x]$, the ring of the univariate polynomials over $\mathbb{Z}$, is $3$. This note addresses minor errors found in their proof. Using their method, we show in…
We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural…
Given a polynomial $p$ with no zeros in the polydisk, or equivalently the poly-upper half-plane, we study the problem of determining the ideal of polynomials $q$ with the property that the rational function $q/p$ is bounded near a boundary…
Explicit examples of {\bf positive} crystalline measures and Fourier quasicrystals are constructed using pairs of stable of polynomials, answering several open questions in the area.
A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…
Let $\nu$ be a valuation of arbitrary rank on the polynomial ring $K[x]$ with coefficients in a field $K$. We prove comparison theorems between MacLane-Vaqui\'e key polynomials for valuations $\mu\le\nu$ and abstract key polynomials for…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
In this paper we establish the relation between key polynomials (as defined in \cite{SopivNova}) and minimal pairs of definition of a valuation. We also discuss truncations of valuations on a polynomial ring $K[x]$. We prove that a…
In this survey we determine an explicit set of generators of the maximal ideals in the ring $\mathbb R[x_1,\dots,x_n]$ of polynomials in $n$ variables with real coefficients and give an easy analytic proof of the Bass-Vasershtein theorem on…
We study stable matching problems where agents have multilayer preferences: There are $\ell$ layers each consisting of one preference relation for each agent. Recently, Chen et al. [EC '18] studied such problems with strict preferences,…
Let $\iota:K\hookrightarrow L\cong K(x)$ be a simple transcendental extension of valued fields, where $K$ is equipped with a valuation $\nu$ of rank 1. That is, we assume given a rank 1 valuation $\nu$ of $K$ and its extension $\nu'$ to…
We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is…
We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are also described for the pseudovariety of all finite monoids.
In this paper we study the truncation $\nu_q$ of a valuation $\nu$ on a polynomial $q$. It is known that when $q$ is a key polynomial, then $\nu_q$ is a valuation. It is also known that the converse does not hold. We show that when $q$ is a…
Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…
We prove that if K is an infinite stable field whose generic type has weight 1 then K is separably closed. We also obtain partial results when the generic of K has finite weight and when K is strongly stable.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
In a stable matching problem there are two groups of agents, with agents on one side having their individual preferences for agents on another side as a potential match. It is assumed silently that agents can freely and costlessly ``switch"…