Intrinsic characterizations of Besov spaces on Lipschitz domains

The aim of this paper is to study the equivalence between quasi‐norms of Besov spaces on domains. We suppose that the domain Ω ? ?ⁿ is a bounded Lipschitz open subset in ?ⁿ. First, we define Besov spaces on Ω as the restrictions of the corresponding Besov spaces on ?ⁿ. Then, with the help of equivalent and intrinsic characterizations (the Peetre‐type characterization 3.10 and the characterization via local means 3.13) of these spaces, we get another equivalent and intrinsic quasi‐norm using, this time, generalized differences and moduli of smoothness. We extend the well‐known characterization of Besov spaces on ?ⁿ described in Theorem 2.4 to the case of Lipschitz domains.     

Natural hp‐BEM for the electric field integral equation with singular solutions

We apply the hp ‐version of the boundary element method (BEM) for the numerical solution of the electric field integral equation (EFIE) on a Lipschitz polyhedral surface Γ. The underlying meshes are supposed to be quasi‐uniform triangulations of Γ, and the approximations are based on either Raviart‐Thomas or Brezzi‐Douglas‐Marini families of surface elements. Nonsmoothness of Γ leads to singularities in the solution of the EFIE, severely affecting convergence rates of the BEM. However, the singular behavior of the solution can be explicitly specified using a finite set of functions (vertex‐, edge‐, and vertex‐edge singularities), which are the products of power functions and poly‐logarithmic terms. In this article, we use this fact to perform an a priori error analysis of the hp ‐BEM on quasi‐uniform meshes. We prove precise error estimates in terms of the polynomial degree p, the mesh size h, and the singularity exponents. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012     

The coarea formula for real‐valued Lipschitz maps on stratified groups

We establish a coarea formula for real‐valued Lipschitz maps on stratified groups when the domain is endowed with a homogeneous distance and level sets are measured by the Q – 1 dimensional spherical Hausdorff measure. The number Q is the Hausdorff dimension of the group with respect to its Carnot–Carathéodory distance. We construct a Lipschitz function on the Heisenberg group which is not approximately differentiable on a set of positive measure, provided that the Euclidean notion of differentiability is adopted. The coarea formula for stratified groups also applies to this function, where the Euclidean one clearly fails. This phenomenon shows that the coarea formula holds for the natural class of Lipschitz functions which arises from the geometry of the group and that this class may be strictly larger than the usual one. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Disjoint quasi‐kernels in digraphs

A quasi‐kernel in a digraph is an independent set of vertices such that any vertex in the digraph can reach some vertex in the set via a directed path of length at most two. Chvátal and Lovász proved that every digraph has a quasi‐kernel. Recently, Gutin et al. raised the question of which digraphs have a pair of disjoint quasi‐kernels. Clearly, a digraph has a pair of disjoint quasi‐kernels cannot contain sinks, that is, vertices of outdegree zero, as each such vertex is necessarily included in a quasi‐kernel. However, there exist digraphs which contain neither sinks nor a pair of disjoint quasi‐kernels. Thus, containing no sinks is not sufficient in general for a digraph to have a pair of disjoint quasi‐kernels. In contrast, we prove that, for several classes of digraphs, the condition of containing no sinks guarantees the existence of a pair of disjoint quasi‐kernels. The classes contain semicomplete multipartite, quasi‐transitive, and locally semicomplete digraphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:251‐260, 2008     

Archimedean classes in integral commutative residuated chains

This paper investigates a quasi‐variety of representable integral commutative residuated lattices axiomatized by the quasi‐identity resulting from the well‐known Wajsberg identity (p → q) → q ≤ (q → p) → p if it is written as a quasi‐identity, i. e., (p → q) → q ≈ 1 ? (q → p) → p ≈ 1 . We prove that this quasi‐identity is strictly weaker than the corresponding identity. On the other hand, we show that the resulting quasi‐variety is in fact a variety and provide an axiomatization. The obtained results shed some light on the structure of Archimedean integral commutative residuated chains. Further, they can be applied to various subvarieties of MTL‐algebras, for instance we answer negatively Hájek's question asking whether the variety of ΠMTL‐algebras is generated by its Archimedean members (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Nonconforming finite element methods with subgrid viscosity applied to advection‐diffusion‐reaction equations

