Global Existence of Weak Solutions of the Nematic Liquid Crystal Flow in Dimension Three

For any bounded smooth domain , we establish the global existence of a weak solution of the initial boundary value (or the Cauchy) problem of the simplified Ericksen‐Leslie system LLF modeling the hydrodynamic flow of nematic liquid crystals for any initial and boundary (or Cauchy) data , with (the upper hemisphere). Furthermore, (u,d) satisfies the global energy inequality.© 2016 Wiley Periodicals, Inc.     

Circular symmetrization,subordination and arclength problems on convex functions

We study the class of univalent analytic functions f in the unit disk of the form satisfying where Ω will be a proper subdomain of which is starlike with respect to . Let be the unique conformal mapping of onto Ω with and and . Let denote the arclength of the image of the circle , . The first result in this paper is an inequality for , which solves the general extremal problem , and contains many other well‐known results of the previous authors as special cases. Other results of this article cover another set of related problems about integral means in the general setting of the class .     

Multi‐to One‐Dimensional Optimal Transport

We consider the Monge‐Kantorovich problem of transporting a probability density on to another on the line, so as to optimize a given cost function. We introduce a nestedness criterion relating the cost to the densities, under which it becomes possible to solve this problem uniquely by constructing an optimal map one level set at a time. This map is continuous if the target density has connected support. We use level‐set dynamics to develop and quantify a local regularity theory for this map and the Kantorovich potentials solving the dual linear program. We identify obstructions to global regularity through examples. More specifically, fix probability densities f and g on open sets and with . Consider transporting f onto g so as to minimize the cost . We give a nondegeneracy condition on that ensures the set of x paired with [g‐a.e.] y ∈ Y lie in a codimension‐n submanifold of X. Specializing to the case m > n = 1, we discover a nestedness criterion relating s to (f,g) that allows us to construct a unique optimal solution in the form of a map . When and g and f are bounded, the Kantorovich dual potentials (u,υ) satisfy , and the normal velocity V of with respect to changes in y is given by . Positivity of V locally implies a Lipschitz bound on f; moreover, if intersects transversally. On subsets where this nondegeneracy, positivity, and transversality can be quantified, for each integer the norms of and are controlled by these bounds, , and the smallness of . We give examples showing regularity extends from $X to part of , but not from Y to . We also show that when s remains nested for all (f,g), the problem in reduces to a supermodular problem in . © 2017 Wiley Periodicals, Inc.     

Semiframes with Block Size Three and Odd Group Size

A ‐semiframe of type is a ‐GDD of type , , in which the collection of blocks can be written as a disjoint union where is partitioned into parallel classes of and is partitioned into holey parallel classes, each holey parallel class being a partition of for some . A ‐SF is a ‐semiframe of type in which there are p parallel classes in and d holey parallel classes with respect to . In this paper, we shall show that there exists a (3, 1)‐SF for any if and only if , , , and .     

The Kidder Equation:

The Kidder problem is with and where . This looks challenging because of the square root singularity. We prove, however, that for all . Other very simple but very accurate curve fits and bounds are given in the text; . Maple code for a rational Chebyshev pseudospectral method is given as a table. Convergence is geometric until the coefficients are when the coefficients . An initial‐value problem is obtained if is known; the slope Chebyshev series has only a fourth‐order rate of convergence until a simple change‐of‐coordinate restores a geometric rate of convergence, empirically proportional to . Kidder's perturbation theory (in powers of α) is much inferior to a delta‐expansion given here for the first time. A quadratic‐over‐quadratic Padé approximant in the exponentially mapped coordinate predicts the slope at the origin very accurately up to about . Finally, it is shown that the singular case can be expressed in terms of the solution to the Blasius equation.     

Improper Coloring of Sparse Graphs with a Given Girth,II: Constructions

A graph G is ‐colorable if can be partitioned into two sets and so that the maximum degree of is at most j and of is at most k. While the problem of verifying whether a graph is (0, 0)‐colorable is easy, the similar problem with in place of (0, 0) is NP‐complete for all nonnegative j and k with . Let denote the supremum of all x such that for some constant every graph G with girth g and for every is ‐colorable. It was proved recently that . In a companion paper, we find the exact value . In this article, we show that increasing g from 5 further on does not increase much. Our constructions show that for every g, . We also find exact values of for all g and all .     

