Related papers: Poset Entropy versus Number of Linear Extensions: …
A set $\mathcal{G}$ of planar graphs on the same number $n$ of vertices is called simultaneously embeddable if there exists a set $P$ of $n$ points in the plane such that every graph $G \in \mathcal{G}$ admits a (crossing-free)…
Given a fixed graph $H$, a real number $p\in(0,1)$, and an infinite Erd\H{o}s-R\'enyi graph $G\sim G(\infty,p)$, how many adjacency queries do we have to make to find a copy of $H$ inside $G$ with probability $1/2$? Determining this number…
This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\log_2 n$. This…
This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…
In 1977, Trotter and Moore proved that a poset has dimension at most $3$ whenever its cover graph is a forest, or equivalently, has treewidth at most $1$. On the other hand, a well-known construction of Kelly shows that there are posets of…
Whether a system is to be considered complex or not depends on how one searches for correlations. We propose a general scheme for calculation of entropies in lattice systems that has high flexibility in how correlations are successively…
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…
The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…
Entropy numbers and covering numbers of sets and operators are well known geometric notions, which found many applications in various fields of mathematics, statistics, and computer science. Their values for finite-dimensional embeddings…
We prove an inequality for the entropy numbers in terms of nonlinear Kolmogorov's widths. This inequality is in a spirit of known inequalities of this type and it is adjusted to the form convenient in applications for $m$-term…
We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that…
We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the…
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…
Our main result is designing an algorithm that returns a vertex cover of $\mathcal{G}^\star$ with size at most $(3/2+\epsilon)$ times the expected size of the minimum vertex cover, using only $O(n/\epsilon p)$ non-adaptive queries. This…
Given a poset $P$, a family $F$ of elements in the Boolean lattice is said to be $P$-saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$ contains a copy of $P$ as a subposet. The maximum size of a…
We investigate the behavior of the Gibbs-Shannon entropy of the stationary nonequilibrium measure describing a one-dimensional lattice gas, of L sites, with symmetric exclusion dynamics and in contact with particle reservoirs at different…
This paper addresses the question of the fluctuations of the empirical entropy of a chain of infinite order. We assume that the chain takes values on a finite alphabet and loses memory exponentially fast. We consider two possible…
When inspecting information visualizations under time critical settings, such as emergency response or monitoring the heart rate in a surgery room, the user only has a small amount of time to view the visualization "at a glance". In these…
The quantum Ising chain of length, L, which is separated into two parts by localized or extended defects is considered at the critical point where scaling of the interface magnetization is non-universal. We measure the entanglement entropy…
For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…