Related papers: Remarks on Fixed Point Assertions in Digital Topol…
This paper is a complement of our recent works on the semilinear Tricomi equations in [8] and[9].
Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. We investigate this question from the perspective of network…
We study effective potentials coming from compactifications of string theory. We show that, under mild assumptions, such potentials are bounded from below in four dimensions, giving an affirmative answer to a conjecture proposed by the…
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Network Capability in Localizing Node Failures via End-to-end Path Measurements" by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin…
The past decade has seen a substantial rise in the amount of mis- and disinformation online, from targeted disinformation campaigns to influence politics, to the unintentional spreading of misinformation about public health. This…
In this work, new equivalences of topological statements and weaker axioms than ${\bf AC}$ are proven. This equivalences include the use of anti-properties. All this equivalences have been checked with a computer using the theorem proving…
New fixed point results are presented for ${\cal U}_c^{\kappa}(X,X)$ maps in extension type spaces.
v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition…
Corrigendum : An inverse problem in corrosion detection:stability estimates, J. Inv. Ill-posed Problems 12 (4) (2004), 349-367.
This is an erratum to the article: "Computation of maximal projection constants" (J. Funct. Anal., 277). The statement of Lemma 3.1(2) of that paper is incorrect. As a consequence of this the proof of Theorem 1.4 is incomplete. In this…
Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong…
Scientific claim verification against tables typically requires predicting whether a claim is supported or refuted given a table. However, we argue that predicting the final label alone is insufficient: it reveals little about the model's…
This is an update on, and expansion of, our paper Open problems on $\beta\omega$ in the book Open Problems in Topology.
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also…
Over the past decade, the high performance computing community has become increasingly concerned that preserving the reliable, digital machine model will become too costly or infeasible. In this paper we discuss four approaches for…
The translation is not verbatim, many parts have been abbreviated and in some case alternative proofs were devised emphasizing intuition.
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
Traditional fact checking by expert journalists cannot keep up with the enormous volume of information that is now generated online. Computational fact checking may significantly enhance our ability to evaluate the veracity of dubious…
The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…
AI-driven outcomes can be challenging for end-users to understand. Explanations can address two key questions: "Why this outcome?" (factual) and "Why not another?" (counterfactual). While substantial efforts have been made to formalize…