相关论文: The largest projective cube-free subsets of $\math…

We prove the Berenstein-Zelevinsky conjecture that the quantized coordinate rings of the double Bruhat cells of all finite dimensional simple algebraic groups admit quantum cluster algebra structures with initial seeds as specified by [4].…

The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a…

The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…

We prove that for $d\geq 0$ and $k\geq 2$, for any subset $A$ of a discrete cube $\{0,1\}^d$, the $k-$higher energy of $A$ (the number of $2k-$tuples $(a_1,a_2,\dots,a_{2k})$ in $A^{2k}$ with $a_1-a_2=a_3-a_4=\dots=a_{2k-1}-a_{2k}$) is at…

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

For integers $0 \leq m \leq l \leq n-m$, the truncated Boolean lattice ${\cal B}_n(m,l)$ is the poset of all subsets of $[n] = \{1, 2, \ldots, n\}$ which have size at least $m$ and at most $l$. ${\cal C} \subseteq {\cal B}_n(m,l)$ is a {\em…

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

We determine the largest subset $A\subseteq \{1,\dotsc,n\}$ such that for all $a,b\in A$, the product $ab$ is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers. This resolves a…

Let $Q_d$ be the $d$-dimensional Hamming cube and $N=|V(Q_d)|=2^d$. An independent set $I$ in $Q_d$ is called balanced if $I$ contains the same number of even and odd vertices. We show that the logarithm of the number of balanced…

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

The twin-width of a graph $G$ is the minimum integer $d$ such that $G$ has a $d$-contraction sequence, that is, a sequence of $|V(G)|-1$ iterated vertex identifications for which the overall maximum number of red edges incident to a single…

The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…

We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…

We show that the perfect Euler brick (perfect cuboid) problem is equivalent to the following elementary question: do there exist coprime integers $a, b, m, n$ such that the two expressions $(2(a^2-b^2)mn)^2 + ((a^2+b^2)(m^2-n^2))^2$ and…

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

Given $d\in\mathbb{N}$, let $\alpha(d)$ be the largest real number such that every abstract simplicial complex $\mathcal{S}$ with $0<\vert\mathcal{S}\vert\leq\alpha(d)\vert V(\mathcal{S})\vert$ has a vertex of degree at most $d$. We extend…

Starting out from a question posed by T. Erd\'elyi and J. Szabados, we consider Schur-type inequalities for the classes of complex algebraic polynomials having no zeroes within the unit disk D. The class of polynomials with no zeroes in D -…

We prove that the maximum size of a family of $k$-element subsets of the set $[n] = \{1, 2, \ldots, n\}$ which contains no singleton intersection is $\binom{n-2}{k-2}$ when $3k-3 \le n \le k^2-k+1$. This improves upon a recent result of…

We prove blow-up structure theorems for graphs excluding a tree or an apex-tree as a minor. First, we show that for every $t$-vertex tree $T$ with $t\geq 3$ and radius $h$, and every graph $G$ excluding $T$ as a minor, there exists a graph…

We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…