Related papers: From Kruskal's theorem to Friedman's gap condition
We give an explicit construction of the scaling limit of the minimum spanning tree of the complete graph. The limit object is described using a recursive construction involving the convex minorants of a Brownian motion with parabolic drift…
We consider a family $\{T_N:N \geq 1 \}$ of interval maps as generalizations of the Gauss transformation. For the continued fraction expansion arising from $T_N$, we solve its Gauss-Kuzmin-type problem by applying the theory of random…
We address several related problems on combinatorial discrepancy of trees in a setting introduced by Erd\H{o}s, F\"{u}redi, Loebl and S\'{o}s. Given a fixed tree $T$ on $n$ vertices and an edge-colouring of the complete graph $K_n$, for…
Based on the Newtonian mechanics, in this article, we present a heuristic derivation of the Friedmann equations, providing an intuitive foundation for these fundamental relations in cosmology. Additionally, using the first law of…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
We generalize the celebrated Fr\"{o}berg's theorem to embedded joins of copies of a simplicial complex, namely higher secant complexes to the simplicial complex, in terms of property $N_{q+1,p}$ due to Green and Lazarsfeld. Furthermore, we…
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are…
A nonzero non-Hermitian winding number indicates that a gapped system is in a nontrivial topological class due to the non-Hermiticity of its Hamiltonian. While for Hermitian systems nontrivial topological quantum numbers are reflected by…
The algorithm to calculate the generating function for the number of ``skeleton'' diagrams for the irreducible self-energy and vertex parts is derived for the problems with Gaussian random fields. We find an exact recurrence relation…
In this paper, we prove a gap result for a locally conformally flat complete non-compact Riemannian manifold with bounded non-negative Ricci curvature and a scalar curvature average condition. We show that if it has positive Green function,…
As a model problem for the study of chaotic Hamiltonian systems, we look for the effects of a long-tail distribution of recurrence times on a fixed Hamiltonian dynamics. We follow Stanislavsky's approach of Hamiltonian formalism for…
Our main result, Theorem 2.5, shows the existence of a vast infinity of subset sum problems solvable in polynomial time. The only proof we have of this result uses the ZFC independent Jump Free Theorem of Harvey Friedman, thus putting…
In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
We extend many known results for harmonic maps from the 2-sphere into a Grassmannian to harmonic maps of finite uniton number from an arbitrary Riemann surface. Our method relies on a new theory of nilpotent cycles arising from the diagrams…
This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…
Brehm's extension theorem states that a non-expansive map on a finite subset of a Euclidean space can be extended to a piecewise-linear map on the entire space. In this note, it is verified that the proof of the theorem is constructive…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…