A nonconforming (Crouzeix–Raviart) finite element method with subgrid viscosity is analyzed to approximate advection‐diffusion‐reaction equations. The error estimates are quasi‐optimal in the sense that keeping the Péclet number fixed, the estimates are suboptimal of order in the mesh size for the L²‐norm and optimal for the advective derivative on quasi‐uniform meshes. The method is also reformulated as a finite volume box scheme providing a reconstruction formula for the diffusive flux with local conservation properties. Numerical results are presented to illustrate the error analysis. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Quasi‐complements of the cappable degrees

Say that a nonzero c. e. degree b is a quasi‐complement of a c. e. degree a if a ∩ b = 0 and a ∪ b is high. It is well‐known (due to Shore) that each cappable degree has a high quasi‐complement. However, by the existence of the almost deep degrees, there are nonzero cappable degrees having no low quasi‐complements. In this paper, we prove that any nonzero cappable degree has a low₂ quasi‐complement. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Weak‐quasi‐Stone algebras

In this paper we shall introduce the variety WQS of weak‐quasi‐Stone algebras as a generalization of the variety QS of quasi‐Stone algebras introduced in [9]. We shall apply the Priestley duality developed in [4] for the variety N of ¬‐lattices to give a duality for WQS. We prove that a weak‐quasi‐Stone algebra is characterized by a property of the set of its regular elements, as well by mean of some principal lattice congruences. We will also determine the simple and subdirectly irreducible algebras (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Coloring quasi‐line graphs

A graph G is a quasi‐line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. A theorem of Shannon's implies that if G is a line graph, then it can be properly colored using no more than 3/2 ω(G) colors, where ω(G) is the size of the largest clique in G. In this article, we extend this result to all quasi‐line graphs. We also show that this bound is tight. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Web‐spline‐based finite element approximation of some quasi‐newtonian flows: Existence‐uniqueness and error bound

This article deals with the web‐spline‐based finite element approximation of quasi‐Newtonian flows. First, we consider the scalar elliptic p‐Laplace problem. Then, we consider quasi‐Newtonian flows where viscosity obeys power law or Carreau law. We prove well‐posedness at the continuous as well as the discrete level. We give some error bounds for the solution of quasi‐Newtonian flow problem based on the web‐spline method. Finally, we provide the numerical results for the p‐Laplace problem. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq31: 54–77, 2015     

Robust stability analysis of stochastic neural networks with Markovian jumping parameters and probabilistic time‐varying delays

This article discusses the issue of robust stability analysis for a class of Markovian jumping stochastic neural networks (NNs) with probabilistic time‐varying delays. The jumping parameters are represented as a continuous‐time discrete‐state Markov chain. Using the stochastic stability theory, properties of Brownian motion, the information of probabilistic time‐varying delay, the generalized Ito's formula, and linear matrix inequality (LMI) technique, some novel sufficient conditions are obtained to guarantee the stochastical stability of the given NNs. In particular, the activation functions considered in this article are reasonably general in view of the fact that they may depend on Markovian jump parameters and they are more general than those usual Lipschitz conditions. The main features of this article are described in the following: first one is that, based on generalized Finsler lemma, some improved delay‐dependent stability criteria are established and the second one is that the nonlinear stochastic perturbation acting on the system satisfies a class of Lipschitz linear growth conditions. By resorting to the Lyapunov–Krasovskii stability theory and the stochastic analysis tools, sufficient stability conditions are established using an efficient LMI approach. Finally, two numerical examples and its simulations are given to demonstrate the usefulness and effectiveness of the proposed results. © 2014 Wiley Periodicals, Inc. Complexity 21: 59–72, 2016     

Infinite families of non‐embeddable quasi‐residual Menon designs

A Menon design of order h² is a symmetric (4h²,2h²‐h,h²‐h)‐design. Quasi‐residual and quasi‐derived designs of a Menon design have parameters 2‐(2h² + h,h²,h²‐h) and 2‐(2h²‐h,h²‐h,h²‐h‐1), respectively. In this article, regular Hadamard matrices are used to construct non‐embeddable quasi‐residual and quasi‐derived Menon designs. As applications, we construct the first two new infinite families of non‐embeddable quasi‐residual and quasi‐derived Menon designs. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 53–62, 2009     

The hp‐version of the BEM with quasi‐uniform meshes for a three‐dimensional crack problem: The case of a smooth crack having smooth boundary curve

The article considers a three‐dimensional crack problem in linear elasticity with Dirichlet boundary conditions. The crack in this model problem is assumed to be a smooth open surface with smooth boundary curve. The hp‐version of the boundary element method with weakly singular operator is applied to approximate the unknown jump of the traction which is not L₂‐regular due to strong edge singularities. Assuming quasi‐uniform meshes and uniform distributions of polynomial degrees, we prove an a priori error estimate in the energy norm. The estimate gives an upper bound for the error in terms of the mesh size h and the polynomial degree p. It is optimal in h for any given data and quasi‐optimal in p for sufficiently smooth data. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Quasi‐completeness and functions without fixed‐points

We prove a completeness criterion for quasi‐reducibility and generalize it to higher levels of the arithmetical hierarchy. As an application of the criterion we obtain Q‐completeness of the set of all pairs (x, n) such that the prefix‐free Kolmogorov complexity of x is less than n. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Affine,quasi‐affine and co‐affine frames on local fields of positive characteristic

The concept of quasi‐affine frame in Euclidean spaces was introduced to obtain translation invariance of the discrete wavelet transform. We extend this concept to a local field K of positive characteristic. We show that the affine system generated by a finite number of functions is an affine frame if and only if the corresponding quasi‐affine system is a quasi‐affine frame. In such a case the exact frame bounds are equal. This result is obtained by using the properties of an operator associated with two such affine systems. We characterize the translation invariance of such an operator. A related concept is that of co‐affine system. We show that there do not exist any co‐affine frame in .     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

On quasi‐orthogonal cocycles

We introduce the notion of quasi‐orthogonal cocycle. This is motivated in part by the maximal determinant problem for square ‐matrices of size congruent to 2 modulo 4. Quasi‐orthogonal cocycles are analogous to the orthogonal cocycles of algebraic design theory. Equivalences with new and known combinatorial objects afforded by this analogy, such as quasi‐Hadamard groups, relative quasi‐difference sets, and certain partially balanced incomplete block designs, are proved.     

Hadwiger's conjecture for quasi‐line graphs

A graph G is a quasi‐line graph if for every vertex v ∈ V(G), the set of neighbors of v in G can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. Hadwiger's conjecture states that if a graph G is not t‐colorable then it contains K_{t + 1} as a minor. This conjecture has been proved for line graphs by Reed and Seymour. We extend their result to all quasi‐line graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 17–33, 2008     

Quasi‐random hypergraphs revisited

The quasi‐random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k ‐graphs (i.e., k ‐uniform hypergraphs), an analogous quasi‐random class contains various equivalent graph properties including the k ‐discrepancy property (bounding the number of edges in the generalized induced subgraph determined by any given (k ‐ 1) ‐graph on the same vertex set) as well as the k ‐deviation property (bounding the occurrences of “octahedron”, a generalization of 4 ‐cycle). In a 1990 paper (Chung, Random Struct Algorithms 1 (1990) 363‐382), a weaker notion of l ‐discrepancy properties for k ‐graphs was introduced for forming a nested chain of quasi‐random classes, but the proof for showing the equivalence of l ‐discrepancy and l ‐deviation, for 2 ≤ l < k, contains an error. An additional parameter is needed in the definition of discrepancy, because of the rich and complex structure in hypergraphs. In this note, we introduce the notion of (l,s) ‐discrepancy for k ‐graphs and prove that the equivalence of the (k,s) ‐discrepancy and the s ‐deviation for 1 ≤ s ≤ k. We remark that this refined notion of discrepancy seems to point to a lattice structure in relating various quasi‐random classes for hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

New families of non‐embeddable quasi‐derived designs

The main result in this article is a method of constructing a non‐embeddable quasi‐derived design from a quasi‐derived design and an α‐resolvable design. This method is a generalization of techniques used by van Lint and Tonchev in 14 , 15 and Kageyama and Miao in 8 . As applications, we construct several new families of non‐embeddable quasi‐derived designs. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 263–275, 2008