Embedding finite posets in cubes

In this paper we define the n-cube Q_n as the poset obtained by taking the cartesian product of n chains each consisting of two points. For a finite poset X, we then define dim₂X as the smallest positive integer n such that X can be embedded as a subposet of Q_n. For any poset X we then have log₂ |X| ? dim₂X ? |X|. For the distributive lattice $\text{L =}\text{2}{}^{\mathrm{X}}$, dim₂L = |X| and for the crown S^k_n, dim₂ (S^k_n) = n + k. For each k ? 2, there exist positive constants c₁ and c₂ so that for the poset X consisting of all one element and k-element subsets of an n-element set, the inequality c₁ log₂n < dim₂(X) < c₂ log₂n holds for all n with k < n. A poset is called Q-critical if dim₂ (X ? x) < dim₂(X) for every x ? X. We define a join operation ⊕ on posets under which the collection Q of all Q-critical posets which are not chains forms a semigroup in which unique factorization holds. We then completely determine the subcollection $\text{M}$ ? Q consisting of all posets X for which dim₂ (X) = |X|.     

Maximal dimensional partially ordered sets III: a characterization of Hiraguchi's inequality for interval dimension

Dushnik and Miller defined the dimensions of a partially ordered set X,denoted dim X, as the smallest positive integer t for which there exist t linear extensions of X whose intersection is the partial ordering on X. Hiraguchi proved that if n ≥2 and |X| ≤2n+1, then dim X ≤ n. Bogart, Trotter and Kimble have given a forbidden subposet characterization of Hiraguchi's inequality by determining for each n ≥ 2, the minimum collection of posets ?_n such that if |X| ?2n+1, the dim X < n unless X contains one of the posets from ?_n. Although |?₃|=24, for each n ≥ 4, ?_n contains only the crown S⁰_n — the poset consisting of all 1 element and n ? 1 element subsets of an n element set ordered by inclusion. In this paper, we consider a variant of dimension, called interval dimension, and prove a forbidden subposet characterization of Hiraguchi's inequality for interval dimension: If n ≥2 and |X 2n+1, the interval dimension of X is less than n unless X contains S⁰_n.     