Weak Musielak–Orlicz Hardy spaces and applications

Let satisfy that , for any given , is an Orlicz function and is a Muckenhoupt weight uniformly in . In this article, the authors introduce the weak Musielak–Orlicz Hardy space via the grand maximal function and then obtain its vertical or its non–tangential maximal function characterizations. The authors also establish other real‐variable characterizations of , respectively, in terms of the atom, the molecule, the Lusin area function, the Littlewood–Paley g‐function or ‐function. All these characterizations for weighted weak Hardy spaces (namely, and with and ) are new and part of these characterizations even for weak Hardy spaces (namely, and with ) are also new. As an application, the boundedness of Calderón–Zygmund operators from to in the critical case is presented.     

On index theory for non‐Fredholm operators: A (1 + 1)‐dimensional example

Using the general formalism of 12 , a study of index theory for non‐Fredholm operators was initiated in 9 . Natural examples arise from (1 + 1)‐dimensional differential operators using the model operator in of the type , where , and the family of self‐adjoint operators in studied here is explicitly given by Here has to be integrable on and tends to zero as and to 1 as (both functions are subject to additional hypotheses). In particular, , , has asymptotes (in the norm resolvent sense) as , respectively. The interesting feature is that violates the relative trace class condition introduced in 9 , Hypothesis 2.1 ]. A new approach adapted to differential operators of this kind is given here using an approximation technique. The approximants do fit the framework of 9 enabling the following results to be obtained. Introducing , , we recall that the resolvent regularized Witten index of , denoted by , is defined by whenever this limit exists. In the concrete example at hand, we prove Here denotes the spectral shift operator for the pair of self‐adjoint operators , and we employ the normalization, , .     

On Martin's Axiom and Forms of Choice

Martin's Axiom is the statement that for every well‐ordered cardinal , the statement holds, where is “if is a c.c.c. quasi order and is a family of dense sets in P, then there is a ‐generic filter of P”. In , the fragment is provable, but not in general in . In this paper, we investigate the interrelation between and various choice principles. In the choiceless context, it makes sense to drop the requirement that the cardinal κ be well‐ordered, and we can define for any (not necessarily well‐ordered) cardinal the statement to be “if is a c.c.c. quasi order with , and is a family of dense sets in P, then there is a ‐generic filter of P”. We then define to be the statement that for every (not necessarily well‐ordered) cardinal , we have that holds. We then investigate the set‐theoretic strength of the principle .     

Forcing a countable structure to belong to the ground model

Suppose that P is a forcing notion, L is a language (in ), a P‐name such that “ is a countable L‐structure”. In the product , there are names such that for any generic filter over , and . Zapletal asked whether or not implies that there is some such that . We answer this question negatively and discuss related issues.     

The threshold for combs in random graphs

For let denote the tree consisting of an ‐vertex path with disjoint ‐vertex paths beginning at each of its vertices. An old conjecture says that for any the threshold for the random graph to contain is at . Here we verify this for with any fixed . In a companion paper, using very different methods, we treat the complementary range, proving the conjecture for (with ). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 794–802, 2016     

Finding for a Surface Σ of Characteristic −4

For each surface Σ, we define max G is a class two graph of maximum degree that can be embedded in . Hence, Vizing's Planar Graph Conjecture can be restated as if Σ is a sphere. In this article, by applying some newly obtained adjacency lemmas, we show that if Σ is a surface of characteristic . Until now, all known satisfy . This is the first case where .     

Well‐posedness of second order degenerate integro‐differential equations with infinite delay in vector‐valued function spaces

We study the well‐posedness of the second order degenerate differential equations with infinite delay: with periodic boundary conditions , where and M are closed linear operators in a Banach space satisfying , . Using operator‐valued Fourier multiplier techniques, we give necessary and sufficient conditions for the well‐posedness of this problem in Lebesgue‐Bochner spaces , periodic Besov spaces and periodic Triebel‐Lizorkin spaces .     

Clairvoyant embedding in one dimension

