Related papers: When entropy meets Tur\'an: new proofs and hypergr…

We study the generalized Tur\'an problem regarding cliques with restricted intersections, which highlights the motivation from extremal set theory. Let $L=\{\ell_1,\dots,\ell_s\}\subset [0,r-1]$ be a fixed integer set with $|L|\notin…

The famous Kepler conjecture has a less spectacular, two-dimensional equivalent: The theorem of Thue states that the densest circle packing in the Euclidean plane has a hexagonal structure. A common proof uses Voronoi cells and analyzes…

Random tensor network states are toy models for holographic duality, which have entanglement properties determined by graph geometry. In this paper, we propose a generalization of the random tensor network states which describe an ensemble…

Let $H_n$ be a $k$-graph on $n$ vertices. For $0 \le \ell <k$ and an $\ell$-subset $T$ of $V(H_n)$, define the degree $\deg(T)$ of $T$ to be the number of $(k-\ell)$-subsets~$S$ such that $S \cup T$ is an edge in~$H_n$. Let the minimum…

Let l>k>2. Let the k-graph H^k_l be obtained from the complete 2-graph K_l^2 by enlarging each edge with a new set of k-2 vertices. Mubayi ["A hypergraph extension of Turan's theorem", to appear in J. Combin. Th. (B)] computed…

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

The notion of group entropy is proposed. It enables to unify and generalize many different definitions of entropy known in the literature, as those of Boltzmann-Gibbs, Tsallis, Abe and Kaniadakis. Other new entropic functionals are…

In this paper, we prove several new Tur\'an density results for 3-graphs with independent neighbourhoods. We show: \pi(K_4^-, C_5, F_{3,2})=12/49, \pi(K_4^-, F_{3,2})=5/18, and \pi(J_4, F_{3,2})=\pi(J_5, F_{3,2})=3/8, where J_t is the…

Adopting a quantum information perspective, we analyse the correlations in the thermal light beams used to demonstrate the Hanbury Brown and Twiss effect. We find that the total correlations measured by the Renyi mutual information match…

Topological entropy serves as a viable candidate for quantifying mixing and complexity of a highly chaotic system. Particularly in turbulence, this is determined as the exponential stretching rate of a fluid material line that typically…

The $r$-expansion of a $k$-uniform hypergraph $H$, denoted by $H^{(+r)}$, is an $r$-uniform hypergraph obtained by enlarging each $k$-edge of $H$ with a set of $r-k$ vertices of degree one. The random Tur\'an number…

An entanglement Renyi entropy for a spatial partition of a system is studied in conformal theories which admit a dual description in terms of an anti-de Sitter gravity. The divergent part of the Renyi entropy is computed in 4D conformal N=4…

We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…

A novel method to determine the density and temperature of a system based on quantum Fermionic fluctuations is generalized to the limit where the reached temperature T is large compared to the Fermi energy {\epsilon}f . Quadrupole and…

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

The Tur\'an number of a $k$-uniform hypergraph $H$, denoted by $e{x_k}\left({n;H} \right)$, is the maximum number of edges in any $k$-uniform hypergraph $F$ on $n$ vertices which does not contain $H$ as a subgraph. Let…

We study the generalized Ramsey--Tur\'an function $\mathrm{RT}(n,K_s,K_t,o(n))$, which is the maximum possible number of copies of $K_s$ in an $n$-vertex $K_t$-free graph with independence number $o(n)$. The case when $s=2$ was settled by…

Reiher, R\"odl, Sales, and Schacht initiated the study of relative Tur\'an densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For an ordered graph $F$, its relative Tur\'an density,…

The thermodynamic uncertainty relations (TURs) provide lower bounds on the entropy production (EP) of a system in terms of the statistical precision of an arbitrary current in that system. All conventional TURs derived so far have concerned…

Turan's theorem implies that every graph of order n with more edges than the r-partite Turan graph contains a complete graph of order r+1. We show that the same premise implies the existence of much larger graphs. We also prove…