Barsotti–Tate groups and p-adic representations of the fundamental group scheme

On a scheme S over a base scheme B we study the category of locally constant BT groups, i.e. groups over S that are twists, in the flat topology, of BT groups defined over B. These groups generalize p-adic local systems and can be interpreted as integral p-adic representations of the fundamental group scheme of S/B (classifying finite flat torsors on the base scheme) when such a group exists. We generalize to these coefficients the Katz correspondence for p-adic local systems and show that they are closely related to the maximal nilpotent quotient of the fundamental group scheme.     

Nonlinear Galerkin method and two-step method for the Navier-Stokes equations

This article represents a new nonlinear Galerkin scheme for the Navier-Stokes equations. This scheme consists of a nonlinear Galerkin finite element method and a two-step difference method. Moreover, we also provide a Galerkin scheme. By convergence analysis, two numerical schemes have the same second-order convergence accuracy for the spatial discretization and time discretization if H is chosen such that H = O(h^2/3). However, the nonlinear Galerkin scheme is simpler than the Galerkin scheme, namely, this scheme can save a large amount of computational time. © 1996 John Wiley & Sons, Inc.     

New Colored Visual Secret Sharing Schemes

Visual secretsharing (VSS) schemes are used to protect the visual secret bysending n transparencies to different participantsso that k-1 or fewer of them have no informationabout the original image, but the image can be seen by stackingk or more transparencies. However, the revealedsecret image of a conventional VSS scheme is just black and white.The colored k out of n VSS scheme sharinga colored image is first introduced by Verheul and Van Tilborg[1]. In this paper, a new construction for the colored VSS schemeis proposed. This scheme can be easily implemented on basis ofa black & white VSS scheme and get much better block lengththan the Verheul-Van Tilborg scheme.     

A numerical technique based on B-spline for a class of time-fractional diffusion equation

This paper presents an efficient numerical technique for solving a class of time-fractional diffusion equation. The time-fractional derivative is described in the Caputo form. The L1 scheme is used for discretization of Caputo fractional derivative and a collocation approach based on sextic B-spline basis function is employed for discretization of space variable. The unconditional stability of the fully-discrete scheme is analyzed. Two numerical examples are considered to demonstrate the accuracy and applicability of our scheme. The proposed scheme is shown to be sixth order accuracy with respect to space variable and (2 − α)-th order accuracy with respect to time variable, where α is the order of temporal fractional derivative. The numerical results obtained are compared with other existing numerical methods to justify the advantage of present method. The CPU time for the proposed scheme is provided.     

A high order method for the numerical solution of two-point boundary value problems

A one step finite difference scheme of order 4 for the numerical solution of the general two-point boundary value problemy=f(t,y),a t b, withg(y(a),y(b))=0 is presented. The global discretization error of the scheme is shown, in sufficiently smooth cases, to have an asymptotic expansion containing even powers of the mesh size only. This justifies the use of Richardson extrapolation (or deferred correction) to obtain high orders of accuracy. A theoretical examination of the new scheme for large systems of equations shows that for a given mesh size it generally requires about twice as much work as the Keller box scheme. However, the expectation of higher accuracy usually justifies this extra computational effort. Some numerical results are given which confirm these expectations and show that the new scheme can be generally competitive with the box scheme.     

On a difference scheme of exponential type for a nonlinear singular perturbation problem

Summary A difference scheme of exponential type for solving a nonlinear singular perturbation problem is analysed. Although this scheme is not of monotone type, aL ¹ convergence result is obtained. Relations between this scheme and Engquist-Osher scheme are also discussed.     

Convergence of a non-monotone scheme for Hamilton–Jacobi–Bellman equations with discontinous initial data

We prove the convergence of a non-monotonous scheme for a one-dimensional first order Hamilton–Jacobi–Bellman equation of the form v _t + max _α (f(x, α)v _x ) = 0, v(0, x) = v ₀(x). The scheme is related to the HJB-UltraBee scheme suggested in Bokanowski and Zidani (J Sci Comput 30(1):1–33, 2007). We show for general discontinuous initial data a first-order convergence of the scheme, in L ¹-norm, towards the viscosity solution. We also illustrate the non-diffusive behavior of the scheme on several numerical examples.     

