Related papers: On Martin's Pointed Tree Theorem
We extend a study by Lempp and Hirst of infinite versions of some problems from finite complexity theory, using an intuitionistic version of reverse mathematics and techniques of Weihrauch analysis.
Doust and Weston introduced a new method called "enhanced negative type" for calculating a non trivial lower bound p(T) on the supremal strict p-negative type of any given finite metric tree (T,d). In the context of finite metric trees any…
We present the weighted weak group inverse, which is a new generalized inverse of operators between two Hilbert spaces, introduced to extend weak group inverse for square matrices. Some characterizations and representations of the weighted…
This article surveys the known results (and not very well-known results) associated with Cantor's pairing function and the Rosenberg-Strong pairing function, including their inverses, their generalizations to higher dimensions, and a…
The main objective of this paper is to introduce unique representations and characterizations for the weighted core inverse of matrices. We also investigate various properties of these inverses and their relationships with other generalized…
We discuss various recent advances on weak forms of the Twin Prime Conjecture.
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
In this paper, we introduce the notation of $E$-weighted core-EP and $F$-weighted dual core-EP inverse of matrices. We then obtain a few explicit expressions for the weighted core-EP inverse of matrices through other generalized inverses.…
There is a one-to-one correspondence between natural numbers and rooted trees; the number is called the Matula number of the rooted tree. We show how a large number of properties of trees can be obtained directly from the corresponding…
In this paper planar STIT tesselations with weighted axis-parallel cutting directions are considered. They are known also as weighted planar Mondrian tesselations in the machine learning literature, where they are used in random forest…
Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants…
We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…
This paper presents an approach for the development of a number theoretic discrete Hilbert transform. The forward transformation has been applied by taking the odd reciprocals that occur in the DHT matrix with respect to a power of 2.…
Among other results, the paper gives new mapping theorems and new fixed point property theorems for inverse limits of inverse sequences of compact metric spaces with upper semicontinuous set-valued bonding functions. We also revisit the…
We study a general class of quasilinear elliptic equations with nonstandard growth to prove the existence of a very weak solution to such a problem. A key ingredient in the proof is a priori global weighted gradient estimate of a very weak…
It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge…
In this paper, we study a new discrete tree and the resulting branching process, which we call the \textbf{E}rlang \textbf{W}eighted \textbf{T}ree(\textbf{EWT}). The EWT appears as the local weak limit of a random graph model proposed…
We study consequences of stationary and semi-stationary set reflection. We show that the semi stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of weak square principle, etc. We also consider two cardinal…