A PROBABILISTIC TECHNIQUE FOR FINDING ALMOST-PERIODS OF CONVOLUTIONS arXiv:1003.2978v2 [math.NT] 14 SepERNIE CROOT AND OLOF SISASK

Source URL: arxiv.org

• Mathematical analysis
• Mathematics
• Algebra
• Fourier analysis
• Joseph Fourier
• Harmonic analysis
• Unitary operators
• Additive number theory
• Fourier transform
• Convolution
• Abelian group
• Arithmetic combinatorics

COUNTING SUM-FREE SETS IN ABELIAN GROUPS ´ NOGA ALON, JOZSEF BALOGH, ROBERT MORRIS, AND WOJCIECH SAMOTIJ Abstract. In this paper we study sum-free sets of order m in finite Abelian groups. We prove a general theorem on

Source URL: w3.impa.br

A new approach to the 2-regularity of the `-abelian complexity of 2-automatic sequences Aline Parreau∗ Michel Rigo

Source URL: thales.math.uqam.ca

ECCEfficient and Generalized Pairing Computation on Abelian Varieties Hyang-Sook Lee Ewha Womans University

Source URL: www.hyperelliptic.org

• Pairing-based cryptography
• Elliptic curve cryptography
• Elliptic curves
• Linear algebra
• Module theory
• Pairing
• Tate pairing
• Divisor
• Elliptic curve
• Weil pairing

ON THE OLSON AND THE STRONG DAVENPORT CONSTANTS OSCAR ORDAZ, ANDREAS PHILIPP, IRENE SANTOS AND WOLFGANG A. SCHMID Abstract. A subset S of a finite abelian group, written additively, is called zero-sumfree if the sum of t

Source URL: www.uni-graz.at

AN INVERSE THEOREM FOR THE RESTRICTED SET ADDITION IN ABELIAN GROUPS 1 ´ GYULA KAROLYI

Source URL: www.cs.elte.hu

ARITHMETIC OF BLOCK MONOIDS WOLFGANG A. SCHMID Abstract. We investigate block monoids, the monoid of zero-sum sequences, over abelian groups and their divisor-closed submonoids. We derive some results that can be used as

Source URL: www.uni-graz.at

´ LIST OF PUBLICATIONS OF GYULA KAROLYI I Research papers ´cs [1] Doubly transitive permutation groups with abelian stabilizers (with S.J. Kova

Source URL: www.cs.elte.hu

REMARKS ON A GENERALIZATION OF THE DAVENPORT CONSTANT MICHAEL FREEZE AND WOLFGANG A. SCHMID Abstract. A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let

Source URL: www.uni-graz.at

Counting factors of automatic sequences up to abelian equivalence Aline Parreau Michel Rigo

Source URL: thales.math.uqam.ca