Let v, w be infinite 0‐1 sequences, and a positive integer. We say that is ‐embeddable in , if there exists an increasing sequence of integers with , such that , for all . Let and be coin‐tossing sequences. We will show that there is an with the property that is ‐embeddable into with positive probability. This answers a question that was open for a while. The proof generalizes somewhat the hierarchical method of an earlier paper of the author on dependent percolation. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 520–560, 2015     

A domination algorithm for {0,1}‐instances of the travelling salesman problem

We present an approximation algorithm for ‐instances of the travelling salesman problem which performs well with respect to combinatorial dominance. More precisely, we give a polynomial‐time algorithm which has domination ratio . In other words, given a ‐edge‐weighting of the complete graph on vertices, our algorithm outputs a Hamilton cycle of with the following property: the proportion of Hamilton cycles of whose weight is smaller than that of is at most . Our analysis is based on a martingale approach. Previously, the best result in this direction was a polynomial‐time algorithm with domination ratio for arbitrary edge‐weights. We also prove a hardness result showing that, if the Exponential Time Hypothesis holds, there exists a constant such that cannot be replaced by in the result above. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 427–453, 2016     

Asymptotics for the best Sobolev constants and their extremal functions

Let , where Ω is a bounded domain of , , and . We prove that , where ρ denotes the distance function to the boundary. Then, we show that, up to subsequences, the extremal functions of converge (as ) to the viscosity solutions of a specific Dirichlet problem involving the infinity Laplacian in the punctured domain , for some .     

On the set‐theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements

In set theory without the Axiom of Choice , we study the deductive strength of the statements (“Every partially ordered set without a maximal element has two disjoint cofinal subsets”), (“Every partially ordered set without a maximal element has a countably infinite disjoint family of cofinal subsets”), (“Every linearly ordered set without a maximum element has two disjoint cofinal subsets”), and (“Every linearly ordered set without a maximum element has a countably infinite disjoint family of cofinal subsets”). Among various results, we prove that none of the above statements is provable without using some form of choice, is equivalent to , + (Dependent Choices) implies , does not imply in (Zermelo‐Fraenkel set theory with the Axiom of Extensionality modified in order to allow the existence of atoms), does not imply in (Zermelo‐Fraenkel set theory minus ) and (hence, ) is strictly weaker than in .     

k‐Kings in k‐Quasitransitive Digraphs

Let D be a digraph with vertex set and arc set . A vertex x is a k‐king of D, if for every , there is an ‐path of length at most k. A subset N of is k‐independent if for every pair of vertices , we have and ; it is l‐absorbent if for every there exists such that . A ‐kernel of D is a k‐independent and l‐absorbent subset of . A k‐kernel is a ‐kernel. A digraph D is k‐quasitransitive, if for any path of length k, x₀ and are adjacent. In this article, we will prove that a k‐quasitransitive digraph with has a k‐king if and only if it has a unique initial strong component and the unique initial strong component is not isomorphic to an extended ‐cycle where each has at least two vertices. Using this fact, we show that every strong k‐quasitransitive digraph has a ‐kernel.     

On massive sets for subordinated random walks

We study massive (reccurent) sets with respect to a certain random walk defined on the integer lattice , . Our random walk is obtained from the simple random walk S on by the procedure of discrete subordination. can be regarded as a discrete space and time counterpart of the symmetric α‐stable Lévy process in . In the case we show that some remarkable proper subsets of , e.g. the set of primes, are massive whereas some proper subsets of such as the Leitmann primes are massive/non‐massive depending on the function h. Our results can be regarded as an extension of the results of McKean (1961) about massiveness of the set of primes for the simple random walk in . In the case we study massiveness of thorns and their proper subsets. The case is presented in the recent paper Bendikov and Cygan 2 .     

On an elementary operator with M‐hyponormal operator entries

A Hilbert space operator is M‐hyponormal if there exists a positive real number M such that for all . Let be M‐hyponormal and let denote either the generalized derivation or the elementary operator . We prove that if are M‐hyponormal, then satisfies the generalized Weyl's theorem and satisfies the generalized a‐Weyl's theorem for every f that is analytic on a neighborhood of .