Related papers: An information theoretic approach to Sidorenko's c…
An odd-dimensional version of the Goldberg conjecture was formulated and proved by Boyer and Galicki, using an orbifold analogue of Sekigawa's formulas, and an approximation argument of K-contact structures with quasi-regular ones. We…
We provide a criterion for a point satisfying the required disjointness condition in Sarnak's M\"obius Disjointness Conjecture. As a direct application, we have that the conjecture holds for any topological model of an ergodic system with…
The study of graph discrepancy problems, initiated by Erd\H{o}s in the 1960s, has received renewed attention in recent years. In general, given a $2$-edge-coloured graph $G$, one is interested in embedding a copy of a graph $H$ in $G$ with…
By using random multilinear maps, we provide new lower bounds for the Erd\H{o}s box problem, the problem of estimating the extremal number of the complete $d$-partite $d$-uniform hypergraph with two vertices in each part, thereby improving…
This expository survey is based on my online talk at the ICCM 2020. It aims to sketch key steps of the recent proof of the uniform Mordell-Lang conjecture for curves embedded into Jacobians (a question of Mazur). The full version of this…
The Odd Hadwiger's conjecture, formulated by Gerards and Seymour in 1995, is a substantial strengthening of Hadwiger's famous coloring conjecture from 1943. We investigate whether the hierarchy of topological lower bounds on the chromatic…
In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…
In information theory, one major goal is to find useful functions that summarize the amount of information contained in the interaction of several random variables. Specifically, one can ask how the classical Shannon entropy, mutual…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
Many of the strengthenings and extensions of the topological Tverberg theorem can be derived with surprising ease directly from the original theorem: For this we introduce a proof technique that combines a concept of "Tverberg unavoidable…
The Kneser conjecture (1955) was proved by Lov\'asz (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions.…
It is known that in the case of hyperelliptic curves the Shafarevich conjecture can be made effective, i.e., for any number field k and any finite set of places S of k, one can effectively compute the set of isomorphism classes of…
In this article we study a coarse version of the K-theoretic Farrell-Jones conjecture we call coarse or bounded isomorphism conjecture. With techniques that have already been used to prove the Farrell-Jones conjecture for hyperbolic groups…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
We show that very general hypersurfaces in odd-dimensional simplicial projective toric varieties verifying a certain combinatorial property satisfy the Hodge conjecture (these include projective spaces). This gives a connection between the…
Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…
In this paper, we first review one of difficult parts of the proof of Witten's conjecture by Kontsevich that had not been emphasized before. In the derivation of the KdV equations, we review the boson-fermion correspondence method \cite{K}…
We study the Toda conjecture of Eguchi and Yang for the Gromov-Witten invariants of CP^1,using the bihamiltonian method of the formal calculus of variations. We also study its relationship to the Virasoro conjecture for CP^1, recently…
We apply here methods of inhomogeneous random graphs to a class of random distance graphs. This provides an example outside of the rank 1 models which is still solvable as long as the largest connected component is concerned. In particular,…
We find the formula for the maximal cardinality of the family of $n$-tuples from ${[n]\choose k}$ with does not have $\ell$--matching. This formula after some analytical issues can be reduce to the Erd\"os's Matching formula. Also we prove…