Related papers: An information theoretic approach to Sidorenko's c…
In this article we prove that the $KH$-asembly map, as defined by Bartels and L{\"u}ck, can be described in terms of the algebraic $KK$-theory of Cortinas and Thom. The $KK$-theory description of the $KH$-assembly map is similar to that of…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
We attempt to prove the Razumov-Stroganov conjecture using a bijectional approach. We have been unsuccessful but we believe the techniques we present can be used to prove the conjecture.
A solution is given to a conjecture proposed by Y. Wigderson and A. Wigderson concerning a "Heisenberg-like" uncertainty principle. This is an old article already published in 2022.
We propose a generalization of Verbitsky's global Torelli theorem in the framework of compact K\"ahler irreducible holomorphically symplectic orbifolds by adapting Huybrechts' proof (arXiv:1106.5573). As intermediate step needed, we also…
We consider generalizations of Szpiro's classical discriminant conjecture to hyperelliptic curves over a number field $K$, and to smooth, projective and geometrically connected curves $X$ over $K$ of genus at least one. The main results…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
Turbulence theory is usually concerned with the statistical moments of the velocity or its fluctuations. One could also analyze the implicit probability distributions. This is the purview of information theory. Here we use information…
Unexpectedness is a central concept in Simplicity Theory, a theory of cognition relating various inferential processes to the computation of Kolmogorov complexities, rather than probabilities. Its predictive power has been confirmed by…
In this note, we prove a certain hypergraph generalization of the Balog-Szemeredi-Gowers Theorem. Our result shares some features in common with a similar such generalizsation due to Sudakov, Szemeredi and Vu, though the conclusion of our…
In this article we discuss the formal structure of a generalized information theory based on the extension of the probability calculus of Kolmogorov to a (possibly) non-commutative setting. By studying this framework, we argue that quantum…
A keyring is a graph obtained from a cycle by appending $r\ge0$ leaves to one of its vertices. Sidorenko proved an Erd\H{o}s-Gallai-type theorem: Every graph of order $n$ and size more than $\frac{(k-1)n}{2}$ contains a keyring of size at…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We introduce a geometric method to study additive combinatorial problems. Using equivariant cohomology we reprove the Dias da Silva-Hamidoune theorem. We improve a result of Sun on the linear extension of the Erd\H{o}s-Heilbronn conjecture.…
The purpose of this note is to study the bounded isometry conjecture proposed by Lalonde and Polterovich. In particular, we show that the conjecture holds for the Kodaira-Thurston manifold with the standard symplectic form and for the…
The famous Erd\H{o}s-S\'os conjecture states that every graph of average degree more than $t-1$ must contain every tree on $t+1$ vertices. In this paper, we study a spectral version of this conjecture. For $n>k$, let $S_{n,k}$ be the join…
It is well-known that polynomial versions of theorems of R\"odl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erd\H{o}s-Hajnal conjecture. In this note, we prove that these three…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
We consider two recent conjectures of Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship…
We describe Universal Coefficient Theorems for the equivariant Kasparov theory for C*-algebras with an action of the group of integers or over a unique path space, using KK-valued invariants. We compare the resulting classification up to…