Set Systems with L‐Intersections and k‐Wise L‐Intersecting Families

In this paper, by employing linear algebra methods we obtain the following main results:

• (i) Let and be two disjoint subsets of such that Suppose that is a family of subsets of such that for every pair and for every i. Then Furthermore, we extend this theorem to k‐wise L‐intersecting and obtain the corresponding result on two cross L‐intersecting families. These results show that Snevily's conjectures proposed by Snevily (2003) are true under some restricted conditions. This result also gets an improvement of a theorem of Liu and Hwang (2013).
• (ii) Let p be a prime and let and be two subsets of such that or and Suppose that is a family of subsets of [n] such that (1) for every pair (2) for every i. Then This result improves the existing upper bound substantially.

     

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.     

From Bolzano‐Weierstraß to Arzelà‐Ascoli

We show how one can obtain solutions to the Arzelà‐Ascoli theorem using suitable applications of the Bolzano‐Weierstraß principle. With this, we can apply the results from 10 and obtain a classification of the strength of instances of the Arzelà‐Ascoli theorem and a variant of it. Let be the statement that each equicontinuous sequence of functions contains a subsequence that converges uniformly with the rate and let be the statement that each such sequence contains a subsequence which converges uniformly but possibly without any rate. We show that is instance‐wise equivalent, over , to the Bolzano‐Weierstraß principle and that is instance‐wise equivalent, over , to , and thus to the strong cohesive principle (). Moreover, we show that over the principles , and are equivalent.     

Finiteness Results in Triangle‐Free Quasi‐Symmetric Designs

Triangle‐free quasi‐symmetric 2‐ designs with intersection numbers ; and are investigated. Possibility of triangle‐free quasi‐symmetric designs with or is ruled out. It is also shown that, for a fixed x and a fixed ratio , there are only finitely many triangle‐free quasi‐symmetric designs. © 2012 Wiley Periodicals, Inc. J Combin Designs 00: 1‐6, 2012     

Hierarchical Construction of Bounded Solutions in Critical Regularity Spaces

We construct uniformly bounded solutions for the equations div U = f and U = f in the critical cases and , respectively. Criticality in this context manifests itself by the lack of a linear solution operator mapping . Thus, the intriguing aspect here is that although the problems are linear, construction of their solutions is not. Our constructions are special cases of a general framework for solving linear equations of the form , where is a linear operator densely defined in Banach space with a closed range in a (proper subspace) of Lebesgue space , and with an injective dual . The solutions are realized in terms of a multiscale hierarchical representation, , interesting for its own sake. Here, u _j's are constructed recursively as minimizers of where the residuals are resolved in terms of a dyadic sequence of scales with large enough . The nonlinear aspect of this construction is a counterpart of the fact that one cannot linearly solve in critical regularity spaces.© 2016 Wiley Periodicals, Inc.     

The Degree‐Diameter Problem for Claw‐Free Graphs and Hypergraphs

We study the degree‐diameter problem for claw‐free graphs and 2‐regular hypergraphs. Let be the largest order of a claw‐free graph of maximum degree Δ and diameter D. We show that , where , for any D and any even . So for claw‐free graphs, the well‐known Moore bound can be strengthened considerably. We further show that for with (mod 4). We also give an upper bound on the order of ‐free graphs of given maximum degree and diameter for . We prove similar results for the hypergraph version of the degree‐diameter problem. The hypergraph Moore bound states that the order of a hypergraph of maximum degree Δ, rank k, and diameter D is at most . For 2‐regular hypergraph of rank and any diameter D, we improve this bound to , where . Our construction of claw‐free graphs of diameter 2 yields a similar result for hypergraphs of diameter 2, degree 2, and any even rank .     

Uniform Semi‐Latin Squares and Their Schur‐Optimality

