Related papers: Dimer-monomer model on the generalized Tower of Ha…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…
We prove that, for all $k \ge 3,$ and any integers $\Delta, n$ with $n \ge \Delta,$ there exists a $k$-uniform hypergraph on $n$ vertices with maximum degree at most $\Delta$ whose $4$-color Ramsey number is at least $\mathrm{tw}_k(c_k…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
We give a closed-form solution of von Neumann entropy as a function of geometric phase modulated by visibility and average distinguishability in Hilbert spaces of two and three dimensions. We show that the same type of dependence also…
Page's seminal result on the average von Neumann (VN) entropy does not immediately apply to realistic many-body systems which are restricted to physically relevant smaller subspaces. We investigate here the VN entropy averaged over the pure…
In this work, we investigate the classical loop models doped with monomers and dimers on a square lattice, whose partition function can be expressed as a tensor network (TN). In the thermodynamic limit, we use the boundary matrix product…
We study the ground state degeneracy per site (exponent of the ground state entropy) $W(\Lambda,(L_x=\infty) \times L_y,q)$ for the $q$-state Potts antiferromagnet on infinitely long strips with width $L_y$ of 2D lattices $\Lambda$ with…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
We introduce and study a new four-peg variant of the Tower of Hanoi problem under parity constraints. Two pegs are neutral and allow arbitrary disc placements, while the remaining two pegs are restricted to discs of a prescribed parity: one…
Let $G$ be the group $\mathbb{Z}^d$ or the monoid $\mathbb{N}^d$ where $d$ is a positive integer. Let $X$ be a subshift over $G$, i.e., a closed and shift-invariant subset of $A^G$ where $A$ is a finite alphabet. We prove that the…
The Tower of Hanoi continues to provide a surprisingly rich meeting point for recursive reasoning, combinatorial geometry, and computational verification. Motivated by the editorial standards of the Bulletin of the Australian Mathematical…
In this thesis, we provide an initial investigation into bounds for topological entropy of switched linear systems. Entropy measures, roughly, the information needed to describe the behavior of a system with finite precision on finite time…
The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…
We prove the exact formulae for the expected number of moves to solve several variants of the Tower of Hanoi puzzle with 3 pegs and n disks, when each move is chosen uniformly randomly from the set of all valid moves. We further present an…
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the…
We explore the information theory entropy of a graph as a scalar to quantify the cosmic web. We find entropy values in the range between 1.5 and 3.2 bits. We argue that this entropy can be used as a discrete analogue of scalars used to…
We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…
Among the normalized metrics on a graph, we show the existence and the uniqueness of an entropy-minimizing metric, and give explicit formulas for the minimal volume entropy and the metric realizing it.
The von Neumann entropy of a density matrix of dimension d, expressed in terms of the first d-1 integer order R\'enyi entropies, is monotonically increasing in R\'enyi entropies of even order and decreasing in those of odd order.