On Quasi-static Non=Newtonian Fluids with Power-law

We discuss certain classes of quasi-static non-Newtonian fluids for which a power-law of the form σ^D=∇ϕ(ℰv) holds. Here σ^D is the stress deviator, v the velocity field, ℰv its symmetric derivative and ϕ is the function \[ \phi ({\cal E}v)=\frac 12\mu _\infty \left| {\cal E}v\right| ⁁2+\frac 1p\mu _0\left\{ \begin{array}{c} \left( 1+\left| {\cal E}v\right| ⁁2\right) ⁁{p/2} \\ \text{or} \\ \left| {\cal E}v\right| ⁁p \end{array} \right\}, \] ϕ(ℰv)=1 2 μ_∞∣ℰv∣²+1 p μ₀ (1+∣ℰv∣²)^p/2 or ∣ℰv∣^p, μ_∞⩾0, μ₀⩾0, μ_∞+μ₀>0, 1<p<∞. We then prove various regularity results for the velocity field v, for example differentiability almost everywhere and local boundedness of the tensor ℰv.     

Almost Prüfer v-Multiplication Domains and Related Domains of the Form D + D S [Γ*]

Let D be an integral domain, S be a (saturated) multiplicative subset of D such that D ? D _S , Γ be a numerical semigroup with Γ ? ?₀, Γ* = Γ?{0}, X be an indeterminate over D, D + XD _S [X] = {a + Xg ∈ D _S [X]∣a ∈ D and g ∈ D _S [X]}, and D + D _S [Γ*] = {a + f ∈ D _S [Γ]∣a ∈ D and f ∈ D _S [Γ*]}; so D + D _S [Γ*] ? D + XD _S [X]. In this article, we study when D + D _S [Γ*] is an APvMD, an AGCD-domain, an AS-domain, an AP-domain, or an AB-domain.     

On improved estimators of the generalized variance

Treated in this paper is the problem of estimating with squared error loss the generalized variance | Σ | from a Wishart random matrix S: p × p W_p(n, Σ) and an independent normal random matrix X: p × k N(ξ, Σ I_k) with ξ(p × k) unknown. Denote the columns of X by X₍₁₎ ,…, X_(k) and set ψ⁽⁰⁾(S, X) = {(n − p + 2)!/(n + 2)!} | S |, ψ⁽ⁱ⁾(X, X) = min[ψ⁽ⁱ⁻¹⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!} | S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |] and Ψ⁽ⁱ⁾(S, X) = min[ψ⁽⁰⁾(S, X), {(n − p + i + 2)!/(n + i + 2)!}| S + X₍₁₎ X′₍₁₎ + + X_(i) X′_(i) |], i = 1,…,k. Our result is that the minimax, best affine equivariant estimator ψ⁽⁰⁾(S, X) is dominated by each of Ψ⁽ⁱ⁾(S, X), i = 1,…,k and for every i, ψ⁽ⁱ⁾(S, X) is better than ψ⁽ⁱ⁻¹⁾(S, X). In particular, ψ^(k)(S, X) = min[{(n − p + 2)!/(n + 2)!} | S |, {(n − p + 2)!/(n + 2)!} | S + X₍₁₎X′₍₁₎|,…,| {(n − p + k + 2)!/(n + k + 2)!} | S + X₍₁₎X′₍₁₎ + + X_(k)X′_(k)|] dominates all other ψ's. It is obtained by considering a multivariate extension of Stein's result (Ann. Inst. Statist. Math. 16, 155–160 (1964)) on the estimation of the normal variance.     

Vertex partitions and maximum degenerate subgraphs

Let G be a graph with maximum degree d≥ 3 and ω(G)≤ d, where ω(G) is the clique number of the graph G. Let p₁ and p₂ be two positive integers such that d = p₁ + p₂. In this work, we prove that G has a vertex partition S₁, S₂ such that G[S₁] is a maximum order (p₁‐1)‐degenerate subgraph of G and G[S₂] is a (p₂‐1)‐degenerate subgraph, where G[S_i] denotes the graph induced by the set S_i in G, for i = 1,2. On one hand, by using a degree‐equilibrating process our result implies a result of Bollobas and Marvel [ 1 ]: for every graph G of maximum degree d≥ 3 and ω(G)≤ d, and for every p₁ and p₂ positive integers such that d = p₁ + p₂, the graph G has a partition S₁,S₂ such that for i = 1,2, Δ(G[S_i])≤ p_i and G[S_i] is (p_i‐1)‐degenerate. On the other hand, our result refines the following result of Catlin in [ 2 ]: every graph G of maximum degree d≥ 3 has a partition S₁,S₂ such that S₁ is a maximum independent set and ω(G[S₂])≤ d‐1; it also refines a result of Catlin and Lai [ 3 ]: every graph G of maximum degree d≥ 3 has a partition S₁,S₂ such that S₁ is a maximum size set with G[S₁] acyclic and ω(G[S₂])≤ d‐2. The cases d = 3, (d,p₁) = (4,1) and (d,p₁) = (4,2) were proved by Catlin and Lai [ 3 ]. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 227–232, 2007     

