The evolution dam problem for a compressible fluid with nonlinear Darcy's law and Dirichlet boundary condition

In this paper, we consider the evolution dam problem (P) related to a compressible fluid flow governed by a generalized nonlinear Darcy's law with Dirichlet boundary conditions on some part of the boundary. We establish existence of a solution for this problem. We choose a convenient regularized problem (P_?) for which we prove the existence and uniqueness of solution using the comparison Lemma 2.1 and the Schauder fixed‐point theorem. Then, we pass to the limit, when ? goes to 0, to get a solution for our problem. Moreover, we will see another approach for the incompressible case where we pass to the limit in (P), when α goes to 0, to get a solution.     

On the existence theorem for the barotronic motion of a compressible inviscid fluid in the half-space

Summary We give here an existence theorem, see Theorem 1.1,for the solution of the system of equations (1.1)that describes the motion of a compressible inviscid fluid in the half space. Moreover, we establish some sharp estimates, see Theorem 3.2,for the solution of the linear second order hyperbolic mixed problem (3.1)in terms of suitable norms of the coefficients. These estimates play a main rule here and in reference [BV3],where a first proof of Hadamard's classical well-posedness for the above nonlinear system of equations is given; see also [BV4].Here, we adapt and simplify the method followed in our previous paper [BV1].     

Critical exponents for large time asymptotics for fractal Hamilton-Jacobi-KPZ equations

Nonlinear and nonlocal evolution equations of the form u_t = ℒ︁u ± |∇u |^q, where ℒ︁ is a pseudodifferential operator representing the infinitesimal generator of a Lévy stochastic process, have been derived (see, [6]) as models for growing interfaces in the case when the continuous Brownian diffusion surface transport is augmented by a random hopping mechanism. The goal of this note is to report properties of solutions to this equation resulting from the interplay between the strengths of the “diffusive” linear and “hyperbolic” nonlinear terms, posed in the whole space R ^N , and supplemented with nonnegative, bounded, and sufficiently regular initial conditions. The full text of the paper, including complete proofs and other results, will appear in the Transactions of the American Mathematical Society. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Ricci Curvature and Bochner Formulas for Martingales

We generalize the classical Bochner formula for the heat flow on M to martingales on the path space PM and develop a formalism to compute evolution equations for martingales on path space. We see that our Bochner formula on PM is related to two‐sided bounds on Ricci curvature in much the same manner that the classical Bochner formula on M is related to lower bounds on Ricci curvature. Using this formalism, we obtain new characterizations of bounded Ricci curvature, new gradient estimates for martingales on path space, new Hessian estimates for martingales on path space, and streamlined proofs of the previous characterizations of bounded Ricci curvature.© 2018 Wiley Periodicals, Inc.     

On Infinite Camina Groups

A group G is called a Camina group if G′ ≠ G and each element x ∈ G?G′ satisfies the equation x ^G  = xG′, where x ^G denotes the conjugacy class of x in G. Finite Camina groups were introduced by Alan Camina in 1978, and they had been studied since then by many authors. In this article, we start the study of infinite Camina groups. In particular, we characterize infinite Camina groups with a finite G′ (see Theorem 3.1) and we show that infinite non-abelian finitely generated Camina groups must be nonsolvable (see Theorem 4.3). We also describe locally finite Camina groups, residually finite Camina groups (see Section 3) and some periodic solvable Camina groups (see Section 5).     

Towards an axiomatization of orderings

