Search
Search Results
-
-
On the Set of Stable Matchings in a Bipartite Graph
AbstractThe topic of stable matchings (marriages) in bipartite graphs gained popularity beginning from the appearance of the classical Gale and...
-
Stable set rings which are Gorenstein on the punctured spectrum
The non-Gorenstein locus of stable set rings of finite simple perfect graphs is studied. We describe combinatorially those perfect graphs whose...
-
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
The infinite time reachable set of a strictly stable linear control system is the Hausdorff limit of the finite time reachable set of the origin as...
-
One-Parameter Set of Diffeormorphisms of the Plane with Stable Periodic Points
AbstractIn this paper we consider two-dimensional diffeomorphisms with hyperbolic fixed points and nontransverse homoclinic points. It is assumed...
-
Asymptotically Stable Random Walks Killed Upon Hitting a Finite Set
This section is concerned with the potential function for the r.w. S killed upon hitting a finite set. For its description, we do not need (AS). The...
-
Stable Klingen Vectors
Let F be a nonarchimedean local field of characteristic zero, and let...
-
Stable and Unstable Foliations
In this chapter we construct an unstable foliation building on the construction of unstable invariant manifolds for any sufficiently small...
-
Review of the Theory of Stable Matchings and Contract Systems
AbstractA review of works devoted to the theory of stable matchings or, more generally, of stable networks of contracts is given. A set (network) of...
-
Set theoretical pathologies in the problem of Lyapunov stability of singular points of vector fields
We prove that Lyapunov stability problem demonstrates pathologies even on the set-theoretical level. Namely, there exists an analytic one-parameter...
-
Stable Maps and Logarithmic Stable Maps
We summarize the discussion of tropical compactification
-
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Let G be an n -node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC’17) for bimodular integer programs...
-
Persistency of linear programming relaxations for the stable set problem
The Nemhauser–Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also...
-
Optimization of the Reachable Set of a Linear System with Respect to Another Set
AbstractGiven a linear controlled autonomous system, we consider the problem of including a convex compact set in the reachable set of the system in...
-
On the Length of Switching Intervals of a Stable Dynamical System
AbstractA linear switching system is a system of linear ODEs with time-dependent matrix taking values in a given control matrix set. The system is...
-
Correction to: Layered Networks, Equilibrium Dynamics, and Stable Coalitions
An important aspect of network dynamics that has been missing from our understanding of network dynamics in various applied settings is the influence...
-
Subdivided Claws and the Clique-Stable Set Separation Property
Let \( {\mathscr{C}} \) be a class of graphs...
-
Is Kyle’s equilibrium model stable?
In the dynamic discrete-time trading setting of Kyle (Econometrica 53:1315–1336, 1985), we prove that Kyle’s equilibrium model is stable when there...
-
Analysis of Pseudoholomorphic Curves and Bordered Stable Maps
In this chapter, we review the basic analytic theory of pseudoholomorphic curves, and the study of compactified moduli space of pseudoholomorphic...