Omega subgroups of powerful <Emphasis Type="Italic">p</Emphasis>-groups

Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all i ≥ 0: (i) exp Ω_i(G) ≤ p ⁱ for odd p, and expΩ_i(G) ≤ 2 ⁱ⁺¹ for p = 2; (ii) the index |G: G ^{p i}| coincides with the number of elements of G of order at most p ⁱ. Supported by the Spanish Ministry of Science and Education, grant MTM2004-04665, partly with FEDER funds, and by the University of the Basque Country, grant UPV05/99.     

The Ostaszewski square and homogeneous Souslin trees

Assume GCH and let λ denote an uncountable cardinal. We prove that if □_λ holds, then this may be witnessed by a coherent sequence 〈C _α|α < λ⁺〉 with the following remarkable guessing property For every sequence 〈A _i | i < λ〉 of unbounded subsets of λ ⁺, and every limit θ < λ, there exists some α < λ ⁺ such that otp(C _α)=θ and the (i + 1) _th -element of C _α is a member of A _i , for all i < θ. As an application, we construct a homogeneous λ ⁺-Souslin tree from □_λ + CH_λ, for every singular cardinal λ. In addition, as a by-product, a theorem of Farah and Veli?kovi?, and a theorem of Abraham, Shelah and Solovay are generalized to cover the case of successors of regulars.     

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

 Let D be a semicomplete multipartite digraph, with partite sets V ₁, V ₂,…, V _c, such that |V ₁|≤|V ₂|≤…≤|V _c|. Define f(D)=|V(D)|−3|V _c|+1 and . We define the irregularity i(D) of D to be max|d ⁺(x)−d ⁻(y)| over all vertices x and y of D (possibly x=y). We define the local irregularity i _l(D) of D to be max|d ⁺(x)−d ⁻(x)| over all vertices x of D and we define the global irregularity of D to be i _g(D)=max{d ⁺(x),d ⁻(x) : x∈V(D)}−min{d ⁺(y),d ⁻(y) : y∈V(D)}. In this paper we show that if i _g(D)≤g(D) or if i _l(D)≤min{f(D), g(D)} then D is Hamiltonian. We furthermore show how this implies a theorem which generalizes two results by Volkmann and solves a stated problem and a conjecture from [6]. Our result also gives support to the conjecture from [6] that all diregular c-partite tournaments (c≥4) are pancyclic, and it is used in [9], which proves this conjecture for all c≥5. Finally we show that our result in some sense is best possible, by giving an infinite class of non-Hamiltonian semicomplete multipartite digraphs, D, with i _g(D)=i(D)=i _l(D)=g(D)+?≤f(D)+1. Revised: September 17, 1998     

A constructive method for the solution of the stability problem

Summary In this paper it is shown that the problem of solving the Liapounov matrix equationSM +M ^T S = –I is greatly simplified when the given real matrixM is in upper Hessenberg form. The solution is obtained as a linear combinationS = p _i S _i ofn linearly independent symmetric matricesS _i , whereS _i M +M ^T S _i =2D _i and p _i D _i = –1/2I. Explicit formulae are given for the elements of theS _i , andD _i while determination of thep _i requires the solution of ann ×n linear system.     

Hamilton cycles,avoiding prescribed arcs,in close-to-regular tournaments

The local irregularity of a digraph D is defined as i_l(D) = max {|d⁺ (x) − d⁻ (x)| : x ϵ V(D)}. Let T be a tournament, let Γ = {V₁, V₂, …, V_c} be a partition of V(T) such that |V₁| ≥ |V₂| ≥ … ≥ |V_c|, and let D be the multipartite tournament obtained by deleting all the arcs with both end points in the same set in Γ. We prove that, if |V(T)| ≥ max{2i_l(T) + 2|V₁| + 2|V₂| − 2, i_l(T) + 3|V₁| − 1}, then D is Hamiltonian. Furthermore, if T is regular (i.e., i_l(T) = 0), then we state slightly better lower bounds for |V(T)| such that we still can guarantee that D is Hamiltonian. Finally, we show that our results are best possible. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 123–136, 1999     

