On the density of 2‐colorable 3‐graphs in which any four points span at most two edges

Let ex₂(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)Let ex₂(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)$. We improve the previously best known lower and upper bounds of 0.25682 and 3/10?ε, respectively, by showing that This implies the following new upper bound for the Turán density of K In order to establish these results we use a combination of the properties of computer‐generated extremal 3‐graphs for small n and an argument based on “super‐saturation”. Our computer results determine the exact values of ex(n, K) for n≤19 and ex₂(n, K) for n≤17, as well as the sets of extremal 3‐graphs for those n. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 105–114, 2010     

Cyclically resolvable designs and triple whist tournaments

We construct cyclically resolvable (v, 4, 1) designs and cyclic triple whist tournaments TWh(v) for all v of the form 3p…p + 1, where the p_i are primes ≡ 1 (mod 4), such that each P₁ ? 1 is divisible by the same power of 2. © 1993 John Wiley & Sons, Inc.     

New partial difference sets in p‐groups

Latin square type partial difference sets (PDS) are known to exist in R × R for various abelian p‐groups R and in ?^t. We construct a family of Latin square type PDS in ?^t × ?^2nt_p using finite commutative chain rings. When t is odd, the ambient group of the PDS is not covered by any previous construction. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 394–402, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10029     

Covering arrays with mixed alphabet sizes

Covering arrays with mixed alphabet sizes, or simply mixed covering arrays, are natural generalizations of covering arrays that are motivated by applications in software and network testing. A (mixed) covering array A of type is a k × N array with the cells of row i filled with elements from ? and having the property that for every two rows i and j and every ordered pair of elements (e,f) ∈ ? × ?, there exists at least one column c, 1 ≤ c ≤ N, such that A_i,c = e and A_j,c = f. The (mixed) covering array number, denoted by , is the minimum N for which a covering array of type with N columns exists. In this paper, several constructions for mixed covering arrays are presented, and the mixed covering array numbers are determined for nearly all cases with k = 4 and for a number of cases with k = 5. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 413–432, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10059     

Reversible and DRAD difference sets in

The existence of Hadamard difference sets has been a central question in design theory. Reversible difference sets have been studied extensively. Dillon gave a method for finding reversible difference sets in groups of the form (C)². DRAD difference sets are a newer concept. Davis and Polhill showed the existence of DRAD difference sets in the same groups as Dillon. This article determines the existence of reversible and DRAD difference sets in groups of the form (C)³. These are the only abelian 2‐groups outside of direct products of C₄ and (C)² known to contain reversible and DRAD difference sets. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:58–67, 2012     

Biembeddings of Abelian groups

We prove that, with the single exception of the 2‐group C, the Cayley table of each Abelian group appears in a face 2‐colorable triangular embedding of a complete regular tripartite graph in an orientable surface. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 71–83, 2010     

On the Lorentz-Marcinkiewicz Operator Ideal

This article deals with the LORENTZ-MARCINKIEWICZ operator ideal ?? generated by an additive s-function and the LORENTZ-MARCINKIEWICZ sequence space λ^q(φ). We give eigenvalue distributions for operators belonging to ?? (E, E) and we show the interpolation properties of ??-ideals. Furthermore, we study certain SCHAUDER bases in ?? (H, K), H and K Hilbert spaces.     

Cycle decompositions of complete multigraphs

In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph λK_n into cycles of length λ, and the λ‐fold complete symmetric digraph λK into directed cycles of length λ. As a corollary to these results we obtain necessary and sufficient conditions for decomposing λK_n (respectively, λK) into cycles (respectively, directed cycles) of prime length. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 85–93, 2010     

Function Spaces with Exponential Weights II

