Abstract We establish effective versions of Oppenheim’s conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed quadratic forms and generic shifts. Our results complement our previous paper [13] where we considered generic forms and fixed shifts. In this paper, we use ergodic theorems and in particular we establish a strong spectral gap with effective bounds for some representations of orthogonal groups, which do not possess Kazhdan’s property $(T)$.
more »
« less
Second moment of the light-cone Siegel transform and applications
We study the light-cone Siegel transform, transforming functions on the light cone of a rational indefinite quadratic form Q to a function on the homogenous space $$\SO_Q(\Z)\backslash \SO_Q(\R)$$. In particular, we prove a second moment formula for this transform for forms of signature (n+1,1), and show how it can be used for various applications involving counting integer points on the light cone. In particular, we prove some new results on intrinsic Diophantine approximations on ellipsoids as well as on the distribution of values of random linear and quadratic forms on the light cone.
more »
« less
- Award ID(s):
- 1651563
- PAR ID:
- 10513724
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Advances in Mathematics
- Volume:
- 432
- Issue:
- C
- ISSN:
- 0001-8708
- Page Range / eLocation ID:
- 109270
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract We establish effective versions of Oppenheim’s conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed shift vectors and generic quadratic forms. When the shift is rational we prove a counting result, which implies the optimal density for values of generic inhomogeneous forms. We also obtain a similar density result for fixed irrational shifts satisfying an explicit Diophantine condition. The main technical tool is a formula for the 2nd moment of Siegel transforms on certain congruence quotients of $$SL_n(\mathbb{R}),$$ which we believe to be of independent interest. In a sequel, we use different techniques to treat the companion problem concerning generic shifts and fixed quadratic forms.more » « less
-
We describe strong convex valid inequalities for conic quadratic mixed 0–1 optimization. These inequalities can be utilized for solving numerous practical nonlinear discrete optimization problems from value-at-risk minimization to queueing system design, from robust interdiction to assortment optimization through appropriate conic quadratic mixed 0–1 relaxations. The inequalities exploit the submodularity of the binary restrictions and are based on the polymatroid inequalities over binaries for the diagonal case. We prove that the convex inequalities completely describe the convex hull of a single conic quadratic constraint as well as the rotated cone constraint over binary variables and unbounded continuous variables. We then generalize and strengthen the inequalities by incorporating additional constraints of the optimization problem. Computational experiments on mean-risk optimization with correlations, assortment optimization, and robust conic quadratic optimization indicate that the new inequalities strengthen the convex relaxations substantially and lead to significant performance improvements.more » « less
-
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
An official website of the United States government

