Related papers: When entropy meets Tur\'an: new proofs and hypergr…
There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Tur\'an function, the minimum codegree threshold and the…
The uniform Tur\'an density $\pi_{1}(F)$ of a $3$-uniform hypergraph $F$ is the supremum over all $d$ for which there is an $F$-free hypergraph with the property that every linearly sized subhypergraph with density at least $d$. Determining…
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We introduce the algebraic entropy for endomorphisms of arbitrary abelian groups, appropriately modifying existing notions of entropy. The basic properties of the algebraic entropy are given, as well as various examples. The main result of…
Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…
We first show how a new definition of entropy, which is intuitively very simple, as a divergence in cluster-size space, leads to a generalized form that is nonextensive for correlated units, but coincides exactly with the conventional one…
The \textit{generalized Tur\'an number} $\mathrm{ex}(n, T, F)$ is the maximum possible number of copies of $T$ in an $F$-free graph on $n$ vertices for any two graphs $T$ and $F$. For the book graph $B_t$, there is a close connection…
We discuss some recent results on black hole thermodynamics within the context of effective gravitational actions including higher-curvature interactions. Wald's derivation of the First Law demonstrates that black hole entropy can always be…
Given $\alpha>0$ and an integer $\ell\geq5$, we prove that every sufficiently large $3$-uniform hypergraph $H$ on $n$ vertices in which every two vertices are contained in at least $\alpha n$ edges contains a copy of $C_\ell^{-}$, a tight…
We prove convergence of the multi-body correlation function as a power series in the density. We work in the context of the cluster expansion in the canonical ensemble and we obtain bounds uniform in the volume and the number of particles.…
Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…
We address an idea of applying generalized entropies in counting problems. First, we consider some entropic properties that are essential for such purposes. Using the $\alpha$-entropies of Tsallis-Havrda-Charv\'{a}t type, we derive several…
In [1] it is shown that recurrent neural networks (RNNs) can learn - in a metric entropy optimal manner - discrete time, linear time-invariant (LTI) systems. This is effected by comparing the number of bits needed to encode the…
Recent calculations have shown that the linear proportionality between black hole entropy and area can be explained by performing a density matrix calculation for a massless free field theory. By applying the same formalism to an empirical…
The $3$-uniform tight $\ell$-cycle $C_\ell^{3}$ is the $3$-graph on $\{1,\dots,\ell\}$ consisting of all $\ell$ consecutive triples in the cyclic order. Let $\mathcal{C}$ be either the pair $\{C_{4}^{3}, C_{5}^{3}\}$ or the single tight…
Motivated by analogies with basic density theorems in analytic number theory, we introduce a notion (and variations) of the homological density of one space in another. We use Weil's number field/ function field analogy to predict…
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…
We study Poincar\'e recurrence from a purely geometrical viewpoint. We prove that the metric entropy is given by the exponential growth rate of return times to dynamical balls. This is the geometrical counterpart of Ornstein-Weiss theorem.…
We investigate the role of convexity in R\'enyi entropy power inequalities. After proving that a general R\'enyi entropy power inequality in the style of Bobkov-Chistyakov (2015) fails when the R\'enyi parameter $r\in(0,1)$, we show that…