Related papers: Ranks for strongly dependent theories
We characterize all possible independent symmetric alpha-stable (SaS) components of an SaS process, 0<alpha<2. In particular, we focus on stationary SaS processes and their independent stationary SaS components. We also develop a parallel…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Focusing on the bipartite Stable Marriage problem, we investigate different robustness measures related to stable matchings. We analyze the computational complexity of computing them and analyze their behavior in extensive experiments on…
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.…
We define and study semilattices and lattices for $E$-closed families of theories. Properties of these semilattices and lattices are investigated. It is shown that lattices for families of theories with least generating sets are…
We study the problem of linear feature selection when features are highly correlated. Such settings pose two fundamental challenges. First, how should model similarity be defined? Simply counting features in common can be misleading: two…
Research regarding the stable marriage and roommate problem has a long and distinguished history in mathematics, computer science and economics. Stability in this context is predominantly core stability or one of its variants in which each…
In this short note we show that if we add predicate for a dense complete indiscernible sequence in a dependent theory then the result is still dependent. This answers a question of Baldwin and Benedikt and implies that every unstable…
We answer a question from Raghavan and Stepr{\=a}ns' paper on weakly tight families by showing that $\mathfrak{s} = {\mathfrak{s}}_{\omega, \omega}$. Then we use this to construct a completely separable maximal almost disjoint family under…
The stable matching problem has been the subject of intense theoretical and empirical study since the seminal 1962 paper by Gale and Shapley. The number of stable matchings for different systems of preferences has been studied in many…
In this article two models for charges distributions are discussed. On the basis of our consideration we put different points of view for stationary state. We prove that only finite energy model for charges' distribution and well-known…
We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \cite{chambers2017choice} by weakening the path independence assumption. For many-to-many…
Copulas are essential tools in statistics and probability theory, enabling the study of the dependence structure between random variables independently of their marginal distributions. Among the various types of copulas, Ratio-Type Copulas…
The circular external difference family and its strong version, which themselves are of independent combinatorial interest, were proposed as variants of the difference family to construct new unconditionally secure non-malleable threshold…
In this paper we give a first attempt to define and study stable distributions with respect to the weak generalized convolution, focusing our attention on the symmetric weakly stable distribution. As in the case of the classical…
The concept of additive basis has been investigated in the literature for several mathematicians which works with number theorem. Recently, the concept of finitely stable additive basis was introduced. In this note we provide a…
We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…
We consider the problem of extending an acyclic binary relation that is invariant under a given family of transformations into an invariant preference. We show that when a family of transformations is commutative, every acyclic invariant…
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…
We review the known ways of incorporating and breaking symmetries in a renormalizable way. We summarize the various grand unified theories based on $SU_5, SO_{10}$, and $E_6$ as family enlargement groups. An $SU_5$ model with an $SU_2$…