A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set

IF 1 2区数学 Q1 MATHEMATICS

Combinatorica Pub Date : 2025-03-07 DOI:10.1007/s00493-025-00135-5

Oliver Roche-Newton

引用次数: 0

Abstract

We prove that, for any \(B \subset {\mathbb {R}}\), the Cartesian product set \(B \times B\) determines \(\Omega (|B|^{2+c})\) distinct angles.

查看原文本刊更多论文

由笛卡尔积集确定的钉住角数的下界

我们证明了，对于任意\(B \subset {\mathbb {R}}\)，笛卡尔积集\(B \times B\)决定了\(\Omega (|B|^{2+c})\)不同的角度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Combinatorica 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.