A set of six axioms for sets of relations is introduced. All well-known sets of specific orderings, such as linear and weak orderings, satisfy these axioms. These axioms impose criteria of closedness with respect to several operations, such as concatenation, substitution and restriction. For operational reasons and in order to link our results with the literature, it is shown that specific generalizations of the transitivity condition give rise to sets of relations which satisfy these axioms. Next we study minimal extensions of a given set of relations which satisfy the axioms. By this study we come to the fundamentals of orderings: They appear to be special arrangements of several types of disorder. Finally we notice that in this framework many new sets of relations have to be regarded as a set of orderings and that it is not evident how to minimize the number of these new sets of orderings.Symbol Table U universe (infinite countable) - D set of possible domains (finite and non-empty subsets of U) - R set of all considered relations - A empty relation on A - Id A identity relation on A - All A all relation on A - c complement operator (see Definition 2.1) - v converse operator (see Definition 2.1) - s symmetric part (see Definition 2.1) - asymmetric part (see Definition 2.1) - n non-diagonal part (see Definition 2.1) - r reflexive closure (see Definition 2.1) We gratefully acknowledge the support by the Co-operation Centre of Tilburg and Eindhoven Universities.     

Approximation of infinite matrices by matricial Haar polynomials

The main goal of this paper is to extend the approximation theorem of contiuous functions by Haar polynomials (see Theorem A) to infinite matrices (see Theorem C). The extension to the matricial framework will be based on the one hand on the remark that periodic functions which belong toL ^∞ (T) may be one-to-one identified with Toeplitz matrices fromB(l ₂) (see Theorem 0) and on the other hand on some notions given in the paper. We mention for instance:ms—a unital commutative subalgebra ofl ^∞,C(l ₂) the matricial analogue of the space of all continuous periodic functionsC(T), the matricial Haar polynomials, etc. In Section 1 we present some results concerning the spacems—a concept important for this generalization, the proof of the main theorem being given in the second section. Partially supported by EUROMMAT ICA1-CT-2000-70022. Partially supported by V-Stabi-RUM/1022123. Partially supported by EUROMMAT ICA1-CT-2000-70022 and V-Stabi-RUM/1022123.     

On property (β) in Banach lattices, Calderón-Lozanowskii and Orlicz-Lorentz spaces

The geometry of Calderón-Lozanowskii spaces, which are strongly connected with the interpolation theory, was essentially developing during the last few years (see [4, 9, 10, 12, 13, 17]). On the other hand many authors investigated property (β) in Banach spaces (see [7, 19, 20, 21, 25, 26]). The first aim of this paper is to study property (β) in Banach function lattices. Namely a criterion for property (β) in Banach function lattice is presented. In particular we get that in Banach function lattice property (β) implies uniform monotonicity. Moreover, property (β) in generalized Calderón-Lozanowskii function spaces is studied. Finally, it is shown that in Orlicz-Lorentz function spaces property (β) and uniform convexity coincide.     

Nonlinear evolution equations in Banach spaces

The evolution problem 0∈du/dt+A(t)u(t),u(s)=x, where theA(t) are nonlinear operators acting in a Banach space, is studied. Evolution operators are constructed from theA(t) under various assumptions. Basic properties of these evolution operators are established and their relationship to the evolution equation is determined. The results obtained extend several known existence theorems and provide generalized solutions of the evolution equation in more general cases. Sponsored by the United States Army under Contract No. DA-31-124-ARO-D-462. and in part by the Office of Naval Research under Contract N000-14-69-A-0200-4022. Reproduction in whole or in part is permitted for any purpose of the United States Government. This research was partially supported by the NSF Grant #GP-18127.     

On the regularity of flows with Ladyzhenskaya Shear‐dependent viscosity and slip or non‐slip boundary conditions

Navier‐Stokes equations with shear dependent viscosity under the classical non‐slip boundary condition have been introduced and studied, in the sixties, by O. A. Ladyzhenskaya and, in the case of gradient dependent viscosity, by J.‐L. Lions. A particular case is the well known Smagorinsky turbulence model. This is nowadays a central subject of investigation. On the other hand, boundary conditions of slip type seems to be more realistic in some situations, in particular in numerical applications. They are a main research subject. The existence of weak solutions u to the above problems, with slip (or non‐slip) type boundary conditions, is well known in many cases. However, regularity up to the boundary still presents many open questions. In what follows we present some regularity results, in the stationary case, for weak solutions to this kind of problems; see Theorems 3.1 and 3.2. The evolution problem is studied in the forthcoming paper [6]; see the remark at the end of the introduction. © 2004 Wiley Periodicals, Inc.     