Asymptotic formulas for the hyperġeometric function2 F 1 of matrix argument,useful in multivariate analysis

Summary LetS _i have the Wishart distributionW _p(∑_i,n_i) fori=1,2. An asymptotic expansion of the distribution of for large n=n₁+n₂ is derived, when∑ ₁∑ ₂ ⁻¹ =I+n^−1/2θ, based on an asymptotic solution of the system of partial differential equations for the hypergeometric function₂ F ₁, obtained recently by Muirhead [2]. Another asymptotic formula is also applied to the distributions of −2 log λ and −log|S ₂(S ₁+S ₂)⁻¹| under fixed∑ ₁∑ ₂ ⁻¹ , which gives the earlier results by Nagao [4]. Some useful asymptotic formulas for₁ F ₁ were investigated by Sugiura [7].     

More on P-Stable Convex Sets in Banach Spaces

We study the asymptotic behavior and limit distributions for sums S _n =b_n ^-1 _i=1 ⁿ _i,where _i, i 1, are i.i.d. random convex compact (cc) sets in a given separable Banach space B and summation is defined in a sense of Minkowski. The following results are obtained: (i) Series (LePage type) and Poisson integral representations of random stable cc sets in B are established; (ii) The invariance principle for processes S _n(t) =b_n ^-1 _i=1 ^[nt] _i, t[0, 1], and the existence of p-stable cc Levy motion are proved; (iii) In the case, where _i are segments, the limit of S _n is proved to be countable zonotope. Furthermore, if B = R ^d , the singularity of distributions of two countable zonotopes Y_{p 1}, ₁,Y_{p 2}, ₂, corresponding to values of exponents p ₁, p ₂ and spectral measures ₁, ₂, is proved if either p ₁ p ₂ or _{1 2}; (iv) Some new simple estimates of parameters of stable laws in R ^d , based on these results are suggested.     

Optimal maps for the multidimensional Monge-Kantorovich problem

Let μ₁,…, μ_N be Borel probability measures on ℝ^d. Denote by Γ(μ₁,…, μ_N) the set of all N-tuples T=(T₁,…, T_N) such that T_i:ℝ^d ↔ ℝ^d (i = 1,…, N) are Borel-measurable and satisfy μ₁ = μ_i[V] for all Borel V ⊂ ℝ^d. The multidimensional Monge-Kantorovich problem investigated in this paper consists of finding S=(S₁,…, S_N) ∈ Γ(μ₁,…, μ_N) minimizing over the set Γ(μ₁, ···, μ_N). We study the case where the μ_i's have finite second moments and vanish on (d - 1)-rectifiable sets. We prove existence and uniqueness of optimal maps S when we impose that S₁( x ) ≡ x and give an explicit form of the maps S_i. The result is obtained by variational methods and to the best of our knowledge is the first available in the literature in this generality. As a consequence, we obtain uniqueness and characterization of an optimal measure for the multidimensional Kantorovich problem. © 1998 John Wiley & Sons, Inc.     

A conjecture of recski in combinatorial set theory

A p-cover of $\text{n = {1, 2,…,}\text{n}\text{}}$ is a family of subsets $\text{S}{}_{\mathrm{i}}\text{≠ ?}$ such that ∪ S_i = n and |S_i ∩ S_i| ? p for i ≠ j. We prove that for fixed p, the number of p-cover of n is O(n^p+1logn).     

Gray codes for column-convex polyominoes and a new class of distributive lattices

We introduce the problem of polyomino Gray codes, which is the listing of all members of certain classes of polyominoes such that successive polyominoes differ by some well-defined closeness condition (e.g., the movement of one cell). We discuss various closeness conditions and provide several Gray codes for the class of column-convex polyominoes with a fixed number of cells in each column. For one of our closeness conditions, a natural new class of distributive lattice arises: the partial order is defined on the set of m-tuples [S₁]×[S₂]××[S_m], where each S_i>1 and [S_i]={0,1,…,S_i−1}, and the cover relations are (p₁,p₂,…,p_m)(p₁+1,p₂,…,p_m) and (p₁,p₂,…,p_j,p_j+1,…,p_m)(p₁,p₂,…,p_j−1,p_j+1+1,…,p_m). We also discuss some properties of this lattice.     

An inversion formula for the dual horocyclic Radon transform on the hyperbolic plane

