An official website of the United States government
We examine correlations of the Möbius function over $$\mathbb{F}_{q}[t]$$ with linear or quadratic phases, that is, averages of the form 1 $$\begin{eqnarray}\frac{1}{q^{n}}\mathop{\sum }_{\deg f0$$ if $$Q$$ is linear and $$O(q^{-n^{c}})$$ for some absolute constant $c>0$ if $$Q$$ is quadratic. The latter bound may be reduced to $$O(q^{-c^{\prime }n})$$ for some $$c^{\prime }>0$$ when $Q(f)$ is a linear form in the coefficients of $$f^{2}$$ , that is, a Hankel quadratic form, whereas, for general quadratic forms, it relies on a bilinear version of the additive-combinatorial Bogolyubov theorem.
more »
« less
On realization of isometries for higher rank quadratic lattices over number fields
Let F F be a number field, and n ≥ 3 n\geq 3 be an integer. In this paper we give an effective procedure which (1) determines whether two given quadratic lattices on F n F^n are isometric or not, and (2) produces an invertible linear transformation realizing the isometry provided the two given lattices are isometric. A key ingredient in our approach is a search bound for the equivalence of two given quadratic forms over number fields which we prove using methods from algebraic groups, homogeneous dynamics and spectral theory of automorphic forms.
more »
« less
- Award ID(s):
- 1700109
- PAR ID:
- 10464618
- Date Published:
- Journal Name:
- Transactions of the American Mathematical Society
- Volume:
- 375
- Issue:
- 1058
- ISSN:
- 0002-9947
- Page Range / eLocation ID:
- 4619 to 4640
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract The first part of the paper studies the boundary behavior of holomorphic isometric mappings F = ( F 1 , … , F m ) {F=(F_{1},\dots,F_{m})} from the complex unit ball 𝔹 n {\mathbb{B}^{n}} , n ≥ 2 {n\geq 2} , to a bounded symmetric domain Ω = Ω 1 × ⋯ × Ω m {\Omega=\Omega_{1}\times\cdots\times\Omega_{m}} up to constant conformal factors, where Ω i ′ {\Omega_{i}^{\prime}} s are irreducible factors of Ω. We prove every non-constant component F i {F_{i}} must map generic boundary points of 𝔹 n {\mathbb{B}^{n}} to the boundary of Ω i {\Omega_{i}} . In the second part of the paper, we establish a rigidity result for local holomorphic isometric maps from the unit ball to aproduct of unit balls and Lie balls.more » « less
-
null (Ed.)Abstract We investigate a covering problem in 3-uniform hypergraphs (3-graphs): Given a 3-graph F , what is c 1 ( n , F ), the least integer d such that if G is an n -vertex 3-graph with minimum vertex-degree $$\delta_1(G)>d$$ then every vertex of G is contained in a copy of F in G ? We asymptotically determine c 1 ( n , F ) when F is the generalized triangle $$K_4^{(3)-}$$ , and we give close to optimal bounds in the case where F is the tetrahedron $$K_4^{(3)}$$ (the complete 3-graph on 4 vertices). This latter problem turns out to be a special instance of the following problem for graphs: Given an n -vertex graph G with $m> n^2/4$ edges, what is the largest t such that some vertex in G must be contained in t triangles? We give upper bound constructions for this problem that we conjecture are asymptotically tight. We prove our conjecture for tripartite graphs, and use flag algebra computations to give some evidence of its truth in the general case.more » « less
-
Mulzer, Wolfgang; Phillips, Jeff M (Ed.)Given in the plane a set of points and a set of halfplanes, we consider the problem of computing a smallest subset of halfplanes whose union covers all points. In this paper, we present an O(n^{4/3}log^{5/3}nlog^{O(1)}log n)-time algorithm for the problem, where n is the total number of all points and halfplanes. This improves the previously best algorithm of n^{10/3}2^{O(log^*n)} time by roughly a quadratic factor. For the special case where all halfplanes are lower ones, our algorithm runs in O(nlog n) time, which improves the previously best algorithm of n^{4/3}2^{O(log^*n)} time and matches an Ω(nlog n) lower bound. Further, our techniques can be extended to solve a star-shaped polygon coverage problem in O(nlog n) time, which in turn leads to an O(nlog n)-time algorithm for computing an instance-optimal ε-kernel of a set of n points in the plane. Agarwal and Har-Peled presented an O(nklog n)-time algorithm for this problem in SoCG 2023, where k is the size of the ε-kernel; they also raised an open question whether the problem can be solved in O(nlog n) time. Our result thus answers the open question affirmatively.more » « less
-
We introduce and study the notion of *an outer bi-Lipschitz extension* of a map between Euclidean spaces. The notion is a natural analogue of the notion of *a Lipschitz extension* of a Lipschitz map. We show that for every map f there exists an outer bi-Lipschitz extension f′ whose distortion is greater than that of f by at most a constant factor. This result can be seen as a counterpart of the classic Kirszbraun theorem for outer bi-Lipschitz extensions. We also study outer bi-Lipschitz extensions of near-isometric maps and show upper and lower bounds for them. Then, we present applications of our results to prioritized and terminal dimension reduction problems, described next. We prove a *prioritized* variant of the Johnson–Lindenstrauss lemma: given a set of points X⊂ ℝd of size N and a permutation (”priority ranking”) of X, there exists an embedding f of X into ℝO(logN) with distortion O(loglogN) such that the point of rank j has only O(log3 + ε j) non-zero coordinates – more specifically, all but the first O(log3+ε j) coordinates are equal to 0; the distortion of f restricted to the first j points (according to the ranking) is at most O(loglogj). The result makes a progress towards answering an open question by Elkin, Filtser, and Neiman about prioritized dimension reductions. We prove that given a set X of N points in ℜd, there exists a *terminal* dimension reduction embedding of ℝd into ℝd′, where d′ = O(logN/ε4), which preserves distances ||x−y|| between points x∈ X and y ∈ ℝd, up to a multiplicative factor of 1 ± ε. This improves a recent result by Elkin, Filtser, and Neiman. The dimension reductions that we obtain are nonlinear, and this nonlinearity is necessary.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1090/tran/8670
