中文
相关论文

相关论文: A note on Erd\H{o}s's mysterious remark

200 篇论文

We show that the Poisson centre of truncated maximal parabolic subalgebras of a simple Lie algebra of type B, D and E_6 is a polynomial algebra. In roughly half of the cases the polynomiality of the Poisson centre was already known by a…

表示论 · 数学 2017-11-15 Florence Fauquant-Millet , Polyxeni Lamprou

We prove a lower bound on the number of ordinary conics determined by a finite point set in $\mathbb{R}^2$. An ordinary conic for a subset $S$ of $\mathbb{R}^2$ is a conic that is determined by five points of $S$, and contains no other…

组合数学 · 数学 2016-05-24 Thomas Boys , Claudiu Valculescu , Frank de Zeeuw

We present the subalgebra structure of sl(3,O), a particular real form of e6 chosen for its relevance to particle physics and its close relation to generalized Lorentz groups. We use an explicit representation of the Lie group SL(3,O) to…

环与代数 · 数学 2012-12-14 Aaron Wangberg , Tevian Dray

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

计算几何 · 计算机科学 2010-09-16 Amol Aggarwal

Let $S$ be a finite subset of ${\mathbb R}^2 \setminus (0,0)$. Generally, one would expect the pattern of lines $Ax + By = 1$, where $(A, B) \in S$ to contain polygons of all shapes and sizes. We show, however, that when $S$ is a…

组合数学 · 数学 2023-12-21 Milena Harned , Iris Liebman

Erd\H{o}s conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erd\H{o}s' conjecture in the case that $A$ has…

In 1973, Brown, Erd\H{o}s and S\'os proved that if $\mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $\mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible…

组合数学 · 数学 2020-10-15 Andrey Kupavskii , Alexandr Polyanskii , István Tomon , Dmitriy Zakharov

We prove that every $n$-vertex graph with at least $\binom{n}{2} - (n - 4)$ edges has a fractional triangle decomposition, for $n \ge 7$. This is a key ingredient in our proof, given in a companion paper, that every $n$-vertex $2$-coloured…

组合数学 · 数学 2020-08-17 Vytautas Gruslys , Shoham Letzter

A subset $S$ of the alternating group on $n$ points is {\it intersecting} if for any pair of permutations $\pi,\sigma$ in $S$, there is an element $i\in \{1,\dots,n\}$ such that $\pi(i)=\sigma(i)$. We prove that if $S$ is intersecting, then…

组合数学 · 数学 2013-03-01 Bahman Ahmadi , Karen Meagher

Constructions of regular heptagon and triskaidecagon by trisection of an angle are well known. An elegant construction of the heptagon by S. Adlaj shows a 3-fold symmetry related to a Galois group. Based on the latter construction, in this…

历史与综述 · 数学 2025-07-18 Helmut Ruhland

Assume that R is a semi-local regular ring containing an infinite perfect field, or that R is a semi-local ring of several points on a smooth scheme over an infinite field. Let K be the field of fractions of R. Let H be a strongly inner…

代数几何 · 数学 2009-12-30 I. Panin , V. Petrov , A. Stavrova

Richard Guy asked the following question: can we find a triangle with rational sides, medians, and area? Such a triangle is called a \emph{perfect triangle} and no example has been found to date. It is widely believed that such a triangle…

组合数学 · 数学 2019-10-16 Mehdi Makhul

We determine all non-edge-to-edge tilings of the sphere by regular spherical polygons of three or more sides.

组合数学 · 数学 2021-01-27 Colin Adams , Cameron Edgar , Peter Hollander , Liza Jacoby

We prove that the regular octahedron has the minimal surface area among 3-polytopes of given volume and having at most six vertices.

度量几何 · 数学 2019-01-09 Károly J. Böröczky , Ágnes Kovács

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…

组合数学 · 数学 2026-04-16 Giedrius Alkauskas

The determination of $ES(7)$ is the first open case of the planar Erd\H{o}s--Szekeres problem, where the general conjecture predicts $ES(7)=33$. We present a SAT encoding for the 33-point case based on triple-orientation variables and a…

组合数学 · 数学 2026-01-01 Bogdan Dumitru

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

度量几何 · 数学 2023-11-28 Oliver Roche-Newton , Dmitrii Zhelezov

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

组合数学 · 数学 2025-02-18 Dhruv Mubayi , Jozsef Solymosi

It is well-known that the Euclidean plane has a standard 6-regular geodesic triangulation , and the unit sphere has a 5-regular geodesic triangulation, which is induced from the regular Dodecahedron, and the hyperbolic plane has an…

几何拓扑 · 数学 2022-04-27 Xiaoping Zhu

We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier proofs, by Stephan Hell, relied on…

组合数学 · 数学 2026-04-21 Pablo Soberón