Consider the Poincare unit disk model for the hyperbolic plane H ². Let Ξ be the set of all horocycles in H ² parametrized by (θ, p), where e^iθ is the point where a horocycle ξ is tangent to the boundary |z| = 1, and p is the hyperbolic distance from ξ to the origin. In this paper we invert the dual Radon transform R* : μ(θ, p) → (z) under the assumption of exponential decay of μ and some of its derivatives. The additional assumption is that P_m(d/dp)(μ_m(p)e^p) be even for all m ∈ ?. Here P_m(d/dp) is a family of differential operators introduced by Helgason, and μ_m(p) are the coefficients of the Fourier series expansion of μ(θ, p). (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Generalized Ham-Sandwich Cuts

Bárány, Hubard, and Jerónimo recently showed that for given well-separated convex bodies S ₁,…,S _d in R ^d and constants β _i ∈[0,1], there exists a unique hyperplane h with the property that Vol (h ⁺∩S _i )=β _i ⋅Vol (S _i ); h ⁺ is the closed positive transversal halfspace of h, and h is a “generalized ham-sandwich cut.” We give a discrete analogue for a set S of n points in R ^d which are partitioned into a family S=P ₁∪⋅⋅⋅∪P _d of well-separated sets and are in weak general position. The combinatorial proof inspires an O(n(log n) ^d−3) algorithm which, given positive integers a _i ≤|P _i |, finds the unique hyperplane h incident with a point in each P _i and having |h ⁺∩P _i |=a _i . Finally we show two other consequences of the direct combinatorial proof: the first is a stronger result, namely that in the discrete case, the conditions assuring existence and uniqueness of generalized cuts are also necessary; the second is an alternative and simpler proof of the theorem in Bárány et al., and in addition, we strengthen the result via a partial converse.     

Crossed products and blocks with normal defect groups

Abstract

Let D be an integral domain. A multiplicative set S of D is an almost splitting set if for each 0 ≠ d ∈ D, there exists an n = n(d) with d ⁿ  = st where s ∈ S and t is v-coprime to each element of S. An integral domain D is an almost GCD (AGCD) domain if for every x, y ∈ D, there exists a positive integer n = n(x, y) such that x ⁿ D ∩ y ⁿ D is a principal ideal. We prove that the polynomial ring D[X] is an AGCD domain if and only if D is an AGCD domain and D[X] ? D′[X] is a root extension, where D′ is the integral closure of D. We also show that D + XD _S [X] is an AGCD domain if and only if D and D _S [X] are AGCD domains and S is an almost splitting set.     

OD-characterization of Almost Simple Groups Related to U3（5）

Let G be a finite group with order ｜G｜=p1^α1p2^α2……pk^αk, where p1 〈 p2 〈……〈 Pk are prime numbers. One of the well-known simple graphs associated with G is the prime graph （or Gruenberg- Kegel graph） denoted .by г（G） （or GK（G））. This graph is constructed as follows： The vertex set of it is π（G） = {p1,p2,…,pk} and two vertices pi, pj with i≠j are adjacent by an edge （and we write pi - pj） if and only if G contains an element of order pipj. The degree deg（pi） of a vertex pj ∈π（G） is the number of edges incident on pi. We define D（G） ：= （deg（p1）, deg（p2）,..., deg（pk））, which is called the degree pattern of G. A group G is called k-fold OD-characterizable if there exist exactly k non- isomorphic groups H such that ｜H｜ = ｜G｜ and D（H） = D（G）. Moreover, a 1-fold OD-characterizable group is simply called OD-characterizable. Let L ：= U3（5） be the projective special unitary group. In this paper, we classify groups with the same order and degree pattern as an almost simple group related to L. In fact, we obtain that L and L.2 are OD-characterizable; L.3 is 3-fold OD-characterizable; L.S3 is 6-fold OD-characterizable.     

Uneven Splitting of Ham Sandwiches

Let μ ₁,…,μ _n be continuous probability measures on ? ⁿ and α ₁,…,α _n ∈[0,1]. When does there exist an oriented hyperplane H such that the positive half-space H ⁺ has μ _i (H ⁺)=α _i for all i∈[n]? It is well known that such a hyperplane does not exist in general. The famous Ham Sandwich Theorem states that if $\alpha_{i}=\frac{1}{2}Let μ ₁,…,μ _n be continuous probability measures on ℝ ⁿ and α ₁,…,α _n ∈[0,1]. When does there exist an oriented hyperplane H such that the positive half-space H ⁺ has μ _i (H ⁺)=α _i for all i∈[n]? It is well known that such a hyperplane does not exist in general. The famous Ham Sandwich Theorem states that if a_i=\frac12\alpha_{i}=\frac{1}{2} for all i, then such a hyperplane always exists.