相关论文: Potential isomorphism and semi-proper trees
Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subclasses of trees, we prove the conjecture's validity for a new…
As an extension of positive or almost positive diagrams and links, we introduce a notion of successively almost positive diagrams and links, and good successively almost positive diagrams and links. We review various properties of positive…
This paper contributes to a programme initiated by the first author: `How much information about a graph is revealed in its Potts partition function?'. We show that the $W$-polynomial distinguishes non-isomorphic weighted trees of a…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
We show that it is consistent, relative to $\omega$ many supercompact cardinals, that the super tree property holds at $\aleph_n$ for all $2 \leq n < \omega$ but there are weak square and a very good scale at $\aleph_{\omega}$.
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…
While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…
Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…
Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…
We consider the features of multiparticle tree cross sections in scalar theories in the framework of a semiclassical approach. These cross sections at large multiplicities have exponential form, and the properties of the exponent in…
This is my PhD Thesis, part of it has published in Acta Mathematica Sinica. In this paper, a class of morphisms which have a kind of singularity weaker than normal crossing is considered. We construct the obstruction such that the so-called…
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
A half-tree is an edge configuration whose superimposition with a perfect matching is a tree. In this paper, we prove a half-tree theorem for the Pfaffian principal minors of a skew-symmetric matrix whose column sum is zero; introducing an…
We study extremal properties of finite ultrametric spaces $X$ and related properties of representing trees $T_X$. The notion of weak similarity for such spaces is introduced and related morphisms of labeled rooted trees are found. It is…
To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to $N$-multicomplexes. We present a family of model category structures on the…
Assuming the existence of a strong cardinal $\kappa$, a weakly compact cardinal $\lambda$ above it and $\gamma > \lambda,$ we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any given cofinality $\delta$,…
The inner model problem for supercompact cardinals, one of the central open problems in modern set theory, asks whether there is a canonical model of set theory with a supercompact cardinal. The problem is closely related to the more…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…