Related papers: The Consistency Correctness in CoPPar Tree
This paper builds fundamental perfect fields of positive characteristic and shows the structure of perfect fields that a field of positive characteristic is a perfect field if and only if it is an algebraic extension of a fundamental…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
In this paper we prove the correctness of Dijkstra's algorithm. We also discuss it and at the end we show an application.
The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the first part, we give a simple algorithm for constructing an optimal…
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete…
This is a technical report accompanying the paper "All Principal Congruence Link Groups" (arXiv:1802.01275) classifying all principal congruence link complements in S^3 by the same authors. It provides a complete overview of all cases (d,I)…
In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider…
We study various types of consistency of honest decision trees and random forests in the regression setting. In contrast to related literature, our proofs are elementary and follow the classical arguments used for smoothing methods. Under…
We prove that the complement of a $\sigma$-compact subset of a topological space that has a $\pi$-tree also has a $\pi$-tree. To do this, we construct the foliage hybrid operation, which deals with foliage trees (that is, set-theoretic…
In this paper we deal with verification of safety properties of parameterized systems with a tree topology. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which…
In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…
We prove a stability theorem for spaces of smooth concordance embeddings. From it we derive various applications to spaces of concordance diffeomorphisms and homeomorphisms.
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data structure without any synchronization. As a result, however, these algorithms are…
We fill in a gap in the proof of the main theorem in our earlier paper [Ol]. At the same time, we prove a slightly stronger version of the theorem needed for another paper.
We introduce and study a new kind of congruent number problem on the right trapezoid.
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
We provide a fundamental result for bucket increasing trees, which gives a complete characterization of all families of bucket increasing trees that can be generated by a tree evolution process. We also provide several equivalent…
The textbook proofs of Commoner's theorem characterizing liveness in free-choice Petri nets are given in contexts of technical notions and claims that make the proofs look a bit long. The aim of this note is to give a concise self-contained…