The study of sum and product problems in finite fields motivates the investigation of additive structures in multiplicative subgroups of such fields. A simple known fact is that any multiplicative subgroup of size at least q in the finite field Fq must contain an additive relation x + y = z. Our main result is that there are infinitely many examples of sum-free multiplicative subgroups of size ...

 In this work, we present a traffic classifier based on the theory of multifractal network traffic. We use precisely the concept of multiplicative binomial cascades to get a feature vector to be used in the classification scheme. This vector is obtained by the multiplier variances of the multiplicative cascade traffic view. We analyze the performance of the technique proposed by a popular ML S...

Mahler’s measure is generalized to create the class of multiplicative distance functions. These functions measure the complexity of polynomials based on the location of their zeros in the complex plane. Several examples of multiplicative distance functions are given including those formed from equilibrium potentials of compact connected subsets of C. To each multiplicative distance function we ...

Background: For psychiatric disorders, comorbidity is a rule rather than exception. Thus it is particularly important to study additive and multiplicative effects of multiple mental disorders on suicidal behaviors. Objectives: The aim of this study was to investigate the ethnic differences in multiplicative effects of mental disorders on suicidal ideation among Black adults in the United States...

How is information integrated across the attributes of an option when making risky choices? In most descriptive models of decision under risk, information about risk, and reward is combined multiplicatively (e.g., expected value; expected utility theory, Bernouli, 1738/1954; subjective expected utility theory, Savage, 1954; Edwards, 1955; prospect theory, Kahneman and Tversky, 1979; rank-depend...

We establish a general and optimal lower bound for the complete sum of the probabilities of k-intersections of n events. We then describe various applications to additive and multiplicative number theory, graph theory, coding theory, study of lattice points on circles, and divisors of polynomials