On (s,t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K₂ or to K_2,l with l odd.     

Connectivity,genus, and the number of components in vertex-deleted subgraphs

Let c(G) denote the number of components in a graph G. It is shown that if G has genus γ and isk-connected with k ? 3, then c(G ? X) ? (2/(k ? 2))(| X | ? 2 + 2γ), for all X? V(G) with | X | ? k. Some implications of this result for planar graphs (y = 0) and toroidal graphs (y = 1) are considered.     

A lower bound for the packing chromatic number of the Cartesian product of cycles

Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X _i ? V(G) is called an i-packing if each two distinct vertices in X _i are more than i apart. A packing colouring of G is a partition X = {X ₁, X ₂, …, X _k } of V(G) such that each colour class X _i is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χ_ρ(G). In this paper we show, using a theoretical proof, that if q = 4t, for some integer t ≥ 3, then 9 ≤ χ_ρ(C ₄ □ C _q ). We will also show that if t is a multiple of four, then χ_ρ(C ₄ □ C _q ) = 9.     

Sets of nonnegative matrices with positive inhomogeneous products

Let X be a set of k×k matrices in which each element is nonnegative. For a positive integer n, let P(n) be an arbitrary product of n matrices from X, with any ordering and with repetitions permitted. Define X to be a primitive set if there is a positive integer n such that every P(n) is positive [i.e., every element of every P(n) is positive]. For any primitive set X of matrices, define the index g(X) to be the least positive n such that every P(n) is positive. We show that if X is a primitive set, then g(X)?2^k?2. Moreover, there exists a primitive set Y such that g(Y) = 2^k?2.     

On-Line Dimension for Posets Excluding Two Long Incomparable Chains

For a positive integer k, let k?+?k denote the poset consisting of two disjoint k-element chains, with all points of one chain incomparable with all points of the other. Bosek, Krawczyk and Szczypka showed that for each k?≥?1, there exists a constant c _k so that First Fit will use at most $c_kw^2$ chains in partitioning a poset P of width at most w, provided the poset excludes k?+?k as a subposet. This result played a key role in the recent proof by Bosek and Krawczyk that O(w ^16logw ) chains are sufficient to partition on-line a poset of width w into chains. This result was the first improvement in Kierstead’s exponential bound: (5 ^w ???1)/4 in nearly 30 years. Subsequently, Joret and Milans improved the Bosek–Krawczyk–Szczypka bound for the performance of First Fit to 8(k???1)² w, which in turn yields the modest improvement to O(w ^14logw ) for the general on-line chain partitioning result. In this paper, we show that this class of posets admits a notion of on-line dimension. Specifically, we show that when k and w are positive integers, there exists an integer t?=?t(k,w) and an on-line algorithm that will construct an on-line realizer of size t for any poset P having width at most w, provided that the poset excludes k?+?k as a subposet.     

On three-designs of small order

For positive integers t?k?v and λ we define a t-design, denoted B_i[k,λ;v], to be a pair (X,B) where X is a set of points and B is a family, (B_i:i?I), of subsets of X, called blocks, which satisfy the following conditions: (i) |X|=v, the order of the design, (ii) |B_i|=k for each i?I, and (iii) every t-subset of X is contained in precisely λ blocks. The purpose of this paper is to investigate the existence of 3-designs with 3?k?v?32 and λ>0.Wilson has shown that there exists a constant N(t, k, v) such that designs B_t[k,λ;v] exist provided λ>N(t,k,v) and λ satisfies the trivial necessary conditions. We show that N(3,k,v)=0 for most of the cases under consideration and we give a numerical upper bound on N(3, k, v) for all 3?k?v?32. We give explicit constructions for all the designs needed.     

Estimation of the Gauss–Markov process from observation of its sign

Let X(t) be the ergodic Gauss–Markov process with mean zero and covariance function e^?|τ|. Let D(t) be +1, 0 or ?1 according as X(t) is positive, zero or negative. We determine the non-linear estimator of X(t₁) based solely on D(t), ?T ? t ? 0, that has minimal mean–squared error ε²(t₁, T). We present formulae for ε²(t₁, T) and compare it numerically for a range of values of t₁ and T with the best linear estimator of X(t₁) based on the same data.     

A note on the probabilistic approach to Turán's problem

The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let X_s(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(X_l), given that min(X_l) ≥ 1. The following lower bound on the variance of X_s is proved:

$\text{Var(X}{}_{\mathrm{s}}\text{)?mm}\text{n?2k}\text{s?k}\text{n}\text{s}{}^{\mathrm{?1}}\text{n}\text{k}{}^1$

, where m = |E(H)| and $\text{m}\text{= (}{}_{\mathrm{k}}{}^{\mathrm{n}}\text{) ? m}$. This implies the following: putting t(k, l) = lim_n→∞T(n, l, k)(_kⁿ)^?1 then t(k, l) ≥ T(s, l, k)((_k^s) ? 1)^?1, whenever s ≥ l > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.     

Weak approximation over function fields of curves over large or finite fields

Let K = k(C) be the function field of a curve over a field k and let X be a smooth, projective, separably rationally connected K-variety with ${X(K)\neq\emptyset}Let K = k(C) be the function field of a curve over a field k and let X be a smooth, projective, separably rationally connected K-variety with X(K) 1 ?{X(K)\neq\emptyset}. Under the assumption that X admits a smooth projective model p: X? C{\pi: \mathcal{X}\to C}, we prove the following weak approximation results: (1) if k is a large field, then X(K) is Zariski dense; (2) if k is an infinite algebraic extension of a finite field, then X satisfies weak approximation at places of good reduction; (3) if k is a nonarchimedean local field and R-equivalence is trivial on one of the fibers X_p{\mathcal{X}_p} over points of good reduction, then there is a Zariski dense subset W í C(k){W\subseteq C(k)} such that X satisfies weak approximation at places in W. As applications of the methods, we also obtain the following results over a finite field k: (4) if |k| > 10, then for a smooth cubic hypersurface X/K, the specialization map X(K)? ?_{p ? P}X_p(k(p)){X(K)\longrightarrow \prod_{p\in P}\mathcal{X}_p(\kappa(p))} at finitely many points of good reduction is surjective; (5) if char k 1 2, 3{\mathrm{char}\,k\neq 2,\,3} and |k| > 47, then a smooth cubic surface X over K satisfies weak approximation at any given place of good reduction.     

Existence and asymptotic behavior of a functional differential equation in Banach space

Existence and asymptotic behavior of solutions are given for the equation u′(t) = ?A(t)u(t) + F(t,u_t) (t ? 0) and u₀ = ? ? C([?r,0]; X)  C. The space X is a Banach space; the family $\text{{A(t) ¦ 0 ? t ? T}}$ of unbounded linear operators defined on D(A) ? X → X generates a linear evolution system and F: C → X is continuous with respect to a fractional power of A(t₀) for some t₀ ? [0, T].     

Graphical t-wise balanced designs

A pair (X, $\text{B}$) will be a t-wise balanced design (tBD) of type t?(v, K, λ) if $\text{B}\text{= (B}{}_{\mathrm{i}}\text{: i ? I)}$ is a family of subsets of X, called blocks, such that: (i) $\text{|X| = v ?}\text{N}$, where $\text{N}$ is the set of positive integers; (ii) $\text{1?t?|B}{}_{\mathrm{i}}\text{|?K?}\text{N}$, for every i ? I; and (iii) if T ? X, |T| = t, then there are λ ? $\text{N}$ indices i ? I where T ? B_i. Throughout this paper we make three restrictions on our tBD's: (1) there are no repeated blocks, i.e. $\text{B}$ will be a set of subsets of X; (2) t ? K or there are no blocks of size t; and (3) $\text{P}{}_{\mathrm{k}}\text{(X)?}\text{B}$ or $\text{B}$ does not contain all k-subsets of X for any t<k?v. Note then that X ? $\text{B}$. Also, if we give the parameters of a specific tBD, then we will choose a minimal K.We focus on the $\text{t?((}\text{p}\text{2}\text{), K, λ)}$ designs with the symmetric group S_p as automorphism group, i.e. X will be the set of $\text{v = (}\text{p}\text{2}\text{)}$ labelled edges of the undirected complete graph K_p and if B ? $\text{B}$ then all subgraphs of K_p isomorphic to B are also in $\text{B}$. Call such tBD's ‘graphical tBD's’. We determine all graphical tBD's with λ = 1 or 2 which will include one with parameters 4?(15,{5,7},1).     

The dynamics of the line and path graph operators

For any integerk e 1 thek- path graph P_k (G) of a graph G has all length-k subpaths ofG as vertices, and two such vertices are adjacent whenever their union (as subgraphs ofG) forms a path or cycle withk + 1 edges. Fork = 1 we get the well-known line graphP ₁ (G) =L(G). Iteratedk-path graphs P^t _k(G) are defined as usual by P^t _k (G) := P_k(P ^t?1 _k(G)) ift < 1, and by P¹ _k(G): = P_k(G). A graph G isP _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -periodic. A graph has infiniteP _k -depth if for any positive integert there is a graphH such that P^t _k(H) ?G. In this paperP _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -periodic graphs,P _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -convergent graphs, and graphs with infiniteP _k -periodic if it is isomorphic to some iteratedk-path graph of itself; itP _k -converges if some iteratedk-path graph of G isP _k -depth are characterized inside some subclasses of the class of locally finite graphs fork = 1, 2.     

A new bound on the cardinality of homogeneous compacta

We show (in ZFC) that if X is a compact homogeneous Hausdorff space then |X|?²t(X), where t(X) denotes the tightness of X. It follows that under GCH the character and the tightness of such a space coincide.     

Testing for change in the mean via convergence in distribution of sup-functionals of weighted tied-down partial sums processes

Let X ₁,..., X _n, n > 1, be nondegenerate independent chronologically ordered realvalued observables with finite means. Consider the “no-change in the mean” null hypothesis H ₀: X ₁,..., X _n is a randomsample on X with Var X <∞. We revisit the problem of nonparametric testing for H ₀ versus the “at most one change (AMOC) in the mean” alternative hypothesis H _A: there is an integer k*, 1 ≤ k* < n, such that EX ₁ = · · · = EX_k* ≠ EX_k*+1 = ··· = EX _n. A natural way of testing for H ₀ versus H _A is via comparing the sample mean of the first k observables to the sample mean of the last n - k observables, for all possible times k of AMOC in the mean, 1 ≤ k < n. In particular, a number of such tests in the literature are based on test statistics that are maximums in k of the appropriately individually normalized absolute deviations Δ_k = |S _k/k - (S _n - S _k)/(n - k)|, where S _k:= X ₁ + ··· + X _k. Asymptotic distributions of these test statistics under H ₀ as n → ∞ are obtained via establishing convergence in distribution of supfunctionals of respectively weighted |Z _n(t)|, where {Z _n(t), 0 ≤ t ≤ 1}_n≥1 are the tied-down partial sums processes such that

$${Z_n}\left( t \right): = \left( {{S_{\left\lceil {\left( {n + 1} \right)t} \right\rceil }} - \left[ {\left( {n + 1} \right)t} \right]{S_n}/n} \right)/\sqrt n $$

if 0 ≤ t < 1, and Z _n(t):= 0 if t = 1. In the present paper, we propose an alternative route to nonparametric testing for H ₀ versus H _A via sup-functionals of appropriately weighted |Z _n(t)|. Simply considering max_1?k<n Δk as a prototype test statistic leads us to establishing convergence in distribution of special sup-functionals of |Z _n(t)|/(t(1 - t)) under H ₀ and assuming also that E|X|^r < ∞ for some r > 2. We believe the weight function t(1 - t) for sup-functionals of |Z _n(t)| has not been considered before.

     

More on the generalized Macaulay theorem

Let k₁ ? k₂ ? … ? k_n be given positive integers and let F denote the set of vectors (l₁, …, l_n) with integer components satisfying 0 ? l_i ? k_i, i = 1, 2, …, n. If H is a subset of F, let (l)H denote the subset of H consisting of those vectors with component sum l, and let C((l)H) denote the smallest [(l)H] elements of (l)F. The generalized Macaulay theorem due to the author and B. Lindström [3] shows that |Gamma;((C)(l)(H)|, ? |Γ(C((l)H))|, where Γ((l)H) is the setof vectors in F obtainable by subtracting l from a single component of a vector in (l)H. A method is given for computing [Γ(C((l)H)] in this paper. It is analogous to the method for computing |Γ(C(l)H))| in the k₁ = … = k_n = 1 case which has been given independently by Katona [4] and Kruskal [5].     

Sur les arborescences dans un graphe oriente

The main result of this paper is the following theorem: Let G = (X,E) be a digraph without loops or multiple edges, |X| ?3, and h be an integer ?1, if G contains a spanning arborescence and if d⁺_G(x)+d^?_G(x)+d^?_G(y)+d^?_G(y)? 2|X |?2h?1 for all x, y?X, x ≠ y, non adjacent in G, then G contains a spanning arborescence with ?h terminal vertices. A strengthening of Gallai-Milgram's theorem is also proved.