ID-based cryptography using symmetric primitives

A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption schemes. We use a general technique which is applied to multi-signature versions of the one-time signature scheme of Lamport and to a public key encryption scheme based on a symmetric block cipher which we present. We make use of one-way functions and block designs with properties related to cover-free families to optimise the efficiency of our schemes.      

Commutative Association Schemes Whose Symmetrizations Have Two Classes

If a symmetric association scheme of class two is realized as the symmetrization of a commutative association scheme, then it either admits a unique symmetrizable fission scheme of class three or four, or admits three fission schemes, two of which are class three and one is of class four. We investigate the classification problem for symmetrizable (commutative) association schemes of two-class symmetric association schemes. In particular, we give a classification of association schemes whose symmetrizations are obtained from completely multipartite strongly regular graphs in the notion of wreath product of two schemes. Also the cyclotomic schemes associated to Paley graphs and their symmetrizable fission schemes are discussed in terms of their character tables.     

Linked systems of symmetric group divisible designs

We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which are linked. Several examples of linked systems of symmetric group divisible designs are provided.     

A Class of Nested Iteration Schemes for Linear Systems with a Coefficient Matrix with a Dominant Positive Definite Symmetric Part

We present a class of nested iteration schemes for solving large sparse systems of linear equations with a coefficient matrix with a dominant symmetric positive definite part. These new schemes are actually inner/outer iterations, which employ the classical conjugate gradient method as inner iteration to approximate each outer iterate, while each outer iteration is induced by a convergent and symmetric positive definite splitting of the coefficient matrix. Convergence properties of the new schemes are studied in depth, possible choices of the inner iteration steps are discussed in detail, and numerical examples from the finite-difference discretization of a second-order partial differential equation are used to further examine the effectiveness and robustness of the new schemes over GMRES and its preconditioned variant. Also, we show that the new schemes are, at least, comparable to the variable-step generalized conjugate gradient method and its preconditioned variant.     

A combinatorial approach to transitive extensions of generously unitransitive permutation groups

Motivated by symmetric association schemes (which are known to approximate generously unitransitive group actions), we formulate combinatorial approximations to transitive extensions of generously unitransitive permutation groups. Specifically, the notions of compatible and coherent partitions are suggested and investigated in terms of the orbits of an ambient group (H, Ω) on the k‐subsets of Ω, k=2, 3, 4. We apply these ideas to investigate transitive extensions of the automorphism groups of the classical Johnson and Hamming schemes. In the latter case, we further provide algorithmic details and computer‐generated data for the particular series of Hamming schemes H(m, 3), m⩾2. Finally, our approach is compared to the concept of a symmetric association scheme on triples in the sense of Mesner and Bhattacharya. © 2010 Wiley Periodicals, Inc. J Combin Designs 18:369–391, 2010     

Biorthogonal bases of compactly supported wavelets

Orthonormal bases of compactly supported wavelet bases correspond to subband coding schemes with exact reconstruction in which the analysis and synthesis filters coincide. We show here that under fairly general conditions, exact reconstruction schemes with synthesis filters different from the analysis filters give rise to two dual Riesz bases of compactly supported wavelets. We give necessary and sufficient conditions for biorthogonality of the corresponding scaling functions, and we present a sufficient conditions for the decay of their Fourier transforms. We study the regularity of these biorthogonal bases. We provide several families of examples, all symmetric (corresponding to “linear phase” filters). In particular we can construct symmetric biorthogonal wavelet bases with arbitraily high preassigned regularity; we also show how to construct symmetric biorthogonal wavelet bases “close” to a (nonsymmetric) orthonormal basis.     

Three-Class Association Schemes

We study (symmetric) three-class association schemes. The graphs with four distinct eigenvalues which are one of the relations of such a scheme are characterized. We also give an overview of most known constructions, and obtain necessary conditions for existence. A list of feasible parameter sets on at most 100 vertices is generated.     

块Toeplitz方程组的快速块Gauss-Seidel迭代算法

本文研究块Toeplitz方程组的块Gauss-Seidel迭代算法。我们首先讨论了块三角Toeplitz矩阵的一些性质,然后给出了求解块三角Toeplitz矩阵逆的快速算法,由此而得到了求解块Toeplitz方程组的快速块Gauss-Seidel迭代算法,最后证明了当系数矩阵为对称正定和H-矩阵时该方法都收敛,数值例子验证了方法的收敛性。     

Four-class skew-symmetric association schemes

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we investigate 4-class skew-symmetric association schemes. In recent work by the first author it was discovered that their character tables fall into three types. We now determine their intersection matrices. We then determine the character tables for 4-class skew-symmetric pseudocyclic association schemes, the only known examples of which are cyclotomic schemes. As a result, we answer a question raised by S.Y. Song in 1996. We characterize and classify 4-class imprimitive skew-symmetric association schemes. We also prove that none of 2-class Johnson schemes admits a 4-class skew-symmetric fission scheme. Based on three types of character tables above, a short list of feasible parameters is generated.     

Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems

Nonsymmetric saddle point problems arise in a wide variety of applications in computational science and engineering. The aim of this paper is to discuss the numerical behavior of several nonsymmetric iterative methods applied for solving the saddle point systems via the Schur complement reduction or the null-space projection approach. Krylov subspace methods often produce the iterates which fluctuate rather strongly. Here we address the question whether large intermediate approximate solutions reduce the final accuracy of these two-level (inner–outer) iteration algorithms. We extend our previous analysis obtained for symmetric saddle point problems and distinguish between three mathematically equivalent back-substitution schemes which lead to a different numerical behavior when applied in finite precision arithmetic. Theoretical results are then illustrated on a simple model example.     

