A Class of Projection Methods for General Variational Inequalities

In this paper, we consider and analyze a new class of projection methods for solving pseudomonotone general variational inequalities using the Wiener-Hopf equations technique. The modified methods converge for pseudomonotone operators. Our proof of convergence is very simple as compared with other methods. The proposed methods include several known methods as special cases.     

Contact Classification of Linear Ordinary Differential Equations: I

It is known that a linear ordinary differential equation of order n3 can be transformed to the Laguerre–Forsyth form y ⁽ⁿ⁾= _i=3 ⁿ a _n–i (x)y ^(n–i) by a point transformation of variables. The classification of equations of this form in a neighborhood of a regular point up to a contact transformation is given.     

On Some Extremal Properties of Lagrange Interpolatory Polynomials

In this paper, we will show that Lagrange interpolatory polynomials are optimal for solving some approximation theory problems concerning the finding of linear widths.In particular, we will show that

Full-size image

, where _n is a set of the linear operators with finite rank n+1 defined on −1,1], and where _n+1 denotes the set of polynomials p=∑_i=0ⁿ⁺¹a_ixⁱ of degreen+1 such that a_n+11. The infimum is achieved for Lagrange interpolatory polynomial for nodes .     

The Proalgebraic Completion of Rigid Groups

A finitely generated group is called representation rigid (briefly, rigid) if for every n, has only finitely many classes of simple representations in dimension n. Examples include higher rank S-arithmetic groups. By Margulis super rigidity, the latter have a stronger property: they are representation super rigid; i.e., their proalgebraic completion is finite dimensional. We construct examples of nonlinear rigid groups which are not super rigid, and which exhibit every possible type of infinite dimensionality. Whether linear representation rigid groups are super rigid remains an open question.     

On Clique-Transversals and Clique-Independent Sets

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A clique-independent set is a subset of pairwise disjoint cliques of G. Denote by _C (G) and _C (G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when _C (H)= _C (H), for every induced subgraph H of G. In this paper, we prove that every graph not containing a 4-wheel nor a 3-fan as induced subgraphs and such that every odd cycle of length greater than 3 has a short chord is clique-perfect. The proof leads to polynomial time algorithms for finding the parameters _C (G) and _C (G), for graphs belonging to this class. In addition, we prove that to decide whether or not a given subset of vertices of a graph is a clique-transversal is Co-NP-Complete. The complexity of this problem has been mentioned as unknown in the literature. Finally, we describe a family of highly clique-imperfect graphs, that is, a family of graphs G whose difference _C (G)– _C (G) is arbitrarily large.     

Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa

This article improves results of Hamada, Helleseth and Maekawa on minihypers in projective spaces and linear codes meeting the Griesmer bound.In [10,12],it was shown that any -minihyper, with , where , is the disjoint union of points, lines,..., -dimensional subspaces. For q large, we improve on this result by increasing the upper bound on non-square, to non-square, square, , and (4) for square, p prime, p<3, to . In the case q non-square, the conclusion is the same as written above; the minihyper is the disjoint union of subspaces. When q is square however, the minihyper is either the disjoint union of subspaces, or the disjoint union of subspaces and one subgeometry . For the coding-theoretical problem, our results classify the corresponding codes meeting the Griesmer bound.     

Finite Linear Spaces II

Batten and Beutelspacher have characterized Finite Linear Spaces with lines of size n,n + 1 and n + 2, and with v (n + 1)²for n 22, and some of the cases for smaller n. In this article, using the structuredapproach we presented in our earlier article [8], we complete this characterization for smalln.     

High-order accurate dissipative weighted compact nonlinear schemes

Based on the method deriving dissipative compact linear schemes (DCS), novel high-order dissipative weighted compact nonlinear schemes (DWCNS) are developed. By Fourier analysis,the dissipative and dispersive features of DWCNS are discussed. In view of the modified wave number, the DWCNS are equivalent to the fifth-order upwind biased explicit schemes in smooth regions and the interpolations at cell-edges dominate the accuracy of DWCNS. Boundary and near boundary schemes are developed and the asymptotic stabilities of DWCNS on both uniform and stretching grids are analyzed. The multi-dimensional implementations for Euler and Navier-Stokes equations are discussed. Several numerical inviscid and viscous results are given which show the good performances of the DWCNS for discontinuities capturing, high accuracy for boundary layer resolutions, good convergent rates (the root-mean-square of residuals approaching machine zero for solutions with strong shocks) and especially the damping effect on the spudous oscillations which were found in the solutions obtained by TVD and ENO schemes.