Related papers: Stably computable relations and predicates
Conformal prediction is a powerful tool to generate uncertainty sets with guaranteed coverage using any predictive model, under the assumption that the training and test data are i.i.d.. Recently, it has been shown that adversarial examples…
Motivated by data on coauthorships in scientific publications, we analyze a team formation process that generalizes matching models and network formation models, allowing for overlapping teams of heterogeneous size. We apply different…
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…
In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their…
We study many-to-one matching problems between institutions and individuals, where each institution may be matched to multiple individuals. The matching market includes couples, who view pairs of institutions as complementary. Institutions'…
Modular and well-written software is an ideal that programmers strive to achieve. However, real-world project constraints limit the amount of reusable and modular code that programmers can produce. Many techniques exist that refactor code…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
The stability radius for finitely many interconnected linear exponentially stable well-posed systems with respect to static perturbations is studied. If the output space of each system is finite-dimensional, then a lower bound for the…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
We study the stability and synchronization of predator-prey populations subjected to noise. The system is described by patches of local populations coupled by migration and predation over a neighborhood. When a single patch is considered,…
When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…
We prove the following results: let x,y be (n,n) complex matrices such that x,y,xy have no eigenvalue in ]-infinity,0] and log(xy)=log(x)+log(y). If n=2, or if n>2 and x,y are simultaneously triangularizable, then x,y commute. In both cases…
This work examines approaches to making computational models reversible. Broadly speaking, transforming a computational model into a reversible one, i.e. reversibilizing it, means extending its operational semantics conservatively in a way…
We consider the problem of tracking an unstable stochastic process $X_t$ by using causal knowledge of another stochastic process $Y_t$. We obtain necessary conditions and sufficient conditions for maintaining a finite tracking error. We…
Compacta X and Y are said to admit a stable intersection in R^n if there are maps f : X -> R^n and g : Y -> R^n such that for every sufficiently close continuous approximations f' : X -> R^n and g' : Y -> R^n of f and g we have f'(X)\cap…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
Suppose we can choose from a set of linear autonomous systems with bounded process noise, the dynamics of each system are unknown, and we would like to design a stabilizing policy. The underlying question is how to estimate the dynamics of…
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In particular, we focus on strong stability, which is one of the…
We introduce a fairly general concept of functional equation for $k$-tuples of functions $f_1,\dots,f_k\colon X \to Y$ between arbitrary sets. The homomorphy equations for mappings between groups and other algebraic systems, as well as…