Linking systems of difference sets

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are to determine which groups contain a linking system of difference sets, and how large such a system can be. All previous constructive results for linking systems of difference sets are restricted to 2‐groups. We use an elementary projection argument to show that neither the McFarland/Dillon nor the Spence construction of difference sets can give rise to a linking system of difference sets in non‐2‐groups. We make a connection to Kerdock and bent sets, which provides large linking systems of difference sets in elementary abelian 2‐groups. We give a new construction for linking systems of difference sets in 2‐groups, taking advantage of a previously unrecognized connection with group difference matrices. This construction simplifies and extends prior results, producing larger linking systems than before in certain 2‐groups, new linking systems in other 2‐groups for which no system was previously known, and the first known examples in nonabelian groups.     

Difference Galois theory of linear differential equations

We develop a Galois theory for linear differential equations equipped with the action of an endomorphism. This theory is aimed at studying the difference algebraic relations among the solutions of a linear differential equation. The Galois groups here are linear difference algebraic groups, i.e., matrix groups defined by algebraic difference equations.     

Dimension polynomials in the generalized difference case

The aim of this paper is to generalize results on dimension polynomials of difference modules over difference rings for a wider class of rings of difference operators. We introduce the notion of quasi-commutativity, which generalizes the notion of commutativity and enables one to consider wider classes of monoids and groups of endomorphisms. Some properties of quasi-commutative monoids and groups are established; these properties allow us to apply some methods that are almost similar to the ones used in working with free commutative monoids and groups. Also we prove the theorem of existence of the dimension polynomial of generalized difference modules in the cases where the submonoid of endomorphisms is free quasi-commutative. Also the existence of its analog for the case of a direct product of a free quasi-commutative monoid and a finite cyclic group is established.     

On the existence of difference sets in groups of order 96

