Properties of two-dimensional sets with small sumset

We give tight lower bounds on the cardinality of the sumset of two finite, nonempty subsets A,B⊆R² in terms of the minimum number h₁(A,B) of parallel lines covering each of A and B. We show that, if h₁(A,B)?s and |A|?|B|?2s²−3s+2, then

     

Sets whose sumset avoids a thin sequence

Let {a₁,a₂,a₃,…} be an unbounded sequence of positive integers with an+1/an approaching α as n→∞, and let β>max(α,2). We show that for all sufficiently large x?0, if A⊂[0,x] is a set of nonnegative integers containing 0 and satisfying

     

Some results on minimal sumset sizes in finite non-abelian groups

Let G be a group. We study the minimal sumset (or product set) size μG(r,s)=min{|A⋅B|}, where A,B range over all subsets of G with cardinality r,s respectively. The function μG has recently been fully determined in [S. Eliahou, M. Kervaire, A. Plagne, Optimally small sumsets in finite abelian groups, J. Number Theory 101 (2003) 338-348; S. Eliahou, M. Kervaire, Minimal sumsets in infinite abelian groups, J. Algebra 287 (2005) 449-457] for G abelian. Here we focus on the largely open case where G is finite non-abelian. We obtain results on μG(r,s) in certain ranges for r and s, for instance when r?3 or when r+s?|G|−1, and under some more technical conditions. (See Theorem 4.4.) We also compute μG for a few non-abelian groups of small order. These results extend the Cauchy-Davenport theorem, which determines μG(r,s) for G a cyclic group of prime order.     

The lattice of closure operators on a subgroup lattice

We say a lattice L is a subgroup lattice if there exists a group G such that Sub(G)?L, where Sub(G) is the lattice of subgroups of G, ordered by inclusion. We prove that the lattice of closure operators which act on the subgroup lattice of a finite group G is itself a subgroup lattice if and only if G is cyclic of prime power order.     

Abundant semigroups with a multiplicative quasi-adequate transversal

The concept of quasi-adequate transversals is introduced. Some properties and characterizations for abundant semigroups with a multiplicative quasi-adequate transversal are obtained. In particular, a structure theorem for such abundant semigroups is given. Finally, some special cases are considered. This research was partially supported by the National Natural Science Foundation of China (No. 10571077) and the Natural Science Foundation of Gansu Province (No. 3ZS052-A25-017).     

Global minimization of a generalized linear multiplicative programming

This article presents a simplicial branch and bound algorithm for globally solving generalized linear multiplicative programming problem (GLMP). Since this problem does not seem to have been studied previously, the algorithm is apparently the first algorithm to be proposed for solving such problem. In this algorithm, a well known simplicial subdivision is used in the branching procedure and the bound estimation is performed by solving certain linear programs. Convergence of this algorithm is established, and some experiments are reported to show the feasibility of the proposed algorithm.     

Softness of MALL proof-structures and a correctness criterion with Mix

We show that every MALL proof-structure [9] satisfies the property of softness, originally a categorical notion introduced by Joyal. Furthermore, we show that the notion of hereditary softness precisely captures Girards algebraic restriction of the technical condition on proof-structures. Relying on this characterization, we prove a MALL+Mix sequentialization theorem by a proof-theoretical method, using Girards notion of jump. Our MALL+Mix correctness criterion subsumes the Danos/Fleury-Retoré criterion [6] for MLL+Mix.This work was supported by Grant-in-Aid for Young Scientists of Ministry of Education, Science and Culture of Japan.Mathematics Subject Classification (2000):03F52, 03F07, 03F03Revised version: 9 August 2003     

On maximal subgroups of the multiplicative group of a division algebra

The question of existence of a maximal subgroup in the multiplicative group D^* of a division algebra D finite-dimensional over its center F is investigated. We prove that if D^* has no maximal subgroup, then deg(D) is not a power of 2, F^*2 is divisible, and for each odd prime p dividing deg(D), there exist noncyclic division algebras of degree p over F.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

On coprime G-conjugacy class sizes in a normal subgroup

Let N be a normal subgroup of a group G. Suppose that the positive integers m 〉 n are two longest non-central G-conjugacy class sizes of N with （m, n） = 1. The purpose of this paper is to determine the structure of N and give the N-conjugacy class sizes of the elements in N under that assumption that m is square free.     

The Serre spectral sequence of a multiplicative fibration

In a fibration we show that finiteness conditions on force the homology Serre spectral sequence with -coefficients to collapse at some finite term. This in particular implies that as graded vector spaces, is ``almost' isomorphic to . One consequence is the conclusion that is elliptic if and only if and are.

     

Parallel Itoh–Tsujii multiplicative inversion algorithm for a special class of trinomials

In this contribution, we derive a novel parallel formulation of the standard Itoh–Tsujii algorithm for multiplicative inverse computation over the field GF(2 ^m ). The main building blocks used by our algorithm are: field multiplication, field squaring and field square root operators. It achieves its best performance when using a special class of irreducible trinomials, namely, P(x) = x ^m  + x ^k  + 1, with m and k odd numbers and when implemented in hardware platforms. Under these conditions, our experimental results show that our parallel version of the Itoh–Tsujii algorithm yields a speedup of about 30% when compared with the standard version of it. Implemented in a Virtex 3200E FPGA device, our design is able to compute multiplicative inversion over GF(2¹⁹³) after 20 clock cycles in about 0.94 μS.      

Solving linear equations in a vector space over a finite field

We study the maximum possible size of a subset in a vector space over a finite field which contains no solution of a given linear equation (or a system of linear equations). This is a finite field version of Ruzsa's work [7].