中文
相关论文

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

200 篇论文

Let us consider the set $\Omega (\triangle ABC)$ of all tetrahedra $ABCD$ with a given non-degenerate base $ABC$ in $\mathbb{E}^3$ and $D$ lying outside the plane $ABC$. Let us denote by $\Sigma(\triangle ABC)$ the set $\left\{\Bigl(\cos…

度量几何 · 数学 2026-03-09 E. V. Nikitenko , Yu. G. Nikonorov

We prove that for each odd integer $k \geq 7$, every graph on $n$ vertices without odd cycles of length less than $k$ contains at most $(n/k)^k$ cycles of length $k$. This generalizes the previous results on the maximum number of pentagons…

组合数学 · 数学 2021-09-07 Andrzej Grzesik , Bartłomiej Kielak

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

组合数学 · 数学 2023-06-06 Yixi Liao , Erxiao Wang

The tetrahedron equation in a special substitution is reduced to a pair of pentagon and one ten-term equations. Various examples of solutions are found. $O$-doubles of Novikov, which generalize the Heisenberg double of a Hopf algebra,…

q-alg · 数学 2008-02-03 R. M. Kashaev , S. M. Sergeev

A set $S$ of natural numbers is multiplicative Sidon if the products of all pairs in $S$ are distinct. Erd\H{o}s in 1938 studied the maximum size of a multiplicative Sidon subset of $\{1,\ldots, n\}$, which was later determined up to the…

数论 · 数学 2018-08-21 Hong Liu , Péter Pál Pach

Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show…

组合数学 · 数学 2010-07-15 Steve Butler , Ron Graham

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

组合数学 · 数学 2017-01-04 Rom Pinchasi , Yuri Rabinovich

It is easy to find a right-angled triangle with integer sides whose area is 6. There is no such triangle with area 5, but there is one with rational sides (a `\emph{Pythagorean triangle}'). For historical reasons, integers such as 6 or 5…

数论 · 数学 2007-12-27 Alf van der Poorten

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

计算几何 · 计算机科学 2021-08-17 Sarah Carmesin , André Schulz

The well-known Erd\H{o}s-Hajnal conjecture states that for any graph $F$, there exists $\epsilon>0$ such that every $n$-vertex graph $G$ that contains no induced copy of $F$ has a homogeneous set of size at least $n^{\epsilon}$. We consider…

组合数学 · 数学 2023-03-20 Maria Axenovich , Dhruv Mubayi , Lea Weber

We show there is a class of symplectic Lie algebra representations over any field of characteristic not 2 or 3 that have many of the exceptional algebraic and geometric properties of both symmetric three forms in two dimensions and…

表示论 · 数学 2012-10-23 Marcus J. Slupinski , Robert J. Stanton

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

度量几何 · 数学 2017-06-22 Simeon Ball

We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any…

度量几何 · 数学 2016-04-21 Omer Angel , Itai Benjamini , Nizan Horesh

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

计算几何 · 计算机科学 2022-10-04 Ruy Fabila-Monroy , Carlos Hidalgo-Toscano , Daniel Perz , Birgit Vogtenhuber

Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…

The permutohedron $P_n$ of order $n$ is a polytope embedded in $\mathbb{R}^n$ whose vertex coordinates are permutations of the first $n$ natural numbers. It is obvious that $P_n$ lies on the hyperplane $H_n$ consisting of points whose…

组合数学 · 数学 2026-04-10 Bochao Kong , Ji Zeng

Erd\H{o}s and Rothschild asked to estimate the maximum number, denoted by H(N,C), such that every N-vertex graph with at least CN^2 edges, each of which is contained in at least one triangle, must contain an edge that is in at least H(N,C)…

组合数学 · 数学 2011-06-07 Jacob Fox , Po-Shen Loh

Given a central simple algebra with involution over an arbitrary field, \'etale subalgebras contained in the space of symmetric elements are investigated. The method emphasizes the similarities between the various types of involutions and…

K理论与同调 · 数学 2017-10-20 Karim Johannes Becher , Nicolas Grenier-Boley , Jean-Pierre Tignol

The classification work [5], [9] left unsettled only those anomalous isoparametric hypersurfaces with four principal curvatures and multiplicity pair $\{4,5\},\{6,9\}$ or $\{7,8\}$ in the sphere. By systematically exploring the ideal theory…

微分几何 · 数学 2011-05-23 Quo-Shin Chi

A theorem of Erdos asserts that every infinite subset of Euclidean n-space R^n has a subset of the same cardinality having no repeated distances. This theorem is generalized here as follows: If (R^n,E) is an algebraic hypergraph that does…

逻辑 · 数学 2017-12-01 James H. Schmerl