Related papers: An information theoretic approach to Sidorenko's c…

We consider a generalization of an important class of high-dimensional inference problems, namely spiked symmetric matrix models, often used as probabilistic models for principal component analysis. Such paradigmatic models have recently…

First, we shall formulate and prove Theorem of Lie-Kolchin type for a cone and derive some algebro-geometric consequences. Next, inspired by a recent result of Dinh and Sibony we pose a conjecture of Tits type for a group of automorphisms…

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…

We introduce \emph{Information Topology}: a framework that unifies information theory and algebraic topology by treating \emph{cycle closure} as the primitive operation of inference. The starting point is the \emph{dot-cycle dichotomy},…

Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his famous Erd\H{o}s-Menger conjecture (now known as the Aharoni-Berger theorem) that extends Menger's theorem to infinite graphs in a…

In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…

We introduce some generalized topological concepts to deal with union-closed families, and show that one can reduce the proof of Frankl's conjecture to some families of so-called supratopological spaces. We prove some results on the…

We relate the Andrews-Curtis conjecture to the triviality problem for balanced presentations of groups using algorithms from 3-manifold topology. Implementing this algorithm could lead to counterexamples to the Andrews-Curtis conjecture.

Information theory is a mathematical theory of learning with deep connections with topics as diverse as artificial intelligence, statistical physics, and biological evolution. Many primers on information theory paint a broad picture with…

We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…

Comparing networks is essential for a number of downstream tasks, from clustering to anomaly detection. Despite higher-order interactions being critical for understanding the dynamics of complex systems, traditional approaches for network…

The purpose of this note is to wish a happy birthday to Professor Lucia Caporaso.* We prove that Conjecture H of Caporaso et. al. ([CHarM], sec. 6) together with Lang's conjecture implies the uniformity of rational points on varieties of…

This is a survey on the Farrell-Jones Conjecture about the algebraic K- and L-theory of groups rings and its applications to algebra, geometry, group theory, and topology.

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares and has been the focus of extensive research ever since. Many…

Some families of graphs, such as the n-cubes and Sierpinski gaskets, are self-similar. In this paper we show how such recursive structure can be used systematically to prove isoperimetric theorems.

We show that a $k$-uniform hypergraph on $n$ vertices has a spanning subgraph homeomorphic to the $(k - 1)$-dimensional sphere provided that $H$ has no isolated vertices and each set of $k - 1$ vertices supported by an edge is contained in…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…

An overview of last seven years results concerning Sarnak's conjecture on M\"obius disjointness is presented, focusing on ergodic theory aspects of the conjecture.