Let n and k be integers, with and . An semi‐Latin square S is an array, whose entries are k‐subsets of an ‐set, the set of symbols of S, such that each symbol of S is in exactly one entry in each row and exactly one entry in each column of S. Semi‐Latin squares form an interesting class of combinatorial objects which are useful in the design of comparative experiments. We say that an semi‐Latin square S is uniform if there is a constant μ such that any two entries of S, not in the same row or column, intersect in exactly μ symbols (in which case ). We prove that a uniform semi‐Latin square is Schur‐optimal in the class of semi‐Latin squares, and so is optimal (for use as an experimental design) with respect to a very wide range of statistical optimality criteria. We give a simple construction to make an semi‐Latin square S from a transitive permutation group G of degree n and order , and show how certain properties of S can be determined from permutation group properties of G. If G is 2‐transitive then S is uniform, and this provides us with Schur‐optimal semi‐Latin squares for many values of n and k for which optimal semi‐Latin squares were previously unknown for any optimality criterion. The existence of a uniform semi‐Latin square for all integers is shown to be equivalent to the existence of mutually orthogonal Latin squares (MOLS) of order n. Although there are not even two MOLS of order 6, we construct uniform, and hence Schur‐optimal, semi‐Latin squares for all integers . & 2012 Wiley Periodicals, Inc. J. Combin. Designs 00: 1–13, 2012     

On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs

In recent years, several methods have been proposed for constructing ‐optimal and minimax‐optimal supersaturated designs (SSDs). However, until now the enumeration problem of such designs has not been yet considered. In this paper, ‐optimal and minimax‐optimal k‐circulant SSDs with 6, 10, 14, 18, 22, and 26 runs, factors and are enumerated in a computer search. We have also enumerated all ‐optimal and minimax‐optimal k‐circulant SSDs with (mod 4) and . The computer search utilizes the fact that theses designs are equivalent to certain 1‐rotational resolvable balanced incomplete block designs. Combinatorial properties of these resolvable designs are used to restrict the search space.     

Pre‐Hilbert spaces with anomalous splitting and orthogonally‐closed subspace structures

