skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on December 17, 2025

Title: Vector space ramsey numbers and weakly Sidorenko affine configurations
ABSTRACT For $$B \subseteq \mathbb F_q^m$$, the nth affine extremal number of B is the maximum cardinality of a set $$A \subseteq \mathbb F_q^n$$ with no subset, which is affinely isomorphic to B. Furstenberg and Katznelson proved that for any $$B \subseteq \mathbb F_q^m$$, the nth affine extremal number of B is $o(q^n)$ as $$n \to \infty$$. By counting affine homomorphisms between subsets of $$\mathbb F_q^n$$, we derive new bounds and give new proofs of some previously known bounds for certain affine extremal numbers. At the same time, we establish corresponding supersaturation results. We connect these bounds to certain Ramsey-type numbers in vector spaces over finite fields. For $$s,t \geq 1$$, let $$R_q(s,t)$$ denote the minimum n such that in every red–blue coloring of the one-dimensional subspaces of $$\mathbb F_q^n$$, there is either a red s-dimensional subspace or a blue t-dimensional subspace of $$\mathbb F_q^n$$. The existence of these numbers is a special case of a well-known theorem of Graham, Leeb and Rothschild. We improve the best-known upper bounds on $$R_2(2,t)$$, $$R_3(2,t)$$, $$R_2(t,t)$$ and $$R_3(t,t)$$.  more » « less
Award ID(s):
2247013
PAR ID:
10633698
Author(s) / Creator(s):
;
Publisher / Repository:
NA
Date Published:
Journal Name:
The Quarterly Journal of Mathematics
Volume:
76
Issue:
1
ISSN:
0033-5606
Page Range / eLocation ID:
77 to 94
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Megow, Nicole; Smith, Adam (Ed.)
    We provide new approximation algorithms for the Red-Blue Set Cover and Circuit Minimum Monotone Satisfying Assignment (MMSA) problems. Our algorithm for Red-Blue Set Cover achieves Õ(m^{1/3})-approximation improving on the Õ(m^{1/2})-approximation due to Elkin and Peleg (where m is the number of sets). Our approximation algorithm for MMSA_t (for circuits of depth t) gives an Õ(N^{1-δ}) approximation for δ = 1/3 2^{3-⌈t/2⌉}, where N is the number of gates and variables. No non-trivial approximation algorithms for MMSA_t with t ≥ 4 were previously known. We complement these results with lower bounds for these problems: For Red-Blue Set Cover, we provide a nearly approximation preserving reduction from Min k-Union that gives an Ω(m^{1/4 - ε}) hardness under the Dense-vs-Random conjecture, while for MMSA we sketch a proof that an SDP relaxation strengthened by Sherali-Adams has an integrality gap of N^{1-ε} where ε → 0 as the circuit depth t → ∞. 
    more » « less
  2. Classically, an indecomposable class $$R$$ in the cone of effective curves on a K3 surface $$X$$ is representable by a smooth rational curve if and only if $$R^{2}=-2$$ . We prove a higher-dimensional generalization conjectured by Hassett and Tschinkel: for a holomorphic symplectic variety $$M$$ deformation equivalent to a Hilbert scheme of $$n$$ points on a K3 surface, an extremal curve class $$R\in H_{2}(M,\mathbb{Z})$$ in the Mori cone is the line in a Lagrangian $$n$$ -plane $$\mathbb{P}^{n}\subset M$$ if and only if certain intersection-theoretic criteria are met. In particular, any such class satisfies $$(R,R)=-\frac{n+3}{2}$$ , and the primitive such classes are all contained in a single monodromy orbit. 
    more » « less
  3. Abstract The tower number $${\mathfrak t}$$ and the ultrafilter number $$\mathfrak {u}$$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of $$\omega $$ and the almost inclusion relation $$\subseteq ^*$$ between such subsets. We consider analogs of these cardinal characteristics in computability theory. We say that a sequence $$(G_n)_{n \in {\mathbb N}}$$ of computable sets is a tower if $$G_0 = {\mathbb N}$$ , $$G_{n+1} \subseteq ^* G_n$$ , and $$G_n\smallsetminus G_{n+1}$$ is infinite for each n . A tower is maximal if there is no infinite computable set contained in all $$G_n$$ . A tower $${\left \langle {G_n}\right \rangle }_{n\in \omega }$$ is an ultrafilter base if for each computable R , there is n such that $$G_n \subseteq ^* R$$ or $$G_n \subseteq ^* \overline R$$ ; this property implies maximality of the tower. A sequence $$(G_n)_{n \in {\mathbb N}}$$ of sets can be encoded as the “columns” of a set $$G\subseteq \mathbb N$$ . Our analogs of $${\mathfrak t}$$ and $${\mathfrak u}$$ are the mass problems of sets encoding maximal towers, and of sets encoding towers that are ultrafilter bases, respectively. The relative position of a cardinal characteristic broadly corresponds to the relative computational complexity of the mass problem. We use Medvedev reducibility to formalize relative computational complexity, and thus to compare such mass problems to known ones. We show that the mass problem of ultrafilter bases is equivalent to the mass problem of computing a function that dominates all computable functions, and hence, by Martin’s characterization, it captures highness. On the other hand, the mass problem for maximal towers is below the mass problem of computing a non-low set. We also show that some, but not all, noncomputable low sets compute maximal towers: Every noncomputable (low) c.e. set computes a maximal tower but no 1-generic $$\Delta ^0_2$$ -set does so. We finally consider the mass problems of maximal almost disjoint, and of maximal independent families. We show that they are Medvedev equivalent to maximal towers, and to ultrafilter bases, respectively. 
    more » « less
  4. abstract: In the early 1940s, P. A. Smith showed that if a finite $$p$$-group $$G$$ acts on a finite dimensional complex $$X$$ that is mod $$p$$ acyclic, then its space of fixed points, $X^G$, will also be mod $$p$$ acyclic. In their recent study of the Balmer spectrum of equivariant stable homotopy theory, Balmer and Sanders were led to study a question that can be shown to be equivalent to the following: if a $$G$$-space $$X$$ is a equivariant homotopy retract of the $$p$$-localization of a based finite $$G$$-C.W. complex, given $H 
    more » « less
  5. null (Ed.)
    Abstract We study the Bergman metric of a finite ball quotient $$\mathbb{B}^n/\Gamma $$, where $$n \geq 2$$ and $$\Gamma \subseteq{\operatorname{Aut}}({\mathbb{B}}^n)$$ is a finite, fixed point free, abelian group. We prove that this metric is Kähler–Einstein if and only if $$\Gamma $$ is trivial, that is, when the ball quotient $$\mathbb{B}^n/\Gamma $$ is the unit ball $${\mathbb{B}}^n$$ itself. As a consequence, we characterize the unit ball among normal Stein spaces with isolated singularities and abelian fundamental groups in terms of the existence of a Bergman–Einstein metric. 
    more » « less