Related papers: Power diagrams and Morse Theory
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
Coordinate scaling of each spin density separately is considered in spin density functional theory. A virial theorem relates the spin-scaled correlation energy to the spin-scaled correlation potentials. An adiabatic connection formula…
The purpose of this work is to develop a version of Forman's discrete Morse theory for simplicial complexes, based on internal strong collapses. Classical discrete Morse theory can be viewed as a generalization of Whitehead's collapses,…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
We study reduced density matrices of the integrable critical RSOS model in a particular topological sector containing the ground state. Similar as in the spin-$1/2$ Heisenberg model it has been observed that correlation functions of this…
Based on the Carath\'eodory -Pesin structure theory[11], we introduce three notions of topological pressure of a proper map and provide some properties of these notions. For the proper map of a locally compact separable metric space, we…
In 2010, Joyce et. al defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to the degrees of all it neighbors. We…
These lecture notes are a friendly introduction to monopole Floer homology. We discuss the relevant differential geometry and Morse theory involved in the definition. After developing the relation with the four-dimensional theory, our…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…
We study the divided power structures over a product of operads with distributive law. We give a systematic method to characterise the divided power algebras over such a product from the structures of divided power algebra coming from each…
We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms $T_0$ and…
This paper introduces and develops M\"obius homology, a homology theory for representations of finite posets into abelian categories. Although the connection between poset topology and M\"obius functions is classical, we go further by…
Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with…
We study the effects caused by Rashba and Dresselhaus spin-orbit coupling over the thermoelectric transport properties of a single-electron transistor, viz., a quantum dot connected to one-dimensional leads. Using linear response theory and…
When calculating higher terms of the epsilon-expansion of massive Feynman diagrams, one needs to evaluate particular cases of multiple inverse binomial sums. These sums are related to the derivatives of certain hypergeometric functions with…
According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…
In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a…
Let $n>1$ be an integer, and let $T$ be a tree with $n+1$ vertices $v_1,\ldots,v_{n+1}$, where $v_1$ and $v_{n+1}$ are two leaves of $T$. For each edge $e$ of $T$, assign a complex number $w(e)$ as its weight. We obtain that…
Tessellations are an important tool to model the microstructure of cellular and polycrystalline materials. Classical tessellation models include the Voronoi diagram and Laguerre tessellation whose cells are polyhedra. Due to the convexity…