A new approximation for the generalized fractional derivative and its application to generalized fractional diffusion equation

In this paper, we derive a fourth order approximation for the generalized fractional derivative that is characterized by a scale function z(t) and a weight function w(t) . Combining the new approximation with compact finite difference method, we develop a numerical scheme for a generalized fractional diffusion problem. The stability and convergence of the numerical scheme are proved by the energy method, and it is shown that the temporal and spatial convergence orders are both 4. Several numerical experiments are provided to illustrate the efficiency of our scheme.     

Comments on Harn–Lin’s cheating detection scheme

Detection of cheating and identification of cheaters in threshold schemes has been well studied, and several solid solutions have been provided in the literature. This paper analyses Harn and Lin’s recent work on cheating detection and identification of cheaters in Shamir’s threshold scheme. We will show that, in a broad area, Harn–Lin’s scheme fails to detect cheating and even if the cheating is detected cannot identify the cheaters. In particular, in a typical Shamir (t, n)-threshold scheme, where n = 2t − 1 and up to t − 1 of participants are corrupted, their scheme neither can detect nor can identify the cheaters. Moreover, for moderate size of groups their proposed cheaters identification scheme is not practical.     

Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98

In 1 Matsumoto and Imai developed a new public key scheme, called C*, for enciphering or signing. (This scheme is completely different from and should not be mistaken with another scheme of Matsumoto and Imai developed in 1983 in 7 and broken in 1984 in 8). No attacks have been published as yet for this scheme. However, in this paper, we will see that—for almost all keys—almost every cleartext can be found from its ciphertext after only approximately m ² n ⁴ log n computations, where m is the degree of the chosen field K and mn is the number of bits of text. Moreover, for absolutely all keys that give a practical size for the messages, it will be possible to find almost all cleartexts from the corresponding ciphertexts after a feasible computation. Thus the algorithm of 1 is insecure.     

A unified three point approximating subdivision scheme

In this paper,we propose a three point approximating subdivision scheme,with three shape parameters,that unifies three different existing three point approximating schemes.Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed.The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.     

Trianalytic Subvarieties of the Hilbert Scheme of Points on a K3 Surface

Let X be a hyperk?hler manifold. Trianalytic subvarieties of X are subvarieties which are complex analytic with respect to all complex structures induced by the hyperk?hler structure. Given a K3 surface M, the Hilbert scheme classifying zero-dimensional subschemes of M admits a hyperk?hler structure. We show that for M generic, there are no trianalytic subvarieties of the Hilbert scheme. This implies that a generic deformation of the Hilbert scheme of K3 has no proper complex subvarieties. Submitted: May 1997, Revised version: December 1998     

A factorization method for q-Racah polynomials

We develop a factorization method for q-Racah polynomials. It is inspired by the approach to q-Hahn polynomials based on the q-Johnson scheme, but we do not use association scheme theory nor Gel'fand pairs but only manipulation of q-difference operators.     

A modular absolute bound condition for primitive association schemes

The well-known absolute bound condition for a primitive symmetric association scheme (X,S) gives an upper bound for |X| in terms of |S| and the minimal non-principal multiplicity of the scheme. In this paper we prove another upper bounds for |X| for an arbitrary primitive scheme (X,S). They do not depend on |S| but depend on some invariants of its adjacency algebra KS where K is an algebraic number field or a finite field. Partially supported by RFBR grants 07-01-00485, 08-01-00379 and 08-01-00640. The paper was done during the stay of the author at the Faculty of Science of Shinshu University.     

Commutativity of association schemes of prime square order having non-trivial thin closed subsets

Through a study of the structure of the modular adjacency algebra over a field of positive characteristic p for a scheme of prime order p and utilizing the fact that every scheme of prime order is commutative, we show that every association scheme of prime square order having a non-trivial thin closed subset is commutative. The second author was supported by Korea Research Foundation Grant (KRF-2006-003-00008).     

Secret sharing schemes with partial broadcast channels

