Related papers: The Consistency Correctness in CoPPar Tree
This document contains a description of several of my papers, including remarks on history and connection with subsequent work. It also contains some new results and conjectures.
The purpose of the paper is to present an short proof of the Chuang's inequality.
Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time solution for Cartesian tree matching, which is based on the KMP…
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that…
This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literature.
In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…
Mining for trees in a graph is shown to be NP-complete.
This paper is a contribution to understanding what properties should a topological algebra on a Stone space satisfy to be profinite. We reformulate and simplify proofs for some known properties using syntactic congruences. We also clarify…
In this paper, we introduce cone normed linear space, study the cone convergence with respect to cone norm. Finally, we prove the completeness of a finite dimensional cone normed linear space.
We have developed a web-based pedagogical proof assistant, the Proof Tree Builder, that lets you apply rules upwards from the initial goal in sequent calculus and Hoare logic for a simple imperative language. We equipped our tool with a…
In this paper, as a result of a theorem of Serre on congruence properties, a complete solution is given for an open question (see the text) presented recently by Kim, Koo and Park. Some further questions and results on similar types of…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
This is the first of two papers establishing structural properties of ${\cal R}_2$.
We prove two congruences for the coefficients of power series expansions in t of modular forms where t is a modular function. As a result, we settle two recent conjectures of Chan, Cooper and Sica. Additionally, we provide a table of…
The tree is an essential data structure in many applications. In a distributed application, such as a distributed file system, the tree is replicated.To improve performance and availability, different clients should be able to update their…
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…
This note presents a summary and review of various conditions and characterizations for matrix stability (in particular diagonal matrix stability) and matrix stabilizability.
Coordination is an important and common syntactic construction which is not handled well by state of the art parsers. Coordinations in the Penn Treebank are missing internal structure in many cases, do not include explicit marking of the…
In that paper, we prove that the composition of two roofs is another roof by using mapping cone of a morphism of cochain complexes.
Syntax has been shown to benefit Coreference Resolution from incorporating long-range dependencies and structured information captured by syntax trees, either in traditional statistical machine learning based systems or recently proposed…