On measure‐valued solutions to a two‐dimensional gravity‐driven avalanche flow model

This paper concerns measure‐valued solutions for the two‐dimensional granular avalanche flow model introduced by Savage and Hutter. The system is similar to the isentropic compressible Euler equations, except for a Coulomb–Mohr friction law in the source term. We will partially follow the study of measure‐valued solutions given by DiPerna and Majda. However, due to the multi‐valued nature of the friction law, new more sensitive measures must be introduced. The main idea is to consider the class of x‐dependent maximal monotone graphs of non‐single‐valued operators and their relation with 1‐Lipschitz, Carathéodory functions. This relation allows to introduce generalized Young measures for x‐dependent maximal monotone graph. Copyright © 2005 John Wiley & Sons, Ltd.     

Self‐Intersection Local Time for 𝒮′(ℝd)‐Ornstein‐Uhlenbeck Processes Arising from Immigration Systems

Fluctuation limits of an immigration branching particle system and an immigration branching measure‐valued process yield different types of 𝒮′(ℝ^d)‐valued Ornstein‐Uhlenbeck processes whose covariances are given in terms of an excessive measure for the underlying motion in Rd, which is taken to be a symmetric α‐stable process. In this paper we prove existence and path continuity results for the self‐intersection local time of these Ornstein‐Uhlenbeck processes. The results depend on relationships between the dimension d and the parameter α.     

Subquasivarieties of implicative locally‐finite quasivarieties

A quasivariety is said to be implicative if it is generated by a class of algebras with equationally‐definable implication of equalities. Implicative finitely‐generated quasivarieties appear naturally within logic, for instance, as equivalent quasivarieties of Gentzen‐style calculi for finitely‐valued propositional logics with equality determinant (cf. [17], [18, Subsection 7.5] and Section A). Furthermore, any discriminator quasivariety is implicative. We prove that, for any implicative locally‐finite quasivariety ? and any skeleton S of the class of all finite ?‐simple members of ?, the image of the first component of a natural Galois connection between the dual poset of subquasivarieties of ? and the poset of all sets of finite subsets of S is the closure system of all U_S‐ideals of the poset 〈S, ?〉, where ? is the embeddability relation and U_S is the up‐set on S constituted by all members of S having a one‐element subalgebra, with closure basis determined by the sets of all principal and non‐empty finitely‐generated up‐sets on S. It is also shown that the first component of the Galois connection under consideration is injective if and only if, for each finite sequence

     

Besov‐Morrey spaces and Triebel‐Lizorkin‐Morrey spaces on domains