Four classes of closed subspaces of an inner product space S that can naturally replace the lattice of projections in a Hilbert space are: the complete/cocomplete subspaces , the splitting subspaces , the quasi‐splitting subspaces and the orthogonally‐closed subspaces . It is well‐known that in general the algebraic structure of these families differ remarkably and they coalesce if and only if S is a Hilbert space. It is also known that when S is a hyperplane in its completion i.e. then and . On the other extreme, when i.e. then and . Motivated by this and in contrast to it, we show that in general the codimension of S in bears very little relation to the properties of these families. In particular, we show that the equalities and can hold for inner product spaces with arbitrary codimension in . At the end we also contribute to the study of the algebraic structure of by testing it for the Riesz interpolation property. We show that may fail to enjoy the Riesz interpolation property in both extreme situations when S is “very small” (i.e. and when S is ‘very big’ (i.e. .     

Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences

A is a hypergraph obtained from by splitting some or all of its vertices into more than one vertex. Amalgamating a hypergraph can be thought of as taking , partitioning its vertices, then for each element of the partition squashing the vertices to form a single vertex in the amalgamated hypergraph . In this paper, we use Nash‐Williams lemma on laminar families to prove a detachment theorem for amalgamated 3‐uniform hypergraphs, which yields a substantial generalization of previous amalgamation theorems by Hilton, Rodger, and Nash‐Williams. To demonstrate the power of our detachment theorem, we show that the complete 3‐uniform n‐partite multihypergraph can be expressed as the union of k edge‐disjoint factors, where for , is ‐regular, if and only if:

1. for all ,
2. for each i, , and
3. .

     

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.     

Determinants of classical SG‐pseudodifferential operators

We introduce a generalized trace functional TR in the spirit of Kontsevich and Vishik's canonical trace for classical SG‐pseudodifferential operators on and suitable manifolds, using a finite‐part integral regularization technique. This allows us to define a zeta‐regularized determinant for parameter‐elliptic operators , , . For , the asymptotics of as and of as are derived. For suitable pairs we show that coincides with the so‐called relative determinant .     

Limits of Near‐Coloring of Sparse Graphs

Let be nonnegative integers. A graph G is ‐colorable if its vertex set can be partitioned into sets such that the graph induced by has maximum degree at most d for , while the graph induced by is an edgeless graph for . In this article, we give two real‐valued functions and such that any graph with maximum average degree at most is ‐colorable, and there exist non‐‐colorable graphs with average degree at most . Both these functions converge (from below) to when d tends to infinity. This implies that allowing a color to be d‐improper (i.e., of type ) even for a large degree d increases the maximum average degree that guarantees the existence of a valid coloring only by 1. Using a color of type (even with a very large degree d) is somehow less powerful than using two colors of type (two stable sets).     

Three‐Phase Barker Arrays

A 3‐phase Barker array is a matrix of third roots of unity for which all out‐of‐phase aperiodic autocorrelations have magnitude 0 or 1. The only known truly two‐dimensional 3‐phase Barker arrays have size 2 × 2 or 3 × 3. We use a mixture of combinatorial arguments and algebraic number theory to establish severe restrictions on the size of a 3‐phase Barker array when at least one of its dimensions is divisible by 3. In particular, there exists a double‐exponentially growing arithmetic function T such that no 3‐phase Barker array of size with exists for all . For example, , , and . When both dimensions are divisible by 3, the existence problem is settled completely: if a 3‐phase Barker array of size exists, then .     

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.     

Dimension of images of subspaces under mappings in Triebel‐Lizorkin spaces

Let and let be a ‐quasicontinuous representative of a mapping in the Triebel‐Lizorkin space . We find an optimal value of such that for a.e. the Hausdorff dimension of is at most α. We construct examples to show that the value of β is optimal and we show that it does not increase once p goes below the critical value α.     

Maximizing H‐Colorings of a Regular Graph

For graphs G and H, a homomorphism from G to H, or H‐coloring of G, is an adjacency preserving map from the vertex set of G to the vertex set of H. Our concern in this article is the maximum number of H‐colorings admitted by an n‐vertex, d‐regular graph, for each H. Specifically, writing for the number of H‐colorings admitted by G, we conjecture that for any simple finite graph H (perhaps with loops) and any simple finite n‐vertex, d‐regular, loopless graph G, we have where is the complete bipartite graph with d vertices in each partition class, and is the complete graph on vertices.Results of Zhao confirm this conjecture for some choices of H for which the maximum is achieved by . Here, we exhibit for the first time infinitely many nontrivial triples for which the conjecture is true and for which the maximum is achieved by .We also give sharp estimates for and in terms of some structural parameters of H. This allows us to characterize those H for which is eventually (for all sufficiently large d) larger than and those for which it is eventually smaller, and to show that this dichotomy covers all nontrivial H. Our estimates also allow us to obtain asymptotic evidence for the conjecture in the following form. For fixed H, for all d‐regular G, we have where as . More precise results are obtained in some special cases.     

Turyn‐Type Sequences: Classification,Enumeration, and Construction

Turyn‐type sequences, , are quadruples of ‐sequences , with lengths , respectively, where the sum of the nonperiodic autocorrelation functions of and twice that of is a δ‐function (i.e., vanishes everywhere except at 0). Turyn‐type sequences are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for in general. By using this canonical form, we enumerate the equivalence classes of for . We also construct the first example of Turyn‐type sequences .     

The Large‐Time Solution of Burgers' Equation with Time‐Dependent Coefficients. I. The Coefficients Are Exponential Functions

In this paper, we consider an initial‐value problem for Burgers' equation with variable coefficients where x and t represent dimensionless distance and time, respectively, and , are given functions of t. In particular, we consider the case when the initial data have algebraic decay as , with as and as . The constant states and are problem parameters. Two specific initial‐value problems are considered. In initial‐value problem 1 we consider the case when and , while in initial‐value problem 2 we consider the case when and . The method of matched asymptotic coordinate expansions is used to obtain the large‐t asymptotic structure of the solution to both initial‐value problems over all parameter values.