The G-biliaison class of symmetric determinantal schemes

We consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them. We show that these schemes are G-bilinked to a linear variety of the same dimension. In particular, they can be obtained from a linear variety by a finite sequence of ascending G-biliaisons on some determinantal schemes. We describe the biliaisons explicitly in the proof of Theorem 2.3. In particular, it follows that these schemes are glicci.     

Entropy stable schemes for initial-boundary-value conservation laws

We consider initial-boundary-value problems for systems of conservation laws and design entropy stable finite difference schemes to approximate them. The schemes are shown to be entropy stable for a large class of systems that are equipped with a symmetric splitting, derived from the entropy formulation. Numerical examples for the Euler equations of gas dynamics are presented to illustrate the robust performance of the proposed method.     

Three-Class Association Schemes on Galois Rings in Characteristic 4

Small feasible parameters for ``nontrivial' symmetric three-class association schemes were listed in a paper of van Dam. This work addresses the question of existence for three-class association schemes on 4ⁿ vertices. Several families of three-class symmetric schemes are constructed in association schemes of Galois rings of characteristic 4.     

Multidimensional first and second order symmetric Strang splitting for hyperbolic systems

We propose an algebraic basis for symmetric Strang splitting for first and second order accurate schemes for hyperbolic systems in N dimensions. Examples are given for two and three dimensions. Optimal stability is shown for symmetric systems. Lack of strong stability is shown for a non-symmetric example. Some numerical examples are presented for some Euler-like constant coefficient problems.     

Asymptotics of Plancherel measures for the infinite-dimensional unitary group

We study a two-dimensional family of probability measures on infinite Gelfand-Tsetlin schemes induced by a distinguished family of extreme characters of the infinite-dimensional unitary group. These measures are unitary group analogs of the well-known Plancherel measures for symmetric groups.We show that any measure from our family defines a determinantal point process on Z₊×Z, and we prove that in appropriate scaling limits, such processes converge to two different extensions of the discrete sine process as well as to the extended Airy and Pearcey processes.     

三级四阶显式辛R-K-N格式的完全构造

s级p阶辛Runge-Kutta-Nystr\"om(R-K-N)方法的一种充要条件是用关于参数的非线性方程组来表示的,辛R-K-N格式的构造问题因而转化为该方程组的求解问题. 在一些特殊的限定条件下, 已有该方程组在s=3,p=4时的两组解,即得到了两个三级四阶显式辛格式. 对于s=3,p=4情形,基于吴方法,利用计算机代数系统Maple及软件包wsolve给出了对应的非线性方程组的全部解, 这样就构造了所有的三级四阶显式辛R-K-N格式, 并证明了三级四阶显式辛R-K-N方法所满足的条件方程有冗余. 数值实验结果显示出新的辛格式在一定的条件下有着较好的误差精度.     

Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach

We present in this paper an integer diagonalization approach for deriving new lower bounds for general quadratic integer programming problems. More specifically, we introduce a semiunimodular transformation in order to diagonalize a symmetric matrix and preserve integral property of the feasible set at the same time. Via the semiunimodular transformation, the resulting separable quadratic integer program is a relaxation of the nonseparable quadratic integer program. We further define the integer diagonalization dual problem to identify the best semiunimodular transformation and analyze some basic properties of the set of semiunimodular transformations for a rational symmetric matrix. In particular, we present a complete characterization of the set of all semiunimodular transformations for a nonsingular 2×2 symmetric matrix. We finally discuss Lagrangian relaxation and convex relaxation schemes for the resulting separable quadratic integer programming problem and compare the tightness of different relaxation schemes.     

A general mixed covolume framework for constructing conservative schemes for elliptic problems

We present a general framework for the finite volume or covolume schemes developed for second order elliptic problems in mixed form, i.e., written as first order systems. We connect these schemes to standard mixed finite element methods via a one-to-one transfer operator between trial and test spaces. In the nonsymmetric case (convection-diffusion equation) we show one-half order convergence rate for the flux variable which is approximated either by the lowest order Raviart-Thomas space or by its image in the space of discontinuous piecewise constants. In the symmetric case (diffusion equation) a first order convergence rate is obtained for both the state variable (e.g., concentration) and its flux. Numerical experiments are included.

     

A family of explicit parallel Runge-Kutta-Nyström methods

A procedure for the construction of high-order explicit parallel Runge-Kutta-Nyström (RKN) methods for solving second-order nonstiff initial value problems (IVPs) is analyzed. The analysis reveals that starting the procedure with a reference symmetric RKN method it is possible to construct high-order RKN schemes which can be implemented in parallel on a small number of processors. These schemes are defined by means of a convex combination of k disjoint s_i-stage explicit RKN methods which are constructed by connecting s_i steps of a reference explicit symmetric method. Based on the reference second-order Störmer-Verlet methods we derive a family of high-order explicit parallel schemes which can be implemented in variable-step codes without additional cost. The numerical experiments carried out show that the new parallel schemes are more efficient than some sequential and parallel codes proposed in the scientific literature for solving second-order nonstiff IVPs.     

Parabolic subgroups of semisimple Lie groups and Einstein solvmanifolds

In this paper, we study the solvmanifolds constructed from any parabolic subalgebras of any semisimple Lie algebras. These solvmanifolds are naturally homogeneous submanifolds of symmetric spaces of noncompact type. We show that the Ricci curvatures of our solvmanifolds coincide with the restrictions of the Ricci curvatures of the ambient symmetric spaces. Consequently, all of our solvmanifolds are Einstein, which provide a large number of new examples of noncompact homogeneous Einstein manifolds. We also show that our solvmanifolds are minimal, but not totally geodesic submanifolds of symmetric spaces.