中文
相关论文

相关论文: On distinct cross-ratios and related growth proble…

200 篇论文

The cross-ratio degree problem counts configurations of n points on P^1 with n-3 prescribed cross-ratios. Cross-ratio degrees arise in many corners of combinatorics and geometry, but their structure is not well-understood in general.…

代数几何 · 数学 2024-08-06 Rob Silversmith

We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $\Omega (n^2)$. We also consider the following variant of this problem: given a convex set $A$, what…

组合数学 · 数学 2023-09-15 Krishnendu Bhowmick , Ben Lund , Oliver Roche-Newton

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

综合数学 · 数学 2015-04-03 N. A. Carella

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

组合数学 · 数学 2017-04-05 Brendan Murphy , Oliver Roche-Newton , Ilya Shkredov

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

组合数学 · 数学 2016-03-18 Roland Bacher

Given a simple Lie group $H$ of real rank at least $2$ we show that the maximum cardinality of a set of isospectral non-isometric $H$-locally symmetric spaces of volume at most $x$ grows at least as fast as $x^{c\log x/ (\log\log x)^2}$…

微分几何 · 数学 2017-12-13 Mikhail Belolipetsky , Benjamin Linowitz

We consider an infinite graph G whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of [n] any pair of which differ…

组合数学 · 数学 2007-12-11 János Körner , Gábor Simonyi , Blerina Sinaimeri

We develop the theory of the additive dimension ${\rm dim} (A)$, i.e. the size of a maximal dissociated subset of a set $A$. It was shown that the additive dimension is closely connected with the growth of higher sumsets $nA$ of our set…

组合数学 · 数学 2022-05-17 Ilya D. Shkredov

Let $\eta_{g}(n) $ be the smallest cardinality that $A\subseteq {\mathbb Z}$ can have if $A$ is a $g$-difference basis for $[n]$ (i.e, if, for each $x\in [n]$, there are {\em at least} $g$ solutions to $a_{1}-a_{2}=x$ ). We prove that the…

组合数学 · 数学 2025-01-22 Eric Schmutz , Michael Tait

It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

群论 · 数学 2016-06-16 Roland Bacher , Pierre De La Harpe

Let $A\subseteq \mathbb{Z}_p^2$ be a set of size $2p+1$ for prime $p\geq 5$. In this paper, we prove that $A\hat{+}A=\{a_1+a_2\mid a_1,a_2\in A, a_1\neq a_2\}$ has cardinality at least $4p$. This result is the first advancement in over two…

组合数学 · 数学 2026-02-10 Jacinda Terkel

A graph with vertex set V and edge set E is called a (d,c)-expander if the maximum degree of a vertex is d and, for every subset W of V that has cardinality at most |V|/2, the number of edges between vertices in W and vertices outside of W…

组合数学 · 数学 2007-05-23 Lars Engebretsen

Let $F$ be a field of characteristic $p>2$ and $A\subset F$ have sufficiently small cardinality in terms of $p$. We improve the state of the art of a variety of sum-product type inequalities. In particular, we prove that $$ |AA|^2|A+A|^3…

组合数学 · 数学 2015-12-22 Esen Aksoy Yazici , Brendan Murphy , Misha Rudnev , Ilya Shkredov

Revisiting a $50$-year-old estimate of Choi, Erd\H{o}s and Szemer\'edi, we show that if $A \subseteq \{1, 2, \ldots, 2n\}$ satisfies $|A| \ge n + 1.2 \cdot 10^8$, then there exist five distinct integers whose pairwise sums are all contained…

数论 · 数学 2026-05-04 Wouter van Doorn

A partition is finitary if all its blocks are finite. For a cardinal $\mathfrak{a}$ and a natural number $n$, let $\mathrm{fin}(\mathfrak{a})$ and $\mathscr{B}_{n}(\mathfrak{a})$ be the cardinalities of the set of finite subsets and the set…

逻辑 · 数学 2024-11-12 Yifan Hu , Guozhen Shen

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

泛函分析 · 数学 2019-10-03 Colin C. Graham

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…

综合数学 · 数学 2009-04-15 Slavko Rede

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F…

组合数学 · 数学 2014-01-28 Doowon Koh , Youngjin Pi

A dominating set of a graph $G$ is a set of vertices $D$ such that for all $v \in V(G)$, either $v \in D$ or $(v,d) \in E(G)$ for some $d \in D$. The cardinality redundance of a vertex set $S$, $CR(S)$, is the number of vertices in $V(G)$…

组合数学 · 数学 2019-06-10 Daniel McGinnis , Nathan Shank

Cross-ratio degrees count configurations of points $z_1,\ldots, z_n \in \mathbb{P}^1$ satisfying $n - 3$ cross-ratio constraints, up to isomorphism. These numbers arise in multiple contexts in algebraic and tropical geometry, and may be…

代数几何 · 数学 2021-08-10 Rob Silversmith