English
Related papers

Related papers: A Profinite Approach to Stable Pairs

200 papers

In this paper we study the existence and regularity of stable manifolds associated to fixed points of parabolic type in the differentiable and analytic cases, using the parametrization method. The parametrization method relies on a suitable…

Dynamical Systems · Mathematics 2016-03-09 Inmaculada Baldomá , Ernest Fontich , Pau Martín

We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the…

Group Theory · Mathematics 2022-04-21 Karsten Henckell , Samuel Herman

We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…

Logic in Computer Science · Computer Science 2015-09-28 Volker Diekert , Florent Martin , Geraud Senizergues , Pedro V. Silva

We study semi-stable degenerations of toric varieties determined by certain partitions of their moment polytopes. Analyzing their defining equations we prove a property of uniqueness.

Algebraic Geometry · Mathematics 2007-12-21 Marina Marchisio , Vittorio Perduca

We prove that if $\pi$ is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are $\pi$-groups. In particular, when $\pi$ is the empty set, we obtain Henckell's decidability of…

Group Theory · Mathematics 2007-06-17 Karsten Henckell , John Rhodes , Benjamin Steinberg

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

Number Theory · Mathematics 2012-06-22 Domingo Gomez-Perez , Alejandro P. Nicolas , Alina Ostafe , Daniel Sadornil

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…

Computer Science and Game Theory · Computer Science 2026-01-19 Naoyuki Kamiyama

We introduce a generalized version of the famous Stable Marriage problem, now based on multi-modal preference lists. The central twist herein is to allow each agent to rank its potentially matching counterparts based on more than one…

Multiagent Systems · Computer Science 2018-01-10 Jiehua Chen , Rolf Niedermeier , Piotr Skowron

We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges and they also have the right to…

Discrete Mathematics · Computer Science 2018-10-02 Ágnes Cseh , Attila Juhos

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.

Functional Analysis · Mathematics 2020-08-26 Pavel Kurasov , Peter Sarnak

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…

Dynamical Systems · Mathematics 2011-06-20 Marianne Akian , Stephane Gaubert , Bas Lemmens

Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.

Group Theory · Mathematics 2010-03-22 Benjamin Steinberg

A polynomial $f(x)$ over a field $K$ is called stable if all of its iterates are irreducible over $K$. In this paper we study the stability of trinomials over finite fields. Specially, we show that if $f(x)$ is a trinomial of even degree…

Number Theory · Mathematics 2018-10-09 Omran Ahmadi , Kosrov Monsef-Shokri

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.…

Computer Science and Game Theory · Computer Science 2024-08-30 Naoyuki Kamiyama

The paper deals with $\Sigma-$composition and $\Sigma$-essential composition of terms, which lead to stable and s-stable varieties of algebras. A full description of all stable varieties of semigroups, commutative and idempotent groupoids…

Rings and Algebras · Mathematics 2014-11-04 Sl. Shtrakov , J. Koppitz

We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization…

Computer Science and Game Theory · Computer Science 2014-07-28 Linda Farczadi , Konstantinos Georgiou , Jochen Könemann

We prove that the class of closed subgroups of free profinite monoids is precisely the class of projective profinite groups. In particular, the profinite groups associated to minimal symbolic dynamical systems by Almeida are projective. Our…

Group Theory · Mathematics 2014-02-26 John Rhodes , Benjamin Steinberg

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…

Representation Theory · Mathematics 2019-03-11 Ana Casimiro , Carlos Florentino

We construct stable periodic solutions for a simple form nonlinear delay differential equation (DDE) with a periodic coefficient. The equation involves one underlying nonlinearity with the multiplicative periodic coefficient. The well-known…

Dynamical Systems · Mathematics 2024-02-14 Anatoli Ivanov , Sergiy Shelyag

A monomial (or equivariant) selfmap of a toric variety is called stable if its action on the Picard group commutes with iteration. Generalizing work of Favre to higher dimensions, we show that under suitable conditions, a monomial map can…

Dynamical Systems · Mathematics 2010-09-20 Mattias Jonsson , Elizabeth Wulcan
‹ Prev 1 2 3 10 Next ›