The correspondence between a (96,20,4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets in groups of order 96. Starting from eight such symmetric designs constructed by the tactical decomposition method, 55 inequivalent (96,20,4) difference sets are distinguished. Thereby the existence of difference sets in 22 nonabelian groups of order 96 is proved.     

考虑任务优先约束的同类岸桥作业调度优化

分析了以箱组为任务对象QCSP与以整贝为任务对象QCSP的异同,指出前者更能均衡各岸桥作业负荷,并减少船舶装卸作业时间。考虑到岸桥具有作业效率差异的特点,将其视为同类平行机调度问题,同时结合任务优先约束、岸桥作业不可相互穿越与安全距离等特有约束,建立了更加符合实际的以箱组为任务对象的岸桥作业调度混合整数规划模型,其优化目标是最小化装卸作业的makespan。针对模型求解的复杂度,设计了一种遗传算法,对算法搜索空间进行了讨论,并推导了问题的低界。实验算例表明所建立的模型能够反映岸桥作业调度过程中作业效率差异及任务优先约束现象,其算法能够在允许的运算时间内获得稳定的满意解,并且优化结果要全面优于以整贝为任务对象QCSP的调度方案。     

A very special nonexistence theorem for abelian difference sets

It is wellknown that the technique of character sums together with the tools of algebraic number theory is the adequate method for the study of difference sets in abelian groups, compare for instance Ott [5] or Turyn [6]. In this paper we use this method to prove a new non-existence theorem for certain difference sets in abelian groups of order rp^a rp^a , where r 1 2 r \neq 2 and p are distinct primes.     

Relative difference sets fixed by inversion (ii)—character theoretical approach

In this paper, we continue our investigation of relative difference sets fixed by inversion. We exclusively focus our attention on abelian groups. New necessary conditions are obtained and a new family of such relative difference sets with forbidden subgroup Z/4Z is constructed. The methods we use are character theory of abelian groups and Galois rings over Z/4Z.     

Nontrivial periodic solutions for asymptotically linear resonant difference problem

In this paper the existence of nontrivial periodic solution for second order asymptotically linear difference equation at resonance is obtained. The methods used here are based on combining the minimax methods and the Morse theory, especially the observation on the critical groups.     

Difference sets and sum-free sets in groups of order 16

Transversals for sum-free sets in the nine nonabelian order 16 groups are given. It is shown that exactly eight of the order 16 groups have difference sets Dwithλ = 2and D = -D. It is proven that the only (υ, k, λ) difference sets with υ = 2^t and λ = 2, have parameters (16, 6, 2). It is shown that exactly four of the order 16 groups can be partitioned into three sum-free sets.     

An extension of building sets and relative difference sets

Building sets are a successful tool for constructing semi‐regular divisible difference sets and, in particular, semi‐regular relative difference sets. In this paper, we present an extension theorem for building sets under simple conditions. Some of the semi‐regular relative difference sets obtained using the extension theorem are new in the sense that their ambient groups have smaller ranks than previously known. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 50–57, 2000     

Almost periodic homogeneous linear difference systems without almost periodic solutions

Almost periodic homogeneous linear difference systems are considered. It is supposed that the coefficient matrices belong to a group. The aim was to find such groups that the systems having no non-trivial almost periodic solution form a dense subset of the set of all considered systems. A closer examination of the used methods reveals that the problem can be treated in such a generality that the entries of coefficient matrices are allowed to belong to any complete metric field. The concepts of transformable and strongly transformable groups of matrices are introduced, and these concepts enable us to derive efficient conditions for determining what matrix groups have the required property.     

New Families of Semi-Regular Relative Difference Sets

We give two constructions for semi-regular relative difference sets (RDSs) in groups whose order is not a prime power, where the order u of the forbidden subgroup is greater than 2. No such RDSs were previously known. We use examples from the first construction to produce semi-regular RDSs in groups whose order can contain more than two distinct prime factors. For u greater than 2 these are the first such RDSs, and for u=2 we obtain new examples.     

Toward the classification of biangular harmonic frames

Equiangular tight frames (ETFs) and biangular tight frames (BTFs) – sets of unit vectors with basis-like properties whose pairwise absolute inner products admit exactly one or two values, respectively – are useful for many applications. A well-understood class of ETFs are those which manifest as harmonic frames – vector sets defined in terms of the characters of finite abelian groups – because they are characterized by combinatorial objects called difference sets.This work is dedicated to the study of the underlying combinatorial structures of harmonic BTFs. We show that if a harmonic frame is generated by a divisible difference set, a partial difference set or by a special structure with certain Gauss summing properties – all three of which are generalizations of difference sets that fall under the umbrella term “bidifference set” – then it is either a BTF or an ETF. However, we also show that the relationship between harmonic BTFs and bidifference sets is not as straightforward as the correspondence between harmonic ETFs and difference sets, as there are examples of bidifference sets that do not generate harmonic BTFs. In addition, we study another class of combinatorial structures, the nested divisible difference sets, which yields an example of a harmonic BTF that is not generated by a bidifference set.     

Constructions of Partial Difference Sets and Relative Difference Sets on p-Groups

By using some finite local rings, we construct some new partialdifference sets and relative difference sets on pgroups wherep is any prime. When p = 2, some of partial difference setsconstructed are reversible difference sets which include Dillon'sdifference sets.     

On central difference sets in certain non-abelian 2-groups

In this note, we define the class of finite groups of Suzuki type, which are non-abelian groups of exponent 4 and class 2 with special properties. A group G of Suzuki type with |G|=2^2s always possesses a non-trivial difference set. We show that if s is odd, G possesses a central difference set, whereas if s is even, G has no non-trivial central difference set.     

Finite difference simulation of elastic wave propagation through 3D heterogeneous multiscale media based on locally refined grids

To simulate the interaction of seismic waves with microheterogeneities (like cavernous/fractured reservoirs), a finite difference technique based on grids locally refined in time and space is used. These grids are used because the scales of heterogeneities in the reference medium and in the reservoir are different. Parallel computations based on domain decomposition of the target area into elementary subdomains in both the reference medium (a coarse grid) and the reservoir (a fine grid) are performed. Each subdomain is assigned to a specific processor unit, which forms two groups: one for the reference medium, and the other for the reservoir. The data exchange between the groups within a processor unit is performed by non-blocking iSend/iReceive MPI commands. The data exchange between the two groups is performed simultaneously with coupling the coarse and a fine grids, and is controlled by a specially chosen processor unit. The results of a numerical simulation for a realistic model of fracture corridors are presented and discussed.     

New difference sets in nonabelian groups of order 100

In two groups of order 100 new difference sets are constructed. The existence of a difference set in one of them has not been known. The correspondence between a (100, 45, 20) symmetric design having regular automorphism group and a difference set with the same parameters has been used for the construction. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 424–434, 2001     

Gauss laws in the sense of Bernstein and uniqueness of embedding into convolution semigroups on quantum groups and braided groups

The aim of this note is to characterize certain probability laws on a class of quantum groups or braided groups that will be called nilpotent. First, we introduce a braided analogue of the Heisenberg-Weyl group, which shall serve as a standard example. We determine functional on the braided line and on this group satisfying an analogue of the Bernstein property (see [3]). i.e. that the sum and difference of independent Gaussian random variables are also independent. We also study continuous convolution semigroups on nilpotent quantum groups and braided groups. We extend to nilpotent quantum groups and braided groups recent results proving the uniqueness of the embedding of an infinitely divisible probability law in a continuous convolution semigroup for simply connected nilpotent Lie groups.     

Relative difference sets fixed by inversion and Cayley graphs

Using graph theoretical technique, we present a construction of a (30,2,29,14)-relative difference set fixed by inversion in the smallest finite simple group—the alternating group A₅. To our knowledge this is the first example known of relative difference sets in the finite simple groups with a non-trivial forbidden subgroup. A connection is then established between some relative difference sets fixed by inversion and certain antipodal distance-regular Cayley graphs. With the connection, several families of antipodal distance-regular Cayley graphs which are coverings of complete graphs are presented.     

Symmetry preserving numerical schemes for partial differential equations and their numerical tests

The method of equivariant moving frames is used to construct symmetry preserving finite difference schemes of partial differential equations invariant under finite-dimensional symmetry groups. Invariant numerical schemes for a heat equation with logarithmic source and the spherical Burgers' equation are obtained. Numerical tests show how invariant schemes can be more accurate than standard discretizations.