Mathematical and numerical analysis of a simplified time-dependent viscoelastic flow

A time-dependent model corresponding to an Oldroyd-B viscoelastic fluid is considered, the convective terms being disregarded. Global existence in time is proved in Banach spaces provided the data are small enough, using the implicit function theorem and a maximum regularity property for a three fields Stokes problem. A finite element discretization in space is then proposed. Existence of the numerical solution is proved for small data, so as a priori error estimates, using again an implicit function theorem. Supported by the Swiss National Science Foundation. Fellowship PBEL2–114311.     

Separating points of measures on effect algebras

We prove the existence of separating points for every countable family of nonatomic σ-additive modular measures on a σ-complete lattice ordered effect algebra.      

A second order numerical scheme for the solution of the one-dimensional Boussinesq equation

A predictor–corrector (P-C) scheme is applied successfully to a nonlinear method arising from the use of rational approximants to the matrix-exponential term in a three-time level recurrence relation. The resulting nonlinear finite-difference scheme, which is analyzed for local truncation error and stability, is solved using a P-C scheme, in which the predictor and the corrector are explicit schemes of order 2. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. The behaviour of the P-C/MPC schemes is tested numerically on the Boussinesq equation already known from the bibliography free of boundary conditions. The numerical results are derived for both the bad and the good Boussinesq equation and conclusions from the relevant known results are derived.      

Results of the maximum genus of graphs

In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.     

Lefschetz–Verdier Trace Formula and a Generalization of a Theorem of Fujiwara

The goal of this paper is to generalize a theorem of Fujiwara (Deligne’s conjecture) to the situation appearing in a joint work [KV] with David Kazhdan on the global Langlands correspondence over function fields. Moreover, our proof is more elementary than the original one and stays in the realm of ordinary algebraic geometry, that is, does not use rigid geometry. We also give a proof of the Lefschetz–Verdier trace formula and of the additivity of filtered trace maps, thus making the paper essentially self-contained. The work was supported by the Israel Science Foundation (Grant No. 555/04) Received: May 2005 Accepted: August 2005     

On structure of small contractions of odd dimensional projective varieties

Let X be a smooth projective variety of dimension 2k-1 (k≥3) over the complex number field. Assume that fR: X→Y is a small contraction such that every irreducible component Ei of the exceptional locus of fR is a smooth subvariety of dimension k. It is shown that each Ei is isomorphic to the k-dimensional projective space Pk, the k-dimensional hyperquadric surface Qk in Pk 1, or a linear Pk-1-bundle over a smooth curve.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Analysis of heterojunction resonant cavity-enhanced Schottky photodiodes by using two-valley transport model

The article concerns heterojunction resonant cavity-enhanced (RCE) Schottky photodiodes with GaAs in the absorption layer. The quantum efficiency and linear pulse response have thoroughly been analysed. For the first time, the response of a heterojunction photodiode has been modelled by the phenomenological model for a two-valley semiconductor. The results obtained have shown that the satellite valleys, as well as the parasitic time constant, significantly influence the response and, accordingly, have to be taken into account when analysing and optimizing RCE photodetectors.     

Polygaussian Approximation and Adaptive Processing of an Electrocardiographic Signal Against Interference Background

We present the results of a study and substantiation of the method of polygaussian approximation of an electrocardiographic (ECG) signal against interference background during computer analysis of that signal. It is proposed to use adaptive processing of ECG signals, which allows one to increase the signal-to-interference ratio by over 7 dB.