Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Falconer distance problem, additive energy and Cartesian products  [PDF]
Alex Iosevich,Bochen Liu
Mathematics , 2015,
Abstract: A celebrated result due to Wolff says if $E$ is a compact subset of ${\Bbb R}^2$, then the Lebesgue measure of the distance set $\Delta(E)=\{|x-y|: x,y \in E \}$ is positive if the Hausdorff dimension of $E$ is greater than $\frac{4}{3}$. In this paper we improve the $\frac{4}{3}$ barrier by a small exponent for Cartesian products. In higher dimensions, also in the context of Cartesian products, we reduce Erdogan's $\frac{d}{2}+\frac{1}{3}$ exponent to $\frac{d^2}{2d-1}$. The proof uses a combination of Fourier analysis and additive comibinatorics.
Erdos-Falconer distance problem, exponential sums, and Fourier analytic approach to incidence theorems in vector spaces over finite fields  [PDF]
Alex Iosevich,Doowon Koh
Mathematics , 2006,
Abstract: We prove several incidence theorems in vector spaces over finite fields using bounds for various classes of exponential sums and apply these to Erdos-Falconer type distance problems.
Sums of alternating products of Riemann zeta values and solution of a Monthly problem  [PDF]
Mark W. Coffey
Mathematics , 2011,
Abstract: We solve problem 11585 proposed by B. Burdick, AMM June-July 2011 {\bf 118} (6), p. 558 for the sum of certain products of Riemann zeta function values. We further point out an alternating sum analog, and then present and prove different alternating sum analogs. In addition, we present summation by parts and other results for the Hurwitz and Riemann zeta functions and for the digamma and trigamma functions.
Sums of products of power sums  [PDF]
Jitender Singh
Mathematics , 2013,
Abstract: For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$ $f^n=f\bullet \cdots\bullet f$ be $n-$fold product of $f\in \mathcal{S}.$ For any $x\in\mathbb{C},$ let $\mathcal{S}_0=e$ be the multiplicative identity of the ring $(\mathcal{S},\bullet,+)$ and $\mathcal{S}_x(k):=\frac{\mathcal{B}_{x+1}(k+1)-\mathcal{B}_{1}(k+1)}{k+1},~x\neq 0$ denote the power sum defined by Bernoulli polynomials $\mathcal{B}_x(k)=B_k(x).$ We consider the sums of products $\mathcal{S}_x^N(k),~N\in\mathbb{N}_0.$ A closed form expression for $\mathcal{S}^N_x(k)(x)$ generalizing the classical Faulhaber formula, is derived. Furthermore, some properties of $\alpha-$Euler numbers \cite{JS9}(a variant of Apostol Bernoulli numbers) and their sums of products, are considered using which a closed form expression for the sums of products of infinite series of the form $\eta_\alpha(k):=\sum_{n=0}^{\infty}\alpha^n n^k,~0<|\alpha|<1,~k\in\mathbb{N}_0$ and the related Abel sums, is obtained which in particular, gives a closed form expression for well known Bernoulli numbers. A generalization of the sums of products of power sums to the sums of products of alternating power sums is also obtained. These considerations generalize in a unified way to define sums of products of power sums for all $k\in\mathbb{N}$ hence connecting them with zeta functions.
Sums of products of Ramanujan sums  [PDF]
László Tóth
Mathematics , 2011, DOI: 10.1007/s11565-011-0143-3
Abstract: The Ramanujan sum $c_n(k)$ is defined as the sum of $k$-th powers of the primitive $n$-th roots of unity. We investigate arithmetic functions of $r$ variables defined as certain sums of the products $c_{m_1}(g_1(k))...c_{m_r}(g_r(k))$, where $g_1,..., g_r$ are polynomials with integer coefficients. A modified orthogonality relation of the Ramanujan sums is also derived.
Additive energy and the Falconer distance problem in finite fields  [PDF]
Doowon Koh,Chun-Yen Shen
Mathematics , 2010,
Abstract: We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for finite fields holds in two dimension. Moreover, we give an alternative proof of the theorem, due to Iosevich and Rudnev, that any Salem set satisfies the Falconer distance conjecture for finite fields.
A study in sums of products  [PDF]
é. Fouvry,E. Kowalski,Ph. Michel
Mathematics , 2014, DOI: 10.1098/rsta.2014.0309
Abstract: We give a general version of cancellation in exponential sums that arise as sums of products of trace functions satisfying a suitable independence condition related to the Goursat-Kolchin-Ribet criterion, in a form that is easily applicable in analytic number theory.
Sums and products along sparse graphs  [PDF]
Noga Alon,Omer Angel,Itai Benjamini,Eyal Lubetzky
Mathematics , 2009,
Abstract: In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They further proposed a generalization of this problem, in which the sums and products are taken along the edges of a given graph $G$ on $n$ labeled vertices. They conjectured a version of the sum-product theorem for general graphs that have at least $n^{1+\epsilon}$ edges. In this work, we consider sum-product theorems for sparse graphs, and show that this problem has important consequences already when $G$ is a matching (i.e., $n/2$ disjoint edges): Any lower bound of the form $n^{1/2+\delta}$ for its sum-product over the integers implies a lower bound of $n^{1+\delta}$ for the original Erd\H{o}s-Szemer\'edi problem. In contrast, over the reals the minimal sum-product for the matching is $\Theta(\sqrt{n})$, hence this approach has the potential of achieving lower bounds specialized to the integers. We proceed to give lower and upper bounds for this problem in different settings. In addition, we provide tight bounds for sums along expanders. A key element in our proofs is a reduction from the sum-product of a matching to the maximum number of translates of a set of integers into the perfect squares. This problem was originally studied by Euler, and we obtain a stronger form of Euler's result using elliptic curve analysis.
Sums of Products of -Euler Polynomials and Numbers
Kim Young-Hee,Hwang Kyung-Won,Kim Taekyun
Journal of Inequalities and Applications , 2009,
Abstract: We derive formulae for the sums of products of the -Euler polynomials and numbers using the multivariate fermionic -adic -Volkenborn integral on .
Patterns in numbers and infinite sums and products  [PDF]
Yining Hu
Mathematics , 2015,
Abstract: In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.