Related papers: A Relative Dependency Pair Framework
Information entropy and its extension, which are important generalization of entropy, have been applied in many research domains today. In this paper, a novel generalized relative entropy is constructed to avoid some defects of traditional…
Relative algebroids provide a framework that unifies Lie algebroids with partial differential equations. In this set of notes, we explain how relative algebroids arise from geometric problems, and give an introduction to their structural…
A new DRP scheme is built, which enables us to minimize the error due to the finite difference approximation, by means of an equivalent matrix equation.
In this brief note we critically examine the process of partial and of total differentiation, showing some of the problems that arise when we relate both concepts. A way to solve all the problems is proposed.
The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…
The aim of this paper is to define a dependency grammar framework which is both linguistically motivated and computationally parsable. See the demo at http://www.conexor.fi/analysers.html#testing
In this paper we generalize a key result relating singular limits of certain relative entropies with index in the setting of conformal nets, which has played an important role recently in the mathematical theory of relative entropies in the…
In the literature there are two different notions of lovely pairs of a theory T, according to whether T is simple or geometric. We introduce a notion of lovely pairs for an independence relation, which generalizes both the simple and the…
We develop a new framework of relative algebroids to address existence and classification problems of geometric structures subject to partial differential equations.
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…
Started from local universal isotropic disentanglement, a threshold inequality on reduction factors is proposed, which is necessary and sufficient for this type of disentanglement processes. Furthermore, we give the conditions realizing…
In this paper we discuss a framework for the polynomial approximation to the solution of initial value problems for differential equations. The framework, initially devised for the approximation of ordinary differential equations, is…
We consider a family of classical elliptic integrable systems including (relativistic) tops and their matrix extensions of different types. These models can be obtained from the "off-shell" Lax pairs, which do not satisfy the Lax equations…
Dependency pairs constitute a series of very effective techniques for the termination analysis of term rewriting systems. In this paper, we adapt the static dependency pair framework to logically constrained simply-typed term rewriting…
We provide a suitable axiomatic framework for differential cohomology in the relative case and we deduce the corresponding long exact sequences. We also construct the relative version of the generalized Cheeger-Simons characters and we…
This paper proposes a new setup for studying pairs of structures. This new framework includes many of the previously studied classes of pairs, such as dense pairs of o-minimal structures, lovely pairs, fields with Mann groups, and…
We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically,…
The search for new integrable (3+1)-dimensional partial differential systems is among the most important challenges in the modern integrability theory. It turns out that such a system can be associated to any pair of rational functions of…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
We present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the…