English
Related papers

Related papers: A note on stable Kim-forking

200 papers

Assume that a projective variety together with a polarization is uniformly K-stable. If the polarization is canonical or anti-canonical, then the projective variety is uniformly K-stable with respects to any polarization sufficiently close…

Algebraic Geometry · Mathematics 2017-09-26 Kento Fujita

This paper discusses generalized weak rigidity theory, and aims to apply the theory to formation control problems with a gradient flow law. The generalized weak rigidity theory is utilized in order that desired formations are characterized…

Systems and Control · Computer Science 2020-04-28 Seong-Ho Kwon , Hyo-Sung Ahn

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.

Logic · Mathematics 2009-10-01 Krzysztof Krupinski , Anand Pillay

It is well-known that peakons in the Camassa-Holm equation are $H^1$-orbitally stable thanks to the presence of conserved quantities and properties of peakons as constrained energy minimizers. By using the method of characteristics, we…

Analysis of PDEs · Mathematics 2019-03-26 Fabio Natali , Dmitry E. Pelinovsky

We discuss two constructions for obtaining generically stable Keisler measures in an NIP theory. First, we show how to symmetrize an arbitrary invariant measure to obtain a generically stable one from it. Next, we show that suitable…

Logic · Mathematics 2012-08-14 Pierre Simon

We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $N$- length signals with known frequency support of size $k$. A typical algorithm, in this case, would involve solving…

Signal Processing · Electrical Eng. & Systems 2024-12-03 Charantej Reddy Pochimireddy , Aditya Siripuram , Brad Osgood

We study the stability of certain spectra under some algebraic conditions weaker than the commutativity and we generalize many known commutative perturbation results.

Functional Analysis · Mathematics 2022-07-19 Zakariae Aznay , Abdelmalek Ouahab , Hassan Zariouh

This paper is dedicated to the surjective stability of the $K_1$-functor for Chevalley groups for the embedding $D_5$ into $E_6$. This case was already studed by Plotkin. In the present paper, we improve his result by showing that…

Group Theory · Mathematics 2021-07-01 Pavel Gvozdevsky

We construct stable envelopes in equivariant elliptic cohomology of Nakajima quiver varieties. In particular, this gives an elliptic generalization of the results of arXiv:1211.1287. We apply them to the computation of the monodromy of…

Algebraic Geometry · Mathematics 2020-03-12 Mina Aganagic , Andrei Okounkov

Spekkens has introduced a toy theory [Phys. Rev. A, 75, 032110 (2007)] in order to argue for an epistemic view of quantum states. I describe a notation for the theory (excluding certain joint measurements) which makes its similarities and…

Quantum Physics · Physics 2012-03-30 Matthew F. Pusey

The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…

Optimization and Control · Mathematics 2017-07-31 Mohamadreza Ahmadi , Hamed Mojallali , Rafael Wisniewski

We survey various approaches to axiomatic stable homotopy theory, with examples including derived categories, categories of (possibly equivariant or localized) spectra, and stable categories of modular representations of finite groups. We…

Algebraic Topology · Mathematics 2007-05-23 N. P. Strickland

In this paper, by introducing a wider class of one-parameter group actions for test configurations, we have a stronger form of the definition of K-stability. This allows us to obtain some key step of my preceding work in proving that…

Differential Geometry · Mathematics 2009-10-27 Toshiki Mabuchi

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

Let K be the function field of a connected regular scheme S of dimension 1, and let f : X -> Y be a finite cover of projective smooth and geometrically connected curves over K with g(X) greater or equal to 2. Suppose that f can be extended…

Algebraic Geometry · Mathematics 2016-09-29 Qing Liu

Weakly stable torsion classes were introduced by the author and Yekutieli to provide a torsion theoretic characterisation of the notion of weak proregularity from commutative algebra. In this paper we investigate weakly stable torsion…

Rings and Algebras · Mathematics 2018-08-09 Rishi Vyas

We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original…

Logic in Computer Science · Computer Science 2013-01-09 Joohyung Lee , Yunsong Meng

Let $\nu$ be a rank one valuation on $K[x]$ and $\Psi_n$ the set of key polynomials for $\nu$ of degree $n\in\N$. We discuss the concepts of being $\Psi_n$-stable and $(\Psi_n,Q)$-fixed. We discuss when these two concepts coincide. We use…

Commutative Algebra · Mathematics 2022-03-02 J Novacoski , M. Spivakovsky

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…

Computational Complexity · Computer Science 2009-06-18 Yonatan Bilu , Nathan Linial