Related papers: A Profinite Approach to Stable Pairs
We classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is finite or satisfies the descending chain condition or satisfies the ascending chain condition. It turns out that for varieties in this…
We give a classification of noncommutative algebraic monoid structures on normal affine varieties such that the group of invertible elements of the monoid is connected, solvable, and has a one-dimensional unipotent radical. We describe the…
In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of…
In this note, we prove that stable equivalences of Morita type between blocks of finite groups induce identification of certain quotient fusion systems under sone assumption. We also collect some related results for separable equivalences.
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…
We study the discrete dynamics of standard (or left) polynomials $f(x)$ over division rings $D$. We define their fixed points to be the points $\lambda \in D$ for which $f^{\circ n}(\lambda)=\lambda$ for any $n \in \mathbb{N}$, where…
A variety of algebras is called Cross if it is finitely based, finitely generated, and has finitely many subvarieties. In present article, we classify all Cross varieties of aperiodic monoids with commuting idempotents.
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…
In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually accepted agents. If any…
We introduce the problem of adapting a stable matching to forced and forbidden pairs. Specifically, given a stable matching $M_1$, a set $Q$ of forced pairs, and a set $P$ of forbidden pairs, we want to find a stable matching that includes…
A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. A monoid is aperiodic if all its subgroups are trivial. We classify all limit varieties of aperiodic monoids with…
A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…
A super-stable matching, which was introduced by Irving, is a solution concept in a variant of the stable matching problem in which the preferences may contain ties. Irving proposed a polynomial-time algorithm for the problem of finding a…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
The Deligne-Mumford stable reduction theorem asserts that for a family of stable curves over the punctured disk, after a finite base change, the family can be completed in a unique way to a family of stable curves over the disk. In this…
Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…
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…
We construct a moduli space of stable projective pairs with a nontrivial action of a connected reductive group. These stable reductive pairs are higher-dimensional analogs of stable n-pointed curves and generalize to the non-commutative…