A representative of RΓ(N,T) for higher dimensional twists of ℤpr(1)

Let [Formula: see text] be a Galois extension of [Formula: see text]-adic number fields and let [Formula: see text] be a de Rham representation of the absolute Galois group [Formula: see text] of [Formula: see text]. In the case [Formula: see text], the equivariant local [Formula: see text]-constant conjecture describes the compatibility of the equivariant Tamagawa number conjecture with the functional equation of Artin [Formula: see text]-functions and it can be formulated as the vanishing of a certain element [Formula: see text] in [Formula: see text]; a similar approach can be followed also in the case of unramified twists [Formula: see text] of [Formula: see text] (see [W. Bley and A. Cobbe, The equivariant local [Formula: see text]-constant conjecture for unramified twists of [Formula: see text], Acta Arith. 178(4) (2017) 313–383; D. Izychev and O. Venjakob, Equivariant epsilon conjecture for 1-dimensional Lubin–Tate groups, J. Théor. Nr. Bordx. 28(2) (2016) 485–521]). One of the main technical difficulties in the computation of [Formula: see text] arises from the so-called cohomological term [Formula: see text], which requires the construction of a bounded complex [Formula: see text] of cohomologically trivial modules which represents [Formula: see text] for a full [Formula: see text]-stable [Formula: see text]-sublattice [Formula: see text] of [Formula: see text]. In this paper, we generalize the construction of [Formula: see text] in Theorem 2 of [W. Bley and A. Cobbe, The equivariant local [Formula: see text]-constant conjecture for unramified twists of [Formula: see text], Acta Arith. 178(4) (2017) 313–383] to the case of a higher dimensional [Formula: see text].

Discrete Correlation of Order 2 of Generalized Rudin-Shapiro Sequences on Alphabets of Arbitrary Size

In 2009, Grant, Shallit, and Stoll [Acta Arith. 140 (2009), [345–368] constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2 in cases where the size of the alphabet is a prime number or a squarefree product of primes. We establish similar results for an even larger family of pseudorandom sequences, constructed via difference matrices, in the case of an alphabet of any size. The constructions generalize those from Grant et al. In the case where the size of the alphabet is squarefree and where there are at least two prime factors, we obtain an improvement in the error term by comparison with the result of Grant et al.

SOME REMARKS ON MINIMAL ASYMPTOTIC BASES OF ORDER THREE

We study a question on minimal asymptotic bases asked by Nathanson [‘Minimal bases and powers of 2’, Acta Arith. 49 (1988), 525–532].

On a problem of Erdös related to common factor differences

Let [Formula: see text] be a positive integer. The factor-difference set [Formula: see text] of [Formula: see text] is the set of absolute values [Formula: see text] of the differences between the factors of any factorization of [Formula: see text] as a product of two integers. Erdős and Rosenfeld [The factor–difference set of integers, Acta Arith. 79(4) (1997) 353–359] ask whether for every positive integer [Formula: see text] there exist integers [Formula: see text] such that [Formula: see text], and prove this is true when [Formula: see text]. Urroz [A note on a conjecture of Erdős and Rosenfeld, J. Number Theory 78(1) (1999) 140–143] shows the result true for [Formula: see text]. The ideas of this paper can be extended, and here, we show the result true for [Formula: see text] by proving there are infinitely many sets of four integers with four common factor differences.

On the order of a modulo n, on average

Let [Formula: see text] be an integer. Denote by [Formula: see text] the multiplicative order of [Formula: see text] modulo integer [Formula: see text]. We prove that there is a positive constant [Formula: see text] such that if [Formula: see text], then [Formula: see text] where [Formula: see text] It was known for [Formula: see text] in [P. Kurlberg and C. Pomerance, On a problem of Arnold: The average multiplicative order of a given integer, Algebra Number Theory 7 (2013) 981–999] in which they refer to [F. Luca and I. E. Shparlinski, Average multiplicative orders of elements modulo [Formula: see text], Acta Arith. 109(4) (2003) 387–411.

On the number of divisors of a quaternary quadratic form

Let [Formula: see text] We obtain the asymptotic formula [Formula: see text] where [Formula: see text] are two constants. This improves the previous error term [Formula: see text] obtained by the second author [An asymptotic formula related to the divisors of the quaternary quadratic form, Acta Arith. 166 (2014) 129–140].