Related papers: An information theoretic approach to Sidorenko's c…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
The extension of an $r$-uniform hypergraph $G$ is obtained from it by adding for every pair of vertices of $G$, which is not covered by an edge in $G$, an extra edge containing this pair and $r-2$ new vertices. Keevash and Sidorenko~ have…
In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…
This is a Bourbaki's seminar text. We introduce the combinatorial Kashiwara-Vergne conjecture on the Baker-Campbell-Hausdorff serie. After recalling previous results and consequences, we explain the Alekseev-Meinrenken's proof…
The invariant response was defined from a formulation of the fluctuation-response theorem in the space of probability distributions. An inequality is here conjectured which sets the mutual information as an upper bound to the invariant…
The use of algorithmic information theory (Kolmogorov complexity theory) to explain the relation between mathematical probability theory and `real world' is discussed.
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…
The 1-2-3 Conjecture, posed by Karo\'{n}ski, {\L}uczak and Thomason, asked whether every connected graph $G$ different from $K_2$ can be 3-edge-weighted so that every two adjacent vertices of $G$ get distinct sums of incident weights. The…
Commutative $d$-torsion $K$-theory is a variant of topological $K$-theory constructed from commuting unitary matrices of order dividing $d$. Such matrices appear as solutions of linear constraint systems that play a role in the study of…
Shannon based his information theory on the notion of probability measures as it we developed by Kolmogorov. In this paper we study some fundamental problems in information theory based on expectation measures. In the theory of expectation…
We define and compare two bivariant generalizations of the topological $K$-group $K^\top(G)$ for a topological group $G$. We consider the Baum-Connes conjecture in this context and study its relation to the usual Baum-Connes conjecture.
This article presents a theoretical investigation of generalized encoded forms of networks in a uniform multidimensional space. First, we study encoded networks with (finite) arbitrary node dimensions (or aspects), such as time instants or…
This survey is mostly concerned with unstable analogues of the Lichtenbaum-Quillen Conjecture. The Lichtenbaum-Quillen Conjecture (now implied by the Voevodsky-Rost Theorem) attempts to describe the algebraic K-theory of rings of integers…
We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then…
In this paper we consider Erd\"os-Mordell inequality and its extension in the plane of triangle to the Erd\"os-Mordell curve. Algebraic equation of this curve is derived, and using modern computer tools in mathematics, we verified one…
For a general family of graphs on $\mathbb{Z}^n$, we translate the edge-isoperimetric problem into a continuous isoperimetric problem in $\mathbb{R}^n$. We then solve the continuous isoperimetric problem using the Brunn-Minkowski inequality…
The celebrated Erd\H{o}s-Ko-Rado theorem shows that for $n \ge 2k$ the largest intersecting $k$-uniform set family on $[n]$ has size $\binom{n-1}{k-1}$. It is natural to ask how far from intersecting larger set families must be. Katona,…
We prove a generalisation of the Khukhro--Makarenko theorem on large characteristic subgroups with laws. This general fact implies new results on groups, algebras, and even graphs and other structures. Concerning groups, we obtain, e.g., a…
Semigraphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group. We resolve two problems on…