Related papers: Stability of Quadratic Modules
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…
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.…
While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is known to be unstable in a certain precise sense. Until now, it has not…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
A numerical integrator for $\dot{x}=f(x)$ is called \emph{stable} if, when applied to the 1D Dahlquist test equation $\dot{x}=\lambda x,\lambda\in\mathbb{C}$ with fixed timestep $h>0$, the numerical solution remains bounded as the number of…
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…
Coherence, the superposition of orthogonal quantum states, is indispensable in various quantum processes. Inspired by the polynomial invariant for classifying and quantifying entanglement, we first define polynomial coherence measure and…
Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…
We introduce a new type of recurrence in the space of continuous and bounded functions. The property is easily verifiable, and can be considered for differential equations. This time, the existence and asymptotic stability of modulo…
Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called…
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…
Sum of Squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems but several questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector…
This paper studies the feedback stabilization of abstract Cauchy problems with unbounded output operators by finite-dimensional controllers. Both necessary conditions and sufficient conditions for feedback stabilizability are presented. The…
In 1977, Makanin established the decidability of equations in free monoids. A key ingredient in his proof is the exponent of periodicity: for a word $w$, it is the largest exponent $e$ such that $w$ contains a nonempty factor of the form…
Given a quadratic module, we construct its universal C*-algebra, and then use methods and notions from the theory of C*-algebras to study the quadratic module. We define residually finite-dimensional quadratic modules, and characterize them…
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 this paper we introduce the notion of the stability of a sequence of modules over Hecke algebras. We prove that a finitely generated consistent sequence associated with Hecke algebras is representation stable.
We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…
A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…
In this paper, we prove several stability theorems for multiplicities of naturally defined representations of symmetric groups. The first such theorem states that if we consider the diagonal action of the symmetric group $S_{m+r}$ on $k$…