On critical exponents for some quasilinear parabolic equations

We study the Cauchy problem for the quasilinear parabolic equation where p > 1 is a parameter and ψ is a smooth, bounded function on (1, ∞) with ? ? sψ′(s)/ψ(s) ? θ for some θ > 0. If 1 < p < 1 + 2/N, there are no global positive solutions, whereas if p > 1 + 2/N, there are global, positive solutions for small initial data.     

Estimating ∇u by div u and curl u

In this paper we obtain necessary and sufficient conditions for the validity of the estimate The constant c does not depend on u. u is a vector field with values in ?³. It is defined on a bounded set G of ?³ or an unbounded one, denoted by ?. The boundary conditions are as follows: either the normal component of u vanishes or the tangential one does. Our conditions are expressed in terms of the Betti numbers of G or ?.     

Well‐posedness for the Cauchy problem of the modified Hunter–Saxton equation in the Besov spaces

This paper is concerned with the Cauchy problem of the modified Hunter‐Saxton equation. The local well‐posedness of the model equation is obtained in Besov spaces (which generalize the Sobolev spaces H^s) by using Littlewood‐Paley decomposition and transport equation theory. Moreover, the local well‐posedness in critical case (with ) is considered.     

Pełczyński's property () of order p and its quantification

We introduce the concepts of Pełczyński's property (V) of order p and Pełczyński's property of order p. It is proved that, for each , the James p‐spaces enjoys Pełczyński's property of order p and the James ‐spaces (where denotes the conjugate number of p) enjoys Pełczyński's property (V) of order p. We prove that both (μ a finite positive measure) and l₁ enjoy a quantitative version of Pełczyński's property .     

On the Minimum Number of Spanning Trees in k‐Edge‐Connected Graphs

We show that a k‐edge‐connected graph on n vertices has at least spanning trees. This bound is tight if k is even and the extremal graph is the n‐cycle with edge multiplicities . For k odd, however, there is a lower bound , where . Specifically, and . Not surprisingly, c₃ is smaller than the corresponding number for 4‐edge‐connected graphs. Examples show that . However, we have no examples of 5‐edge‐connected graphs with fewer spanning trees than the n‐cycle with all edge multiplicities (except one) equal to 3, which is almost 6‐regular. We have no examples of 5‐regular 5‐edge‐connected graphs with fewer than spanning trees, which is more than the corresponding number for 6‐regular 6‐edge‐connected graphs. The analogous surprising phenomenon occurs for each higher odd edge connectivity and regularity.     

Flag‐transitive 2‐ designs of product type

In this paper, we prove that if a 2‐ design admits a flag‐transitive automorphism group G, then G is of affine, almost simple type, or product type. Furthermore, we prove that if G is product type then is either a 2‐(25, 4, 12) design or a 2‐(25, 4, 18) design with .     

Summability factor relations between absolute weighted and Cesàro means

By , we denote the set of all sequences such that Σ?_na_n is summable V whenever Σa_n is summable U, where U and V are two summability methods. Recently, Sar?göl has characterized the set for k > 1,α > ?1 and arbitrary positive sequences Now, in the present paper, we characterize the sets , k > 1 and , k ≥ 1 for arbitrary positive sequences Hence we extend these results to the range α≥ ? 1. In this way, some open problems in this topic are also completed.     

Une Famille Infinie d'Extensions Faiblement Ramifiées

We study weakly ramified extensions of ℚ with Galois group C ⋊ C_p, where p is an odd prime. In particular, we describe an infinite family of such extensions when p = 3.     

Multiple impulse solutions to McKean's caricature of the nerve equation. I—existence

McKean's caricature of the nerve equation: is considered. The H in (1) is the Heaviside function. We prove the existence of multiple impulse solutions consisting of any finite number of pulses. These solutions are referred to as n-ple impulse solutions, where n is an arbitrary positive integer.     

On the structure of sets with positive reach

We give a complete characterization of compact sets with positive reach (proximally C ¹ sets) in the plane and of one‐dimensional sets with positive reach in . Further, we prove that if is a set of positive reach of topological dimension , then A has its “k‐dimensional regular part” which is a k‐dimensional “uniform” C ^{1, 1} manifold open in A and can be locally covered by finitely many ‐dimensional DC surfaces. We also show that if has positive reach, then can be locally covered by finitely many semiconcave hypersurfaces.     

On random k‐out subgraphs of large graphs

We consider random subgraphs of a fixed graph with large minimum degree. We fix a positive integer k and let G_k be the random subgraph where each independently chooses k random neighbors, making kn edges in all. When the minimum degree then G_k is k‐connected w.h.p. for ; Hamiltonian for k sufficiently large. When , then G_k has a cycle of length for . By w.h.p. we mean that the probability of non‐occurrence can be bounded by a function (or ) where . © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 143–157, 2017     

