On the F-fundamental group scheme

Let X be a smooth projective variety defined over a perfect field k of positive characteristic, and let FX be the absolute Frobenius morphism of X. For any vector bundle E→X, and any polynomial g with non-negative integer coefficients, define the vector bundle L source" title="View the MathML source" src="http://ars.sciencedirect.com/content/image/1-s2.0-S000744970900089X-si3.gif"> using the powers of FX and the direct sum operation. We construct a neutral Tannakian category using the vector bundles with the property that there are two distinct polynomials f and g with non-negative integer coefficients such that L source" title="View the MathML source" src="http://ars.sciencedirect.com/content/image/1-s2.0-S000744970900089X-si5.gif">. We also investigate the group scheme defined by this neutral Tannakian category.     

Malliavin's theorem for weak synthesis on nonabelian groups

Malliavin's celebrated theorem on the failure of spectral synthesis for the Fourier algebra A(G) on nondiscrete abelian groups was strengthened to give failure of weak synthesis by Parthasarathy and Varma. We extend this to nonabelian groups by proving that weak synthesis holds for A(G) if and only if G is discrete. We give the injection theorem and the inverse projection theorem for weak X-spectral synthesis, as well as a condition for the union of two weak X-spectral sets to be weak X-spectral for an A(G)-submodule X of VN(G). Relations between weak X-synthesis in A(G) and A(G×G) and the Varopoulos algebra V(G) are explored. The concept of operator synthesis was introduced by Arveson. We extend several recent investigations on operator synthesis by defining and studying, for a V^∞(G)-submodule M of B(L²(G)), sets of weak M-operator synthesis. Relations between X-Ditkin sets and M-operator Ditkin sets and between weak X-spectral synthesis and weak M-operator synthesis are explored.     

Generalized Glimm scheme to the initial boundary value problem of hyperbolic systems of balance laws

In this paper we provide a generalized version of the Glimm scheme to establish the global existence of weak solutions to the initial-boundary value problem of 2×2 hyperbolic systems of conservation laws with source terms. We extend the methods in [J.B. Goodman, Initial boundary value problem for hyperbolic systems of conservation laws, Ph.D. Dissertation, Stanford University, 1982; J.M. Hong, An extension of Glimm’s method to inhomogeneous strictly hyperbolic systems of conservation laws by “weaker than weak” solutions of the Riemann problem, J. Differential Equations 222 (2006) 515-549] to construct the approximate solutions of Riemann and boundary Riemann problems, which can be adopted as the building block of approximate solutions for our initial-boundary value problem. By extending the results in [J. Glimm, Solutions in the large for nonlinear hyperbolic systems of equations, Comm. Pure Appl. Math. 18 (1965) 697-715] and showing the weak convergence of residuals, we obtain stability and consistency of the scheme.     

Global existence and asymptotic behavior for a coupled hyperbolic system with localized damping

In this paper we investigate the global existence and energy decay rate for the solution of a coupled hyperbolic system. The semi-explicit energy decay rate is established by using piecewise multiplier techniques and weighted integral inequality. We extend the energy decay result in Alabau-Boussouira [F. Alabau-Boussouira, Convexity and weighted integral inequalities for energy decay rates of nonlinear dissipative hyperbolic systems, Appl. Math. Optim. 51 (2005) 61-105] for a single equation to the coupled hyperbolic system.     

Monodromy for principal bundles

Given a strongly semistable principal bundle E_G over a curve, in Biswas et al. (2006) [4], a group-scheme for it was constructed, which was named as the monodromy group-scheme. Here we extend the construction of the monodromy group-scheme to principal bundles over higher dimensional varieties.     

Model selection by sequentially normalized least squares

Model selection by means of the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estimation. We introduce a new criterion based on sequentially minimized squared deviations, which are smaller than both the usual least squares and the squared prediction errors used in PLS. We also prove that our criterion has a probabilistic interpretation as a model which is asymptotically optimal within the given class of distributions by reaching the lower bound on the logarithmic prediction errors, given by the so called stochastic complexity, and approximated by BIC. This holds when the regressor (design) matrix is non-random or determined by the observed data as in AR models. The advantages of the criterion include the fact that it can be evaluated efficiently and exactly, without asymptotic approximations, and importantly, there are no adjustable hyper-parameters, which makes it applicable to both small and large amounts of data.     

Rational approximation in the complex plane using a τ-method and computer algebra

Numerous versions of the Lanczos τ-methods have been extensively used to produce polynomial approximations for functions verifying a linear differential equation with polynomial coefficients. In the case of an initial-value problem, an adapted τ-method based on Chebyshev series and the use of symbolic computation lead to a rational approximation of the solution on a region of the complex plane. Numerical examples show that the simplicity of the method does not prevent a high accuracy of results. This revised version was published online in June 2006 with corrections to the Cover Date.     

Effective computation of periodic orbits and bifurcation diagrams in delay equations

Summary By employing a numerical method which uses only rather classical tools of Numerical Analysis such as Newton's method and routines for ordinary differential equations, unstable periodic solutions of differential-difference equations can be computed. The method is applied to determine bifurcation diagrams with backward bifurcation.Dedicated to Professor Lothar Collatz on the occasion of his 70th birthdayThis paper has been read at the Conference of Numerical Mathematicians, Zeist, The Netherlands, October 12–15, 1979     

Computations in choice groupoids

Defining achoice as a mapping of the subsets of a setX into their respective subsets, a one-to-one (and LE" BORDER="0">naturallyLE" BORDER="0">) corresponding binary operation,sequential choice, is identified under which the power set ofX is closed as achoice groupoid. A complete logical diagram is given, exhibiting all the implications between conjunctions of the seven conditions: (1) idempotence, (2) LE" BORDER="0">consistency,LE" BORDER="0"> (3) LE" BORDER="0">absorbence,LE" BORDER="0"> and (4) homomorphism of a choice, and (5) commutativity, (6) associativity, and (7) LE" BORDER="0">path-independenceLE" BORDER="0"> of the corresponding sequential choice.     

On the order of composite multistep methods for ordinary differential equations

Summary In this paper, a general class ofk-step methods for the numerical solution of ordinary differential equations is discussed. It is shown that methods with order of consistencyq have order of convergence (q+1) if a very simple condition is satisfied. This result gives a new aspect to previous results of Spijker; it also serves as a starting point for a new theory of cyclick-step methods, completing an approach of Donelson and Hansen. It facilitates the practical determination of high-order cyclick-step methods, especially of stiffly stable,k-step methods.