Related papers: Dimer-monomer model on the generalized Tower of Ha…

Let $H$ be a $3$-regular $4$-uniform hypergraph on $n$ vertices. The transversal number $\tau(H)$ of $H$ is the minimum number of vertices that intersect every edge. Lai and Chang [J. Combin. Theory Ser. B 50 (1990), 129--133] proved that…

In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and…

We consider a natural Hamiltonian system with two degrees of freedom and Hamiltonian $H=\|p\|^2/2+V(q)$. The configuration space $M$ is a closed surface (for noncompact $M$ certain conditions at infinity are required). It is well known that…

We propose a characterization tool for studies of the band structure of new materials promising for the observation of topological phase transitions. We show that a specific resonant feature in the entropy per electron dependence on the…

We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimera like topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size $2n$,…

We study regularization for the deep linear network (DLN) using the entropy formula introduced in arXiv:2509.09088. The equilibria and gradient flow of the free energy on the Riemannian manifold of end-to-end maps of the DLN are…

We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as a hypothesis testing problem, where under the null…

We investigate the maximum-entropy model $\mathcal{B}_{n,m,p}$ for random $n$-vertex, $m$-edge multi-hypergraphs with expected edge size $pn$. We show that the expected size of the minimization of $\mathcal{B}_{n,m,p}$, i.e., the number of…

The 1D Mueller dipole model, its high energy limit, and its generalization were investigated. To address the ambiguity stemming from different definitions of the pseudorapidity ranges in experimental measurements, we propose the entropy as…

We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…

A central issue of the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate to a -…

Eigenvalues of 1-particle reduced density matrices of $N$-fermion states are upper bounded by $1/N$, resulting in a lower bound on entanglement entropy. We generalize these bounds to all other subspaces defined by Young diagrams in the…

We study the problem of placing a set $T$ of broadcast towers in a simple polygon $P$ in order for any point to locate itself in the interior of $P$. Let $V(p)$ denote the visibility polygon of a point $p$, as the set of all points $q \in…

The generalized Tower of Hanoi problem with h \ge 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n disks from one peg to another. In this paper we study the Path_h variant, where…

It is well-known that if $(A,B)$ is an $\tfrac{\varepsilon}{2}$-regular pair (in the sense of Szemer\'edi) then there exist sets $A'\subset A$ and $B'\subset B'$ with $|A'|\leq \varepsilon|A|$ and $|B'|\leq \varepsilon|B|$ so that the…

Analyzing nodal domains is a way to discern the structure of eigenvectors of operators on a graph. We give a new definition extending the concept of nodal domains to arbitrary signed graphs, and therefore to arbitrary symmetric matrices. We…

For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…

The representation for infinite sum of higher twists (HT) tower in DIS implied by analyticity of virtual Compton amplitude is suggested. Its simplest realization allows to describe the Bjorken sum rule at all momentum transfers. It is…

While Szemer\'edi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may only have regular partitions of tower-type size. It is thus…

In this paper, we mainly elucidate a close relationship between the topological entropy and mean dimension theory for actions of polynomial growth groups. We show that metric mean dimension and mean Hausdorff dimension of subshifts with…