A new approach to queer differential equations

We study the variational problem Where Ψ* is the increasing rearrangement of Ψ. An approximate problem is introduced which involves a variational problem with n free boundaries (n → ∞). Various estimates are established. In particular, when Ω is convex we show that the solution to the approximate problem is superharmonic and has bounded gradient.     

Well‐posedness of the kinematic dynamo problem

In the framework of magnetohydrodynamics, the generation of magnetic fields by the prescribed motion of a liquid conductor in a bounded region is described by the induction equation, a linear system of parabolic equations for the magnetic field components. Outside G, the solution matches continuously to some harmonic field that vanishes at spatial infinity. The kinematic dynamo problem seeks to identify those motions, which lead to nondecaying (in time) solutions of this evolution problem. In this paper, the existence problem of classical (decaying or not) solutions of the evolution problem is considered for the case that G is a ball and for sufficiently regular data. The existence proof is based on the poloidal/toroidal representation of solenoidal fields in spherical domains and on the construction of appropriate basis functions for a Galerkin procedure. Copyright © 2012 John Wiley & Sons, Ltd.     

Vizing's 2‐Factor Conjecture Involving Large Maximum Degree

Let G be an n‐vertex simple graph, and let and denote the maximum degree and chromatic index of G, respectively. Vizing proved that or . Define G to be Δ‐critical if and for every proper subgraph H of G. In 1965, Vizing conjectured that if G is an n‐vertex Δ‐critical graph, then G has a 2‐factor. Luo and Zhao showed if G is an n‐vertex Δ‐critical graph with , then G has a hamiltonian cycle, and so G has a 2‐factor. In this article, we show that if G is an n‐vertex Δ‐critical graph with , then G has a 2‐factor.     

Two Questions of Erdős on Hypergraphs above the Turán Threshold

For ordinary graphs it is known that any graph G with more edges than the Turán number of must contain several copies of , and a copy of , the complete graph on vertices with one missing edge. Erd?s asked if the same result is true for , the complete 3‐uniform hypergraph on s vertices. In this note, we show that for small values of n, the number of vertices in G, the answer is negative for . For the second property, that of containing a , we show that for the answer is negative for all large n as well, by proving that the Turán density of is greater than that of .     

Cycles with two blocks in k‐chromatic digraphs

Let k and ℓ be positive integers. A cycle with two blocks is a digraph obtained by an orientation of an undirected cycle, which consists of two internally (vertex) disjoint paths of lengths at least k and ℓ, respectively, from a vertex to another one. A problem of Addario‐Berry, Havet and Thomassé [J. Combin. Theory Ser. B 97 (2007), 620–626] asked if, given positive integers k and ℓ such that , any strongly connected digraph D containing no has chromatic number at most . In this article, we show that such digraph D has chromatic number at most , improving the previous upper bound of Cohen et al. [Subdivisions of oriented cycles in digraphs with large chromatic number, to appear]. We also show that if in addition D is Hamiltonian, then its underlying simple graph is ‐degenerate and thus the chromatic number of D is at most , which is tight.     

On the Eigenvalues of Half‐Linear Boundary Value Problems

We consider the half‐linear boundary value problem where and the weight function q is assumed to change sign. We prove the existence of two sequences , of eigenvalues and derive asymptotic estimates for as .     

Definitizability of Certain Functions and the Existence of Eigenvectors of Unitary Operators in Pontrjagin Spaces

Let P_k^c(G) denote the set of continuous functions with k negative squares on a locally compact commutative group G. Every function f ? P_k^c(G) is definitizable in the sense that is positive definite for certain complex measures ω on G with finite support [9]. The proof of this fact was base on a result of M. A. Naimark about common nonpositive eigenvectors of commuting unitary operators in a Pontrjagin space. It is the aim of this note to prove without any use of the theory of Pontrjagin spaces the definitizability of functions f ? P_k^c(G) which are of polynomial growth. In Section 3 we show, how the definitizability of functions f ? P_k^c(G) can be used to prove the existence of common non-positive eigenvectors of commuting unitary operators in a Pontrjagin space.     

Packing odd T‐joins with at most two terminals

Take a graph G, an edge subset , and a set of terminals where is even. The triple is called a signed graft. A T‐join is odd if it contains an odd number of edges from Σ. Let ν be the maximum number of edge‐disjoint odd T‐joins. A signature is a set of the form where and is even. Let τ be the minimum cardinality a T‐cut or a signature can achieve. Then and we say that packs if equality holds here. We prove that packs if the signed graft is Eulerian and it excludes two special nonpacking minors. Our result confirms the Cycling Conjecture for the class of clutters of odd T‐joins with at most two terminals. Corollaries of this result include, the characterizations of weakly and evenly bipartite graphs, packing two‐commodity paths, packing T‐joins with at most four terminals, and a new result on covering edges with cuts.