In a conventional secret sharing scheme a dealer uses secure point-to-point channels to distribute the shares of a secret to a number of participants. At a later stage an authorised group of participants send their shares through secure point-to-point channels to a combiner who will reconstruct the secret. In this paper, we assume no point-to-point channel exists and communication is only through partial broadcast channels. A partial broadcast channel is a point-to-multipoint channel that enables a sender to send the same message simultaneously and privately to a fixed subset of receivers. We study secret sharing schemes with partial broadcast channels, called partial broadcast secret sharing schemes. We show that a necessary and sufficient condition for the partial broadcast channel allocation of a (t, n)-threshold partial secret sharing scheme is equivalent to a combinatorial object called a cover-free family. We use this property to construct a (t, n)-threshold partial broadcast secret sharing scheme with O(log n) partial broadcast channels. This is a significant reduction compared to n point-to-point channels required in a conventional secret sharing scheme. Next, we consider communication rate of a partial broadcast secret sharing scheme defined as the ratio of the secret size to the total size of messages sent by the dealer. We show that the communication rate of a partial broadcast secret sharing scheme can approach 1/O(log n) which is a significant increase over the corresponding value, 1/n, in the conventional secret sharing schemes. We derive a lower bound on the communication rate and show that for a (t,n)-threshold partial broadcast secret sharing scheme the rate is at least 1/t and then we propose constructions with high communication rates. We also present the case of partial broadcast secret sharing schemes for general access structures, discuss possible extensions of this work and propose a number of open problems.      

A fourth-order finite difference scheme for two-dimensional nonlinear elliptic partial differential equations

A finite difference scheme for the two-dimensional, second-order, nonlinear elliptic equation is developed. The difference scheme is derived using the local solution of the differential equation. A 13-point stencil on a uniform mesh of size h is used to derive the finite difference scheme, which has a truncation error of order h⁴. Well-known iterative methods can be employed to solve the resulting system of equations. Numerical results are presented to demonstrate the fourth-order convergence of the scheme. © 1995 John Wiley & Sons, Inc.     

On Two Iterative Least-Squares Finite Element Schemes for the Incompressible Navier–Stokes Problem

This paper is mainly devoted to a comparative study of two iterative least-squares finite element schemes for solving the stationary incompressible Navier–Stokes equations with velocity boundary condition. Introducing vorticity as an additional unknown variable, we recast the Navier–Stokes problem into a first-order quasilinear velocity–vorticity–pressure system. Two Picard-type iterative least-squares finite element schemes are proposed to approximate the solution to the nonlinear first-order problem. In each iteration, we adopt the usual L ² least-squares scheme or a weighted L ² least-squares scheme to solve the corresponding Oseen problem and provide error estimates. We concentrate on two-dimensional model problems using continuous piecewise polynomial finite elements on uniform meshes for both iterative least-squares schemes. Numerical evidences show that the iterative L ² least-squares scheme is somewhat suitable for low Reynolds number flow problems, whereas for flows with relatively higher Reynolds numbers the iterative weighted L ² least-squares scheme seems to be better than the iterative L ² least-squares scheme. Numerical simulations of the two-dimensional driven cavity flow are presented to demonstrate the effectiveness of the iterative least-squares finite element approach.     

Finite difference scheme for time-space fractional diffusion equation with fractional boundary conditions

In this paper, the finite difference scheme is developed for the time-space fractional diffusion equation with Dirichlet and fractional boundary conditions. The time and space fractional derivatives are considered in the senses of Caputo and Riemann-Liouville, respectively. The stability and convergence of the proposed numerical scheme are strictly proved, and the convergence order is O(τ^2−α+h²). Numerical experiments are performed to confirm the accuracy and efficiency of our scheme.     

Technical note: A fourth‐order finite difference scheme for a system of a 2D nonlinear elliptic partial differential equations

In this article we present a fourth‐order finite difference scheme, for a system of two‐dimensional, second‐order, nonlinear elliptic partial differential equations with mixed spatial derivative terms, using 13‐point stencils with a uniform mesh size h on a square region R subject to Dirichlet boundary conditions. The scheme of order h⁴ is derived using the local solution of the system on a single stencil. The resulting system of algebraic equations can be solved by iterative methods. The difference scheme can be easily modified to obtain formulae for grid points near the boundary. Computational results are given to demonstrate the performance of the scheme on some problems including Navier‐Stokes equations. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 43–53, 2001