Results 271 to 280 of about 52,924 (309)
Some of the next articles are maybe not open access.
A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS
International Journal of Computational Geometry & Applications, 2007We present a monotonic convolution for planar regions A and B bounded by line and circular arc segments. The Minkowski sum equals the union of the cells with positive crossing numbers in the arrangement of the convolution, as is the case for the kinetic convolution.
Milenkovic, Victor, Sacks, Elisha
openaire +2 more sources
SIAM Journal on Mathematical Analysis, 1972
Let $\Omega $ be an open set in $R_n $ and let $\mathcal{E}(\Omega )$ denote the space of infinitely differentiable functions on $\Omega $. Necessary and sufficient conditions are exhibited for a family $\{ \Omega _i \} _{i = 1}^N $ of open sets in $R_n$ and a family $\{ S_i \} _{i = 1}^N \subset \mathcal{E}'(R_n )$ in order that the convolution ...
openaire +2 more sources
Let $\Omega $ be an open set in $R_n $ and let $\mathcal{E}(\Omega )$ denote the space of infinitely differentiable functions on $\Omega $. Necessary and sufficient conditions are exhibited for a family $\{ \Omega _i \} _{i = 1}^N $ of open sets in $R_n$ and a family $\{ S_i \} _{i = 1}^N \subset \mathcal{E}'(R_n )$ in order that the convolution ...
openaire +2 more sources
A sharp discrete convolution sum estimate
Communications in Nonlinear Science and Numerical Simulation, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Stynes, Dongling Wang
openaire +2 more sources
Evaluation of some convolution sums
AIP Conference Proceedings, 2015We evaluate the convolution sums∑l+50m=nσ(l)σ(m), ∑2l+25m=nσ(l)σ(m), ∑l+25m=nσ(l)σ(m),∑l+m=n,l≡a mod5σ(l)σ(m), for a=0,1,2,3,4using the theory of quasimodular forms.
openaire +1 more source
Sum-product decoding of convolutional codes
2009 Fourth International Workshop on Signal Design and its Applications in Communications, 2009This article proposes two methods to improve the sum-product soft-in/soft-out decoding performance of convolutional codes. The first method is to transform a parity check equation in such a way as to remove cycles of length four in a Tanner graph of a convolutional code, and performs sum-product algorithm (SPA) with the transformed parity check ...
Toshiyuki Shohon +2 more
openaire +1 more source
Shifted convolution sums related to Hecke–Maass forms
The Ramanujan Journal, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tang, Hengcai, Wu, Jie
openaire +4 more sources
Higher convolutions of Ramanujan sums
Journal of Number TheoryLetting \(c_q(n)\) to be the Ramanujan sum, in the paper under review, the authors provide higher convolutions of Ramanujan sums by computing the following limit \[ \lim_{x\to x}\frac{1}{x}\sum_{n\leq x}c_{q_1}(n+a_1)\cdots c_{q_k}(n+a_k). \] The result of the above limit is a multivariable multiplicative function, say \(f(q_1,\dots, q_k)\), for which ...
Goel, Shivani, Murty, M. Ram
openaire +1 more source
On Convoluted Numbers and Sums
The American Mathematical Monthly, 1967(1967). On Convoluted Numbers and Sums. The American Mathematical Monthly: Vol. 74, No. 3, pp. 235-246.
openaire +1 more source
Sums with convolutions of Dirichlet characters
manuscripta mathematica, 2010Let \(\chi_1\) and \(\chi_2\) be primitive Dirichlet characters with conductors \(q_1\) and \(q_2\), respectively, and let \[ S_{\chi_1,\chi_2}(X):=\sum_{ab\leq X}\chi_1(a)\chi_2(b). \] The authors prove that if \(X\geq q_2^{\frac 23}\geq q_1^{\frac 23}\) and \(\log X=q_2^{o(1)}\), then \[ \left| S_{\chi_1,\chi_2}(X)\right|\leq X^{\frac {13}{18}}q_1 ...
Banks, William D., Shparlinski, Igor E.
openaire +2 more sources
The convolution sums of MacMahon’s q-series
The Ramanujan JournalIn his classical work on partitions and divisor functions, MacMahon introduced the two \(q\)-series \(A_k(q)\) and \(C_k(q)\), which have since been shown to be quasimodular forms and are closely linked to partition functions, modular forms, and infinite product identities.
Xia, Ernest X. W. +2 more
openaire +1 more source

