相关论文: Monochromatic unit equilateral triangle on low-dim…

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…

We prove that the minimal area of a holomorphic triangle whose boundary lies on the union of any three Lagrangian submanifolds is bounded from above by the Lagrangian spectral norm of any pair taken out of the three. We show a relation…

We estimate the $3$-colour bipartite Ramsey number for balanced bipartite graphs $H$ with small bandwidth and bounded maximum degree. More precisely, we show that the minimum value of $N$ such that in any $3$-edge colouring of $K_{N,N}$…

In the two-dimensional orthogonal colored range counting problem, we preprocess a set, $P$, of $n$ colored points on the plane, such that given an orthogonal query rectangle, the number of distinct colors of the points contained in this…

The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

We establish a new homological lower bound for the Thurston norm on 1-cohomology of 3-manifolds. This generalizes previous results of C. McMullen, S. Harvey, and the author. We also establish an analogous lower bound for 1-cohomology of…

We show that for $m, r \in \mathbb{N}$ and $N > (2m+1)^r (r!)^{1/m}$, every $r$-coloring of the integers in the interval $[N]$ contains a monochromatic solution to the equation \[ x_1 + \dots + \dots x_{m+1} = y_1 + \dots + y_m. \] This…

A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$, every coloring of the plane with finite number of colors contains a monochromatic triangle of area $A$. We consider canonical versions…

Given an edge colouring of a graph with a set of $m$ colours, we say that the graph is (exactly) $m$-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture of Erickson from 1994, showed that for…

Given an equation, the integers $[n] = \{1, 2, \dots, n\}$ as inputs, and the colors red and blue, how can we color $[n]$ in order to minimize the number of monochromatic solutions to the equation, and what is the minimum? The answer is…

Let $G$ be the graph with the points of the unit sphere in $\mathbb{R}^3$ as its vertices, by defining two unit vectors to be adjacent if they are orthogonal as vectors. We present a proof, based on work of Hales and Straus chromatic number…

The concept of bisection of a harmonic oscillator or hydrogen atom, used in the past in establishing the connection between U(3) and O(4), is generalized into multisection (trisection, tetrasection, etc). It is then shown that all…

In this paper, we prove that any closed minimal hypersurface $M^4$ in the $5$-dimensional unit sphere $\mathbb{S}^5$ with constant scalar curvature and constant $3$-th mean curvature must be isoparametric. To be precise, $M^4$ is either an…

For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…

We solve Blaschke's problem for hypersurfaces of dimension $n\geq 3$. Namely, we determine all pairs of Euclidean hypersurfaces $f,\tilde{f}\colon M^n\to\R^{n+1}$ that induce conformal metrics on $M^n$ and envelope a common sphere…

Fix integers $d,r\ge 2$ and suppose that the edge set of the $d$-fold Cartesian product of the $N$-clique $K_N^d$ is $r$-colored. We show that there is a copy of $K_n^d$ whose edges in each direction are monochromatic provided $N > 2^{2^{c…

The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \[ R(k) \leqslant (4 -…

Can we color the $n^3$ cells of an $n\times n\times n$ cube $L$ with $n^2$ colors in such a way that each layer parallel to each face contains each color exactly once and that the coloring is symmetric so that $L_{ij\ell}=L_{j\ell…

We present a faithful geometric picture for genuine tripartite entanglement of discrete, continuous, and hybrid quantum systems. We first find that the triangle relation $\mathcal{E}^\alpha_{i|jk}\leq…