相关论文: On the balanced Voronoi formula for GL$_N$

In this paper we study incidences for hyperbolas in $\mathbf{F}_p$ and show how linear sum--product methods work for such curves. As an application we give a purely combinatorial proof of a nontrivial upper bound for bilinear forms of…

The maximal degree over rational numbers that an n-dimensinonal Kloosterman sum defined over a finite field of characteristic p can achieve is known to be (p-1)/d where d=gcd(p-1,n+1). Wan has shown that this maximal degree is always…

We show that sums of the SL(3,Z) long element Kloosterman sum against a smooth weight function have cancellation due to the variation in argument of the Kloosterman sums, when each modulus is at least the square root of the other. Our main…

Poisson Voronoi diagrams are useful for modeling and describing various natural patterns and for generating random lattices. Although this particular space tessellation is intensively studied by mathematicians, in two- and three dimensional…

Recently, Guo and Zeng discovered two families of polynomials featuring in a q-analogue of Faulhaber's formula for the sums of powers and a q-analogue of Gessel-Viennot's formula involving Salie's coefficients for the alternating sums of…

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

In this paper, we will explicitly calculate Gauss sums for the general linear groups and the special linear groups over $\Bbb Z_n$, where $\Bbb Z_n=\Bbb Z/n \Bbb Z$ and $n>0$ is an integer. For $r$ being a positive integer, the formulae of…

We obtain statistical results on the possible distribution of all partial sums of a Kloosterman sum modulo a prime, by computing explicitly the support of the limiting random Fourier series of our earlier functional limit theorem for…

We improve recent results of D. Gomez and A. Winterhof (2010) and of A. Ostafe and I. E. Shparlinski (2011) on the Waring problem with Dickson polynomials in the case of prime finite fields. Our approach is based on recent bounds of…

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

We study a family of exponential sums that arises in the study of the horocyclic flow on $\mathrm{GL}_n$. We prove an explicit version of general purity and find optimal bounds for these sums.

These are notes of a talk based on the work arXiv:1212.3630 joint with A. Aizenbud. Let V be a finite-dimensional vector space over a local field F of characteristic 0. Let f be a function on V of the form $f(x)= \psi (P(x))$, where P is a…

Consider a Bernoulli random field satisfying the Hannan's condition. Recently, invariance principles for partial sums of random fields over rectangular index sets are established. In this note we complement previous results by investigating…

We introduce the inversion polynomial for Dedekind sums $f_b(x)=\sum x^{\operatorname{inv}(a,b)}$ to study the number of $s(a,b)$ which have the same value for given $b$. We prove several properties of this polynomial and present some…

Basing on properties of the Mellin transform and Ramanujan's identities, which represent a ratio of products of Riemann's zeta- functions of different arguments in terms of the Dirichlet series of arithmetic functions, we obtain a number of…

Let $L$ be an even lattice of odd rank with discriminant group $L'/L$, and let $\alpha,\beta \in L'/L$. We prove the Weil bound for the Kloosterman sums $S_{\alpha,\beta}(m,n,c)$ of half-integral weight for the Weil Representation attached…

Most current results on coverage control using mobile sensors require that one partitioned cell is the sole responsibility of one sensor. In this paper, we consider a class of generalized Voronoi coverage control problems by using higher…

We present an accurate and rapid solution of Poisson's equation for space-filling, arbitrarily- shaped, convex Voronoi polyhedra (VP); the method is O(NVP), where NVP is the number of distinct VP representing the system. In effect, we…

We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…

We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic…