Higher order log-concavity in Euler’s difference table

For 0≤k≤n, let be the entries in Euler’s difference table and let . Dumont and Randrianarivony showed equals the number of permutations on [n] whose fixed points are contained in {1,2,…,k}. Rakotondrajao found a combinatorial interpretation of the number in terms of k-fixed-points-permutations of [n]. We show that for any n≥1, the sequence is essentially 2-log-concave and reverse ultra log-concave.     

A new characterization of projections of quadrics in finite projective spaces of even characteristic

We will classify, up to linear representations, all geometries fully embedded in an affine space with the property that for every antiflag {p,L} of the geometry there are either 0, α, or q lines through p intersecting L. An example of such a geometry with α=2 is the following well known geometry . Let Q_n+1 be a nonsingular quadric in a finite projective space , n≥3, q even. We project Q_n+1 from a point r∉Q_n+1, distinct from its nucleus if n+1 is even, on a hyperplane not through r. This yields a partial linear space whose points are the points p of , such that the line 〈p,r〉 is a secant to Q_n+1, and whose lines are the lines of which contain q such points. This geometry is fully embedded in an affine subspace of and satisfies the antiflag property mentioned. As a result of our classification theorem we will give a new characterization theorem of this geometry.     

Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles

Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. We prove that if Δ(G)≥6, and and if Δ(G)≥8, where and denote the list edge chromatic number and list total chromatic number of G, respectively.     

Coquet-type formulas for the rarefied weighted Thue–Morse sequence

Newman proved for the classical Thue–Morse sequence, ((−1)^s(n))_n≥0, that for all N∈N with real constants satisfying c₂>c₁>0 and λ=log3/log4. Coquet improved this result and deduced , where F(x) is a nowhere-differentiable, continuous function with period 1 and η(N)∈{−1,0,1}. In this paper we obtain for the weighted version of the Thue–Morse sequence that for the sum a Coquet-type formula exists for every r∈{0,1,2} if and only if the sequence of weights is eventually periodic. From the specific Coquet-type formulas we derive parts of the weak Newman-type results that were recently obtained by Larcher and Zellinger.     

Locating–dominating codes in paths

Bertrand, Charon, Hudry and Lobstein studied, in their paper in 2004 [1], r-locating–dominating codes in paths P_n. They conjectured that if r≥2 is a fixed integer, then the smallest cardinality of an r-locating–dominating code in P_n, denoted by , satisfies for infinitely many values of n. We prove that this conjecture holds. In fact, we show a stronger result saying that for any r≥3 we have for all n≥n_r when n_r is large enough. In addition, we solve a conjecture on location–domination with segments of even length in the infinite path.     

A Representation of Projection Lattices and Their States in Euclidean Space

We propose a representationr : ∪ Ω → ^ν, where is the collection of closed subspaces of ann-dimensional real, complex, or quaternionic Hilbert space , or equivalently, the projection lattice of this Hilbert space, where Ω is the set of all states ω : → [0, 1]. The value that ω ∈ Ω takes ina ∈ is given by the scalar product of the representative points (r(a) andr(ω)). The representationr(a ∨ b) of the join of two orthogonal elementsa, b ∈ is equal tor(a) + r(b). The convex closure of the representation of Σ, the set of atoms of , is equal to the representation of Ω.     

Adjoint polynomials of bridge–path and bridge–cycle graphs and Chebyshev polynomials

The chromatic polynomial of a simple graph G with n>0 vertices is a polynomial of degree n, where α_k(G) is the number of k-independent partitions of G for all k. The adjoint polynomial of G is defined to be , where is the complement of G. We find explicit formulas for the adjoint polynomials of the bridge–path and bridge–cycle graphs. Consequence, we find the zeros of the adjoint polynomials of several families of graphs.     

On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification

Let be identically distributed random vectors in R^d, independently drawn according to some probability density. An observation is said to be a layered nearest neighbour (LNN) of a point if the hyperrectangle defined by and contains no other data points. We first establish consistency results on , the number of LNN of . Then, given a sample of independent identically distributed random vectors from R^d×R, one may estimate the regression function by the LNN estimate , defined as an average over the Y_i’s corresponding to those which are LNN of . Under mild conditions on r, we establish the consistency of towards 0 as n→∞, for almost all and all p≥1, and discuss the links between r_n and the random forest estimates of Breiman (2001) [8]. We finally show the universal consistency of the bagged (bootstrap-aggregated) nearest neighbour method for regression and classification.     

Boxicity of line graphs

The boxicity of a graph H, denoted by , is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper we show that for a line graph G of a multigraph, , where Δ(G) denotes the maximum degree of G. Since G is a line graph, Δ(G)≤2(χ(G)−1), where χ(G) denotes the chromatic number of G, and therefore, . For the d-dimensional hypercube Q_d, we prove that . The question of finding a nontrivial lower bound for was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795–5800].The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once).     

Problems arising from jackknifing the estimate of a Kaplan-Meier integral

