相关论文: Dimer-monomer model on the generalized Tower of Ha…
The number of steps required to exhaust a point set by iteratively removing the vertices of its convex hull is called the layer number of the point set. This article presents a short proof that the layer number of the grid…
Adopting thin film brick-wall model, we calculate the entropy of a nonuniformly rectilinearly accelerating non-stationary black hole expressed by Kinnersley metric. Because the black hole is accelerated, the event horizon is axisymmetric.…
We build a comprehensive methodology for the fast computation of entropy across both solid and liquid phases. The proposed method utilizes a single trajectory of molecular dynamics (MD) to facilitate the calculation of entropy, which is…
Resolving a problem of Conlon, Fox, and R\"{o}dl, we construct a family of hypergraphs with arbitrarily large tower height separation between their $2$-colour and $q$-colour Ramsey numbers. The main lemma underlying this construction is a…
A phenomenological model for the interface between trivial and topological two-dimensional insulators possessing the same band gap is presented. The model depends on three measurable parameters, the energy gap $E_g$, the Fermi velocity of…
In this work, we investigate the Bell-Lavis model using entropic simulations for several values of the energy parameters. The $T\times\mu$ phase diagram and the ground state configurations are analyzed thoroughly. Besides, we examine the…
We study the Anderson lattice model with one f-orbital per lattice site as the simplest model which describes generic features of heavy fermion materials. The resistivity and magnetic susceptibility results obtained within dynamical mean…
The relative entropy in two-dimensional Field Theory is studied for its application as an irreversible quantity under the Renormalization Group, relying on a general monotonicity theorem for that quantity previously established. In the…
We study the entanglement entropy of gapped phases of matter in three spatial dimensions. We focus in particular on size-independent contributions to the entropy across entanglement surfaces of arbitrary topologies. We show that for low…
We study a model of colored multiwebs, which generalizes the dimer model to allow each vertex to be adjacent to \(n_v\) edges. These objects can be formulated as a random tiling of a graph with partial dimer covers. We examine the case of a…
We review the behavior of the entropy per particle in various two-dimensional electronic systems. The entropy per particle is an important characteristic of any many body system that tells how the entropy of the ensemble of electrons…
For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…
Network sampling is an indispensable tool for understanding features of large complex networks where it is practically impossible to search over the entire graph. In this paper, we develop a framework for statistical inference for counting…
In this paper, an estimation of lower bound of topological entropy for coupled-expanding systems associated with transition matrices in compact Hausdorff spaces is given. Estimations of upper and lower bounds of topological entropy for…
We present a computational framework for characterizing the molecular self-organization of cocoa butter (Theobroma cacao) during dark chocolate tempering through the lens of Topological Data Analysis (TDA). A physics-inspired particle…
In [18] we analysed a simple undirected random graph subject to constraints on the total number of edges and the total number of triangles. We considered the dense regime in which the number of edges per vertex is proportional to the number…
Alloying offers a way to tune many of the properties of the transition metal dichalcogenide (TMD) monolayers. While these systems in many cases have been thoroughly investigated previously, the fundamental understanding of critical…
Dimer models are well known as prototypes for locally constrained physics. They describe systems in which every site on a lattice must be attached to one dimer. Loop models are an extension of this idea, with the constraint that two dimers…
We study the problem of detecting local geometry in random graphs. We introduce a model $\mathcal{G}(n, p, d, k)$, where a hidden community of average size $k$ has edges drawn as a random geometric graph on $\mathbb{S}^{d-1}$, while all…
More than a century after its proposal, the Towers of Hanoi puzzle with 4 pegs was solved by Thierry Bousch in a breakthrough paper in 2014. The general problem with p pegs is still open, with the best lower bound on the minimum number of…