A polynomial time algorithm recognizing link trees

The link of a vertex v of a graph G is the subgraph induced by all vertices adjacent to v. If all the links of G are isomorphic to a finite graph L, then G is called a realization of L, and L is called a link graph. At the Smolenice symposium of 1963, Zykov posed the problem of recognizing link graphs. There are two versions of that problem, namely the finite (the existence of a finite realization is required) and the infinite one. Bulitko (see “On Graphs with Prescribed Links of Vertices” [in Russian], Trudy mat. inst. im. Steklova, Vol. 133, 1973, pp. 78-94) proved that the infinite version is algorithmically unsolvable. The solution of both versions is known only for special classes of graphs as paths, cycles, and graphs homeomorphic to a star (see M. Brown and R. Connelly, “On Graphs with a Constant Link I,” New Directions in the Theory of Graphs, Academic Press, New York, 1973, pp. 19-51; On Graphs with a Constant Link II, Discrete Mathematics, Vol. 11, 1975, pp. 199-232). The finite version for trees with less than 10 vertices has been solved by Blass, Harary, and Miller (see “Which Trees Are Link Graphs?” Journal of Combinatorics Theory Series B, Vol. 29, 1980, pp. 277-292). Trees that are link graphs are called link trees. Using some previous results of Bulitko (see “On a Recursive Property of Block-Complete Graphs” [in Russian], Proceedings of Czechoslovak Conference on Graphs, Zemplínska ?irava, 1978, p. 20-30), we present a polynomial time algorithm recognizing link trees. The applied methods have some remarkable consequences concerning the study of link graphs. © 1995 John Wiley & Sons, Inc.     

Some Properties of Minimal Splines

S. G. Mikhlin was the first to construct systematically coordinate functions on an equidistant grid solving a system of approximate equations (called “fundamental relations”, see [5]; Goel discussed some special cases earlier in 1969; see also [1, 4, 6]). Further, the idea was developed in the case of irregular grids (which may have finite accumulation points, see [1] ). This paper is devoted to the investigation of A-minimal splines, introduced by the author; they include polynomial minimal splines which have been discussed earlier. Using the idea mentioned above, we give necessary and sufficient conditions for existence, uniqueness and g-continuity of these splines. The application of these results to polynomial splines of m-th degree on an equidistant grid leads us, in particular, to necessary and sufficient conditions for the continuity of their i-th derivative (i = 1, ?, m). These conditions do not exclude discontinuities of other derivatives (e.g. of order less than i). This allows us to give a certain classification of minimal spline spaces. It turns out that the spline classes are in one-to-one-correspondence with certain planes contained in a hyperplane.     

A criterion for polynomial growth of a-free two-peak posets of tame prinjective type *

It is well known from the results of L, A. Nazarova and A. G. Zavadskij [18], [19], see also [25, Chapter 15], that a poset J with one maximal element is of tame prinjective type and of polynomial growth if and only if J does not contain neither any of the Nazarova's hypercritical posets (1,1,1,1,1)^*, (1,1,1,2)^*,(2,2,3)^*, (1,3,4)^*,(W,5)^*,(1,2,6)^* nor the Nazarova-Zavadskij poset (NZ)^* (see Table 1 below). In the present paper we extend this result to a class of posets with two maximal elements. We show that Ã-free poset with two maximal elements is of tame representation type and of polynomial growth if and only if the Tits quadratic form q^s → Z (see (1.7) below) associated with J is weakly non-negative and J does not contain any of the six posets listed in Table 1 as a peak subposet.     

