Related papers: Structural Components Dominate Asymptotic Behavior…

Let $\mathcal {T}^{\Delta}_n$ denote the set of trees of order $n$, in which the degree of each vertex is bounded by some integer $\Delta$. Suppose that every tree in $\mathcal {T}^{\Delta}_n$ is equally likely. For any given subtree $H$,…

Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary…

Let $G$ be a simple graph. A pendant path of $G$ is a path such that one of its end vertices has degree $1$, the other end has degree $\ge3$, and all the internal vertices have degree $2$. Let $p_k(G)$ be the number of pendant paths of…

Qualitative methods such as the linear sampling method and the factorization method reconstruct acoustic scatterers through sampling indicators. In practice, these indicators are gray-scale fields on a prescribed sampling window and a…

In this work, we introduce and study what we believe is an intriguing and, to the best of our knowledge, previously unknown connection between two areas in computational topology, topological data analysis (TDA) and knot theory. Given a…

We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors…

We develop a topological lens on relational schema design by encoding functional dependencies (FDs) as simplices of an abstract simplicial complex. This dependency complex exposes multi-attribute interactions and enables homological…

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$. The \emph{semitotal domination number}, $\gamma_{t2}(G)$, is the…

In this paper we first apply the chain level Floer theory to the study of Hofer's geometry of Hamiltonian diffeomorphism group in the cases without quantum contribution: we prove that any quasi-autonomous Hamiltonian path on weakly exact…

For a tree $T$, let $i_T(t)$ be the number of independent sets of size $t$ in $T$. It is an open question, raised by Alavi, Malde, Schwenk and Erd\H{o}s, whether the sequence $(i_T(t))_{t \geq 0}$ is always unimodal. Here we answer the…

Featuring exotic quantum transport and surface states, topological semimetals can be classified into nodal-point, nodal-line, and nodal-surface semimetals according to the degeneracy and dimensionality of their nodes. However, a topological…

We introduce so-called "single-index copulae". They are semi-parametric conditional copulae whose parameter is an unknown "link" function of a univariate index only. We provide estimates of this link function and of the finite dimensional…

The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets…

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thi\'ery and the second author. A…

These lecture notes explain the classification of some simple fermionic topological phases of matter in a pedestrian manner, with an aim to be maximally pedagogical = doing things in excruciating detail. We focus on a many-body perspective,…

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

The study of graphs associated with of various algebraic structures is an emerging topic in algebraic graph theory. Recently, the concept of nonzero component graph of a finite dimensional vector space $\Gamma(\mathbb{V})$ was put forward…

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…