Stute and Wang (1994) considered the problem of estimating the integral S^θ = ∫ θ dF, based on a possibly censored sample from a distribution F, where θ is an F-integrable function. They proposed a Kaplan-Meier integral to approximate S^θ and derived an explicit formula for the delete-1 jackknife estimate . differs from only when the largest observation, X_(n), is not censored (δ_(n) = 1 and next-to-the-largest observation, X_(n-1), is censored (δ_(n-1) = 0). In this note, it will pointed out that when X_(n) is censored is based on a defective distribution, and therefore can badly underestimate . We derive an explicit formula for the delete-2 jackknife estimate . However, on comparing the expressions of and , their difference is negligible. To improve the performance of and , we propose a modified estimator according to Efron (1980). Simulation results demonstrate that is much less biased than and and .     

Mutually orthogonal equitable Latin rectangles

Let ab=n². We define an equitable Latin rectangle as an a×b matrix on a set of n symbols where each symbol appears either or times in each row of the matrix and either or times in each column of the matrix. Two equitable Latin rectangles are orthogonal in the usual way. Denote a set of ka×b mutually orthogonal equitable Latin rectangles as a k– MOELR (a,b;n). When a≠9,18,36, or 100, then we show that the maximum number of k– MOELR (a,b;n)≥3 for all possible values of (a,b).     

Modulation spaces, Wiener amalgam spaces, and Brownian motions

We study the local-in-time regularity of the Brownian motion with respect to localized variants of modulation spaces and Wiener amalgam spaces . We show that the periodic Brownian motion belongs locally in time to and for (s−1)q<−1, and the condition on the indices is optimal. Moreover, with the Wiener measure μ on T, we show that and form abstract Wiener spaces for the same range of indices, yielding large deviation estimates. We also establish the endpoint regularity of the periodic Brownian motion with respect to a Besov-type space . Specifically, we prove that the Brownian motion belongs to for (s−1)p=−1, and it obeys a large deviation estimate. Finally, we revisit the regularity of Brownian motion on usual local Besov spaces , and indicate the endpoint large deviation estimates.     

Random induced subgraphs of Cayley graphs induced by transpositions

In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations with independent probability, λ_n. Our main result is that for any minimal generating set of transpositions, for probabilities where and δ>0, a random induced subgraph has a.s. a unique largest component of size . Here x(?_n) is the survival probability of a Poisson branching process with parameter λ=1+?_n.     

Sequences that omit a box (modulo 1)

Let be a strictly increasing sequence of real numbers satisfying(0.1)aj+1−aj?σ>0. For an open box I in [0,1d⁾, we write It is shown that the Hausdorff dimension of is d−1 whenever The case d=1 is due to Boshernitzan. The proof builds on his approach.Now let S₁,…,Sd be strictly increasing in N. Define to be the set of x in [0, 1) for which A sequence S is said to fulfill condition D(C) if it containsBr=[ur,vr]∩S for which vr−ur→∞ and1+vr−ur?C#(Br). Kaufman has shown that is countable whenever S₁,…,Sd fulfill condition D(C). Here it is shown that is finite under this hypothesis. An upper bound for is provided.     

Large minors in graphs with given independence number

A weakening of Hadwiger’s conjecture states that every n-vertex graph with independence number α has a clique minor of size at least . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least vertices where c>1/19.2.     

Upper bounds on the linear chromatic number of a graph

A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is a union of vertex-disjoint paths. The linear chromatic number of G is the smallest number of colors in a linear coloring of G.Let G be a graph with maximum degree Δ(G). In this paper we prove the following results: (1) ; (2) if Δ(G)≤4; (3) if Δ(G)≤5; (4) if G is planar and Δ(G)≥52.     

A pattern sequence approach to Stern’s sequence

Suppose that w∈1{0,1}^∗ and let a_w(n) be the number of occurrences of the word w in the binary expansion of n. Let {s(n)}_n?0 denote the Stern sequence, defined by s(0)=0, s(1)=1, and for n?1, In this note, we show that where denotes the complement of w (obtained by sending 0?1 and 1?0) and [w]₂ denotes the integer specified by the word w∈{0,1}^∗ interpreted in base 2.     

Counting lattice chains and Delannoy paths in higher dimensions

Lattice chains and Delannoy paths represent two different ways to progress through a lattice. We use elementary combinatorial arguments to derive new expressions for the number of chains and the number of Delannoy paths in a lattice of arbitrary finite dimension. Specifically, fix nonnegative integers n₁,…,n_d, and let L denote the lattice of points (a₁,…,a_d)∈Z^d that satisfy 0≤a_i≤n_i for 1≤i≤d. We prove that the number of chains in L is given by where . We also show that the number of Delannoy paths in L equals Setting n_i=n (for all i) in these expressions yields a new proof of a recent result of Duchi and Sulanke [9] relating the total number of chains to the central Delannoy numbers. We also give a novel derivation of the generating functions for these numbers in arbitrary dimension.     

On the eccentric connectivity index of a graph

If G is a connected graph with vertex set V, then the eccentric connectivity index of G, ξ^C(G), is defined as where is the degree of a vertex v and is its eccentricity. We obtain an exact lower bound on ξ^C(G) in terms of order, and show that this bound is sharp. An asymptotically sharp upper bound is also derived. In addition, for trees of given order, when the diameter is also prescribed, precise upper and lower bounds are provided.