The purpose of this paper is to develop a theory of the Besov‐Morrey spaces and the Triebel‐Lizorkin‐Morrey spaces on domains in R ⁿ. We consider the pointwise multiplier operator, the trace operator, the extension operator and the diffeomorphism operator. Not only to domains in R ⁿ we extend our definition of function spaces to compact oriented Riemannian manifolds. Among the properties above, the result for the trace operator is in particular interesting, which reflects the property of the parameters p, q in the Morrey space ??^p_q (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Automorphisms of higher‐dimensional Hadamard matrices

This article derives from first principles a definition of equivalence for higher‐dimensional Hadamard matrices and thereby a definition of the automorphism group for higher‐dimensional Hadamard matrices. Our procedure is quite general and could be applied to other kinds of designs for which there are no established definitions for equivalence or automorphism. Given a two‐dimensional Hadamard matrix H of order ν, there is a Product Construction which gives an order ν proper n‐dimensional Hadamard matrix P⁽ⁿ⁾(H). We apply our ideas to the matrices P⁽ⁿ⁾(H). We prove that there is a constant c > 1 such that any Hadamard matrix H of order ν > 2 gives rise via the Product Construction to cν inequivalent proper three‐dimensional Hadamard matrices of order ν. This corrects an erroneous assertion made in the literature that ”P⁽ⁿ⁾(H) is equivalent to “P⁽ⁿ⁾(H′) whenever H is equivalent to H′.” We also show how the automorphism group of P⁽ⁿ⁾(H) depends on the structure of the automorphism group of H. As an application of the above ideas, we determine the automorphism group of P⁽ⁿ⁾(Hk) when Hk is a Sylvester Hadamard matrix of order 2^k. For ν = 4, we exhibit three distinct families of inequivalent Product Construction matrices P⁽ⁿ⁾(H) where H is equivalent to H₂. These matrices each have large but non‐isomorphic automorphism groups. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 507–544, 2008     

On realization of the Kreĭn–Langer class Nκ of matrix‐valued functions in Pontryagin spaces

In this paper the realization problems for the Kre?n–Langer class N_κ of matrix‐valued functions are being considered. We found the criterion when a given matrix‐valued function from the class N_κ can be realized as linear‐fractional transformation of the transfer function of canonical conservative system of the M. Livsic type (Brodskii–Livsic rigged operator colligation) with the main operator acting on a rigged Pontryagin space Π_κ with indefinite metric. We specify three subclasses of the class N_κ (R) of all realizable matrix‐valued functions that correspond to different properties of a realizing system, in particular, when the domains of the main operator of a system and its conjugate coincide, when the domain of the hermitian part of a main operator is dense in Π_κ . Alternatively we show that the class N_κ (R) can be realized as transfer matrix‐functions of some canonical impedance systems with self‐adjoint main operators in rigged spaces Π_κ . The case of scalar functions of the class N_κ (R) is considered in details and some examples are presented. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Boolean products of R0‐algebras

In this paper, the (weak) Boolean representation of R₀‐algebras are investigated. In particular, we show that directly indecomposable R₀‐algebras are equivalent to local R₀‐algebras and any nontrivial R₀‐algebra is representable as a weak Boolean product of local R₀‐algebras (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Switching to H‐Free Graphs

In this article, we study the problem of deciding if, for a fixed graph H, a given graph is switching equivalent to an H‐free graph. Polynomial‐time algorithms are known for H having at most three vertices or isomorphic to P₄. We show that for H isomorphic to a claw, the problem is polynomial, too. On the other hand, we give infinitely many graphs H such that the problem is NP‐complete, thus solving an open problem [Kratochvíl, Ne?et?il and Zýka, Ann Discrete Math 51 (1992)]. Further, we give a characterization of graphs switching equivalent to a K_{1, 2}‐free graph by ten forbidden‐induced subgraphs, each having five vertices. We also give the forbidden‐induced subgraphs for graphs switching equivalent to a forest of bounded vertex degrees.     

Group theory and p‐adic valued models of swarm behaviour

The swarm behaviour can be controlled by different localizations of attractants (food pieces) and repellents (dangerous places), which, respectively, attract and repel the swarm propagation. If we assume that at each time step, the swarm can find out not more than p ?1 attractants ( ), then the swarm behaviour can be coded by p ‐adic integers, ie, by the numbers of the ring Z _p . Each swarm propagation has the following 2 stages: (1) the discover of localizations of neighbour attractants and repellents and (2) the logistical optimization of the road system connecting all the reachable attractants and avoiding all the neighbour repellents. In the meanwhile, at the discovering stage, the swarm builds some direct roads and, at the logistical stage, the transporting network of the swarm gets loops (circles) and it permanently changes. So, at the first stage, the behaviour can be expressed by some linear p ‐adic valued strings. At the second stage, it is expressed by non‐linear modifications of p ‐adic valued strings. The second stage cannot be described by conventional algebraic tools; therefore, I have introduced the so‐called non‐linear group theory for describing both stages in the swarm propagation.     

On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

Global existence and uniqueness of measure valued solutions to a Vlasov‐type equation with local alignment

We use a particle method to study a Vlasov‐type equation with local alignment, which was proposed by Sebastien Motsch and Eitan Tadmor [J. Statist. Phys., 141(2011), pp. 923‐947]. For N‐particle system, we study the unconditional flocking behavior for a weighted Motsch‐Tadmor model and a model with a “tail”. When N goes to infinity, global existence and stability (hence uniqueness) of measure valued solutions to the kinetic equation of this model are obtained. We also prove that measure valued solutions converge to a flock. The main tool we use in this paper is Monge‐Kantorovich‐Rubinstein distance.     

Zero‐sum flows in designs

Let D be a t ‐ ( v, k , λ) design and let N _i (D) , for 1 ≤ i ≤ t , be the higher incidence matrix of D , a ( 0 , 1 )‐matrix of size , where b is the number of blocks of D . A zero‐sum flow of D is a nowhere‐zero real vector in the null space of N ₁ ( D ). A zero‐sum k‐flow of D is a zero‐sum flow with values in { 1 , …, ±( k ? 1 )}. In this article, we show that every non‐symmetric design admits an integral zero‐sum flow, and consequently we conjecture that every non‐symmetric design admits a zero‐sum 5‐flow. Similarly, the definition of zero‐sum flow can be extended to N _i ( D ), 1 ≤ i ≤ t . Let be the complete design. We conjecture that N _t ( D ) admits a zero‐sum 3‐flow and prove this conjecture for t = 2 . © 2011 Wiley Periodicals, Inc. J Combin Designs 19:355‐364, 2011     

Mellin‐edge representations of elliptic operators

We construct a class of elliptic operators in the edge algebra on a manifold M with an embedded submanifold Y interpreted as an edge. The ellipticity refers to a principal symbolic structure consisting of the standard interior symbol and an operator‐valued edge symbol. Given a differential operator A on M for every (sufficiently large) s we construct an associated operator ??_s in the edge calculus. We show that ellipticity of A in the usual sense entails ellipticity of ??_s as an edge operator (up to a discrete set of reals s). Parametrices P of A then correspond to parametrices ??_s of ??_s, interpreted as Mellin‐edge representations of P. Copyright © 2005 John Wiley & Sons, Ltd.     

Conservative discretizations and parameter‐robust preconditioners for Biot and multiple‐network flux‐based poroelasticity models

The parameters in the governing system of partial differential equations of multiple‐network poroelasticity models typically vary over several orders of magnitude, making its stable discretization and efficient solution a challenging task. In this paper, we prove the uniform Ladyzhenskaya–Babu?ka–Brezzi (LBB) condition and design uniformly stable discretizations and parameter‐robust preconditioners for flux‐based formulations of multiporosity/multipermeability systems. Novel parameter‐matrix‐dependent norms that provide the key for establishing uniform LBB stability of the continuous problem are introduced. As a result, the stability estimates presented here are uniform not only with respect to the Lamé parameter λ but also to all the other model parameters, such as the permeability coefficients K_i; storage coefficients $c_{p_i}$; network transfer coefficients β_{i j},i,j = 1,…,n; the scale of the networks n; and the time step size τ. Moreover, strongly mass‐conservative discretizations that meet the required conditions for parameter‐robust LBB stability are suggested and corresponding optimal error estimates proved. The transfer of the canonical (norm‐equivalent) operator preconditioners from the continuous to the discrete level lays the foundation for optimal and fully robust iterative solution methods. The theoretical results are confirmed in numerical experiments that are motivated by practical applications.     

Inverse Sturm–Liouville spectral problem on symmetric star‐tree

A spectral problem for the Sturm–Liouville equation on the edges of an equilateral regular star‐tree with the Dirichlet boundary conditions at the pendant vertices and Kirchhoff and continuity conditions at the interior vertices is considered. The potential in the Sturm–Liouville equation is a real–valued square summable function, symmetrically distributed with respect to the middle point of any edge. If {λ_j}is a sequence of real numbers, necessary and sufficient conditions for {λ_j}to be the spectrum of the problem under consideration are established. Copyright © 2013 John Wiley & Sons, Ltd.     

Method for Solving the Multidimensional n‐Wave Resonant Equations and Geometry of Generalized Darboux‐Manakov‐Zakharov Systems

The intrinsic geometric properties of generalized Darboux‐Manakov‐Zakharov systems of semilinear partial differential equations (1) for a real‐valued function u(x₁, …, x_n) are studied with particular reference to the linear systems in this equation class. System (1) is overdetermined and will not generally be involutive in the sense of Cartan: its coefficients will be constrained by complicated nonlinear integrability conditions. We derive tools for explicitly constructing involutive systems of the form (1) , essentially solving the integrability conditions. Specializing to the linear case provides us with a novel way of viewing and solving the multidimensional n‐wave resonant interaction system and its modified version. For each integer n≥ 3 and nonnegative integer k, our procedure constructs solutions of the n‐wave resonant interaction system depending on at least k arbitrary functions each of one variable. The construction of these solutions relies only on differentiation, linear algebra, and the solution of ordinary differential equations.     

Nilpotent 1‐factorizations of the complete graph

For which groups G of even order 2n does a 1‐factorization of the complete graph K_2n exist with the property of admitting G as a sharply vertex‐transitive automorphism group? The complete answer is still unknown. Using the definition of a starter in G introduced in 4 , we give a positive answer for new classes of groups; for example, the nilpotent groups with either an abelian Sylow 2‐subgroup or a non‐abelian Sylow 2‐subgroup which possesses a cyclic subgroup of index 2. Further considerations are given in case the automorphism group G fixes a 1‐factor. © 2005 Wiley Periodicals, Inc. J Combin Designs     

Complexity of clique‐coloring odd‐hole‐free graphs

In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, but on the other hand it is NP‐hard to decide if they are 2‐clique‐colorable, and we do not know if there exists any bound k₀ such that they are all k₀ ‐clique‐colorable. First we will prove that (odd hole, codiamond)‐free graphs are 2‐clique‐colorable. Then we will demonstrate that the complexity of 2‐clique‐coloring odd‐hole‐free graphs is actually Σ₂ P‐complete. Finally we will study the complexity of deciding whether or not a graph and all its subgraphs are 2‐clique‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 139–156, 2009