This paper is a continuation of [8]. We study weighted function spaces of type B and F on the Euclidean space Rⁿ, where u is a weight function of at most exponential growth. In particular, u(χ (±|χ|) is an admissible weight. We deal with atomic decompositions of these spaces. Furthermore, we prove that the spaces B and F are isomorphic to the corresponding unweighted spaces B and F.     

On Decomposition in Exponential Orlicz Spaces

Various characterizations are given of the exponential Orlicz space L and the Orlicz‐Lorentz space L. By way of application we give a simple proof of the celebrated theorem of Brézis and Wainger concerning a limiting case of a Sobolev imbedding theorem.     

Law of large numbers for increasing subsequences of random permutations

Let the random variable Z_n,k denote the number of increasing subsequences of length k in a random permutation from S_n, the symmetric group of permutations of {1,…,n}. We show that Var(Z) = o((EZ)²) as n → ∞ if and only if . In particular then, the weak law of large numbers holds for Z if ; that is, We also show the following approximation result for the uniform measure U_n on S_n. Define the probability measure μ on S_n by where U denotes the uniform measure on the subset of permutations that contain the increasing subsequence {x₁,x₂,…,x}. Then the weak law of large numbers holds for Z if and only if where ∣∣˙∣∣ denotes the total variation norm. In particular then, (*) holds if . In order to evaluate the asymptotic behavior of the second moment, we need to analyze occupation times of certain conditioned two‐dimensional random walks. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

On set systems with restricted k‐wise L‐intersection modulo a prime,and beyond

In this paper, we derive the following bound on the size of a k‐wise L‐intersecting family (resp. cross L‐intersecting families) modulo a prime number:

• (i) Let p be a prime, , and . Let and be two disjoint subsets of such that , or . Suppose that is a family of subsets of [n] such that for every and for every collection of k distinct subsets in . Then, This result may be considered as a modular version of Theorem 1.10 in [J. Q. Liu, S. G. Zhang, S. C. Li, H. H. Zhang, Eur. J. Combin. 58 (2016), 166‐180].
• (ii) Let p be a prime, , and . Let and be two subsets of such that , or , or . Suppose that and are two families of subsets of [n] such that (1) for every pair ; (2) for every ; (3) for every . Then,

This result extends the well‐known Alon–Babai–Suzuki theorem to two cross L‐intersecting families.     

On invariant measures of extensions of Markov transition functions

By using the LITTLEWOOD matrices A_2n we generalize CLARKSON' S inequalities, or equivalently, we determine the norms ‖A_2n: l(L_P) → l(L_P)‖ completely. The result is compared with the norms ‖A_2n: l → l‖, which are calculated implicitly in PIETSCH [6].     

Subgraphs smaller than the girth

For graphs A, B, let () denote the number of subsets of nodes of A for which the induced subgraph is B. If G and H both have girth > k, and if () = () for every k-node tree T, then for every k-node forest F, () = (). Say the spread of a tree is the number of nodes in a longest path. If G is regular of degree d, on n nodes, with girth > k, and if F is a forest of total spread ≤k, then the value of () depends only on n and d.     

Finding blocks and other patterns in a random coloring of ℤ

Let ξ = (ξ_k)_k∈? be i.i.d. with P(ξ_k = 0) = P(ξ_k = 1) = 1/2, and let S: = (S_k) be a symmetric random walk with holding on ?, independent of ξ. We consider the scenery ξ observed along the random walk path S, namely, the process (χ_k := ξ). With high probability, we reconstruct the color and the length of blockⁿ, a block in ξ of length ≥ n close to the origin, given only the observations (χ_k). We find stopping times that stop the random walker with high probability at particular places of the scenery, namely on blockⁿ and in the interval [?3ⁿ,3ⁿ]. Moreover, we reconstruct with high probability a piece of ξ of length of the order 3 around blockⁿ, given only 3 observations collected by the random walker starting on the boundary of blockⁿ. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Uniform stability of spectral nonlinear Galerkin methods

This article provides a stability analysis for the backward Euler schemes of time discretization applied to the spatially discrete spectral standard and nonlinear Galerkin approximations of the nonstationary Navier‐Stokes equations with some appropriate assumption of the data (λ, u₀, f). If the backward Euler scheme with the semi‐implicit nonlinear terms is used, the spectral standard and nonlinear Galerkin methods are uniform stable under the time step constraint Δt ≤ (2/λλ₁). Moreover, if the backward Euler scheme with the explicit nonlinear terms is used, the spectral standard and nonlinear Galerkin methods are uniform stable under the time step constraints Δt = O(λ) and Δt = O(λ), respectively, where λ ≤ λ, which shows that the restriction on the time step of the spectral nonlinear Galerkin method is less than that of the spectral standard Galerkin method. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

Construction of Z-cyclic triple whist tournaments

Let p = 2^kt + 1 be a prime where t>1 is an odd integer, k ≥ 2. Methods of constructing a Z-cyclic triple whist tournament TWh(p) are given. By such methods we construct a Z-cyclic TWh(p) for all primes p,p≡1(mod 4), 29 ≤ p ≤ 16097, except p = 257. Let p_i = 2t_i + 1,q = 2t₀ + 3 be primes where t_i;i = 0,1,…, n are odd > 1 and k_i are integers ≥2. We prove that if Z-cyclic TWh(p_i) and TWh(q + 1) exist then Z-cyclic TWh(∏ⁿ_{i = 1} p_i) and TWh(q∏ⁿ_{i = 1} p_i + 1) exist. © 1996 John Wiley & Sons, Inc.     

Designs from projective planes and PBD bases

The essential theme of this article is the exploitation of known configurations in projective planes in order to construct pairwise balanced designs. Among the results shown are (q² + 1)/2 ∈ B((q + 1)/2, 2) for all odd prime powers q; the resolution of 31 of the Mullin and Stinson's open cases in the spectrum of B(P₇, 1), where P₇ is odd prime powers ≥ 7; some constructions showing the inessential nature of values in E, where E are PBD generating sets containing values equal to 1 mod(a) for 5 ≤ a ≤ 7; some constructions with block sizes being prime powers ≥ 8, yielding 7 MOLS of order 158 and 9 MOLS of order 254; and some designs on 28, 38, 42, 56, 63, 68, 72, and 156 points with interesting block sizes. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 341–374, 1999     

ITERATIONS OF SATISFACTION CLASSES AND MODELS OF PEANO ARITHMETIC

We consider iterations of satisfaction classes and apply them to construct expansions of models of Peano arithmetic to models of A|Δ+∑-AC. 1991 MSC: 03F35, 03C62.     

Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3

For a k‐subset X of , the set of differences on X is the set (mod n): . A conflict‐avoiding code CAC of length n and weight k is a collection of k‐subsets of such that = ? for any distinct . Let CAC() be the class of all the CACs of length n and weight k. The maximum size of codes in CAC(n, k) is denoted by . A code CAC(n, k) is said to be optimal if = . An optimal code is tight equi‐difference if = and each codeword in is of the form . In this paper, the necessary and sufficient conditions for the existence problem of optimal tight equi‐difference conflict‐avoiding codes of length n = and weight 3 are given. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 21: 223–231, 2013