Higher <Emphasis Type="Italic">K</Emphasis>-theory of group-rings of virtually infinite cyclic groups

 F.T. Farrell and L.E. Jones conjectured in [7] that Algebraic K-theory of virtually cyclic subgroups V should constitute `building blocks' for the Algebraic K-theory of an arbitrary group G. In [6], they obtained some results on lower K-theory of V. In this paper, we obtain results on higher K-theory of virtually infinite cyclic groups V in the two cases: (i) when V admits an epimorphism (with finite kernel) to the infinite cyclic group (see 2.1 and 2.2(a),(b)) and (ii) when V admits an epimorphism (with finite kernel) to the infinite dihedral group (see 3.1, 3.2, 3.3). Received: 18 April 2002 / Published online: 10 February 2003 Mathematics Subject Classification (2000): 19D35, 16S35, 16H05.     

Uniqueness of harmonic maps with small energy

Harmonic maps from B ₁ (0, ℝ³) to a smooth compact target manifold N with uniformly small scaled energy (see assumption (2) below) are shown to be unique for their boundary values. Received: 12 May 1997     

Perturbation theorems for linear hyperbolic mixed problems and applications to the compressible euler equations

The main result of this paper (which is completely new, apart from our previous and less general result proved in reference [9]) states that the nonlinear system of equations (1.11) (or, equivalently, (1.10)) that describes the motion of an inviscid, compressible (barotropic) fluid in a bounded domain Ω, gives rise to a strongly well-posed problem (in the Hadamard classical sense) in spaces H^k(Ω), k ≧ 3; see Theorem 1.4 below. Roughly speaking, if (a_n, ?_n) → (a, ?) in H^k × H^k and if f_n → f in ??²(0, T;H^k), then (v_n, g_n) → (v, g) in ?? (0, T; H^k × H^k). The method followed here (see also [8]) also applies to the non-barotropic case p = p(ρ, s) (see [10]) and to other nonlinear problems. These results are based upon an improvement of the structural-stability theorem for linear hyperbolic equations. See Theorem 1.2 below. Added in proof: The reader is referred to [29], Part I, for a concise explanation of some fundamental points in the method followed here. © 1993 John Wiley & Sons, Inc.     

Cryptosystems based on semi-distributive algebras

We propose a new cryptographic scheme of ElGamal type. The scheme is based on algebraic systems defined in the paper—semialgebras (Sect. 2). The main examples are semialgebras of polynomial mappings over a finite field K, and their factor-semialgebras. Given such a semialgebra R, one chooses an invertible element a ∈ R ^* of finite order r, and a random integer s. One chooses also a finite dimensional K-submodule V of R. The 4-tuple (R, V, a, b) where b = a ^s forms the public key for the cryptosystem, while r and s form the secret key. A plain text can be viewed as a sequence of elements of the field K. That sequence is divided into blocks of length dim(V) which, in turn, correspond to uniquely determined elements X _i of V. We propose three different methods (A, B, and C, see Definition 1.1) of encoding/decoding the sequence of X _i . The complexity of cracking the proposed cryptosystem is based on the Discrete Logarithm Problem for polynomial mappings (see Sect. 1.1). No methods of cracking the problem, except for the “brute force” (see Sect. 1.1) with Ω(r) time, are known so far.      

Optimal control of linear stochastic evolution equations in Hilbert spaces and uniform observability

In this paper we study the existence of the optimal (minimizing) control for a tracking problem, as well as a quadratic cost problem subject to linear stochastic evolution equations with unbounded coefficients in the drift. The backward differential Riccati equation (BDRE) associated with these problems (see [2], for finite dimensional stochastic equations or [21], for infinite dimensional equations with bounded coefficients) is in general different from the conventional BDRE (see [10], [18]). Under stabilizability and uniform observability conditions and assuming that the control weight-costs are uniformly positive, we establish that BDRE has a unique, uniformly positive, bounded on ℝ ₊ and stabilizing solution. Using this result we find the optimal control and the optimal cost. It is known [18] that uniform observability does not imply detectability and consequently our results are different from those obtained under detectability conditions (see [10]).