Results 211 to 220 of about 2,569 (239)
Causality Implications for Absorption by EM Metasurfaces. [PDF]
Valagiannopoulos C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On sums of finite products of balancing polynomials
Journal of Computational and Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taekyun Kim
exaly +2 more sources
Finite Sums of Toeplitz Products on the Polydisk
Potential Analysis, 2009The authors study operators \(S\) of the form \[ S=T_\lambda+\sum_{k=1}^N T_{u_k}T_{v_k}, \] where \(u_k, v_k\) are pluriharmonic functions, \(\lambda\) is an \(n\)-harmonic function on the polydisk \(D^n\), and \(T_u f=P(uf)\) is the Toeplitz operator with symbol \(u\) in the Bergman space \(A^2(D^n)\).
Hyungwoon Koo +2 more
exaly +2 more sources
Sums of Finite Products of Euler Functions
Trends in Mathematics, 2017In this paper, we consider three types of functions given by sums of finite products of Euler functions and derive their Fourier series expansions. In addition, we express each of them in terms of Bernoulli functions.
Taekyun Kim +2 more
exaly +2 more sources
Finite sums of dual Toeplitz products
Studia Mathematica, 2021Summary: We consider dual Toeplitz operators acting on the orthogonal complements of two kinds of Dirichlet spaces on the unit ball. We first characterize compactness for operators which are finite sums of dual Toeplitz products. Next, we give a characterization of when a finite sum of products of two dual Toeplitz operators is another dual Toeplitz ...
openaire +1 more source
Sum-product Estimates in Finite Fields via Kloosterman Sums
International Mathematics Research Notices, 2010We establish improved sum-product bounds in finite fields using incidence theorems based on bounds for classical Kloosterman and related sums.
D. Hart, A. Iosevich, J. Solymosi
openaire +1 more source
Applications of the Sum-Product Theorem in Finite Fields
21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006Summary form only given. About two years ago Bourgain, Katz and Tao (2004) proved the following theorem, essentially stating that in every finite field, a set which does not grow much when we add all pairs of elements, and when we multiply all pairs of elements, must be very close to a subfield. Theorem 1: (Bourgain et al., 2004) For every /spl epsi/ >
openaire +1 more source
Finite Graphs and the Number of Sums and Products
1996Let G be a graph with k vertices (1, 2, …, k) and e edges. Let A = (α1,α2,..,α k ) be a set of k integers, and let G(A) be the set of all integers of the form α i + α j and α i α j , where (i,j) is an edge of G. Erdos and Szemeredi conjectured that |G(α)| ≫ e e /k e for every e > 0 and every set A.
Xing-De Jia, Melvyn B. Nathanson
openaire +1 more source
Product graphs, sum-product graphs and sum-product estimates over finite rings
Forum Mathematicum, 2013Abstract In this paper, we study the product and sum-product graphs defined over the residue ring mod m. We show that all (or almost all) systems of dot-product equations are solvable in any sufficiently large subset ℰ ⊂ ℤ m d .
openaire +1 more source

