A note on the Structure of Turán Densities of Hypergraphs

Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if there exists c > 0 such that no number in (α, α + c) can be the Turán density of a family of r-uniform graphs. A result of Erd?s and Stone implies that every α ∈ [0, 1) is a jump for r = 2. Erd?s asked whether the same is true for r ≥ 3. Frankl and Rödl gave a negative answer by showing an infinite sequence of non-jumps for every r ≥ 3. However, there are still a lot of open questions on determining whether or not a number is a jump for r ≥ 3. In this paper, we first find an infinite sequence of non-jumps for r = 4, then extend one of them to every r ≥ 4. Our approach is based on the techniques developed by Frankl and Rödl.     

On Jumping Densities of Hypergraphs

A number \({\alpha\in [0, 1)}\) is a jump for an integer r ≥ 2 if there exists a constant c > 0 such that for any family \({{\mathcal F}}\) of r-uniform graphs, if the Turán density of \({{\mathcal F}}\) is greater than α, then the Turán density of \({{\mathcal F}}\) is at least α + c. A fundamental result in extremal graph theory due to Erd?s and Stone implies that every number in [0, 1) is a jump for r = 2. Erd?s also showed that every number in [0, r!/r ^r ) is a jump for r ≥ 3. However, not every number in [0, 1) is a jump for r ≥ 3. In fact, Frankl and Rödl showed the existence of non-jumps for r ≥ 3. By a similar approach, more non-jumps were found for some r ≥ 3 recently. But there are still a lot of unknowns regarding jumps for hypergraphs. In this note, we show that if \({c\cdot{\frac{r!}{r^r}}}\) is a non-jump for r ≥ 3, then for every p ≥ r, \({c\cdot{\frac{p!}{p^p}}}\) is a non-jump for p.     

Power-Commuting Generalized Skew Derivations in Prime Rings

Let R be a non-commutative prime ring of characteristic different from 2 with extended centroid C, F ≠ 0 a generalized skew derivation of R, and n ≥ 1 such that [F(x), x] ⁿ  = 0, for all x ∈ R. Then there exists an element λ ∈ C such that F(x) = λx, for all x ∈ R.     

On the gonality sequence of smooth curves

Let C be a smooth curve of genus g. For each positive integer r the r-gonality d _r (C) of C is the minimal integer t such that there is \({L\in {\rm Pic}^t(C)}\) with h ⁰(C, L) = r + 1. Here we use nodal plane curves to construct several smooth curves C with d ₂(C)/2 < d ₃(C)/3, i.e., for which a slope inequality fails.     

Non-Jumping Numbers for 4-Uniform Hypergraphs

Let r≥2 be an integer. A real number α ∈ [0,1) is a jump for r if for any Open image in new window >0 and any integer m, m≥r, any r-uniform graph with n>n₀( Open image in new window ,m) vertices and at least Open image in new window edges contains a subgraph with m vertices and at least Open image in new window edges, where c=c(α) does not depend on Open image in new window and m. It follows from a theorem of Erd?s, Stone and Simonovits that every α ∈ [0,1) is a jump for r=2. Erd?s asked whether the same is true for r≥3. Frankl and Rödl gave a negative answer by showing that Open image in new window is not a jump for r if r≥3 and l>2r. Following a similar approach, we give several sequences of non-jumping numbers generalizing the above result for r=4.     

A new characterization of RBMO(<Emphasis Type="Italic">μ</Emphasis>) by John-Strömberg sharp maximal functions

Let μ be a nonnegative Radon measure on ? ^d which only satisfies μ (B(x, r)) ? C ₀ r ⁿ for all x ∈ ? ^d , r > 0, with some fixed constants C ₀ > 0 and n ∈ (0, d]. In this paper, a new characterization for the space RBMO(μ) of Tolsa in terms of the John-Strömberg sharp maximal function is established.     

A Characterization of Graphs Where the Independence Number Equals the Radius

In a classical 1986 paper by Erdös, Saks and Saós every graph of radius r has an induced path of order at least 2r ? 1. This result implies that the independence number of such graphs is at least r. In this paper, we use a result of S. Fajtlowicz about radius-critical graphs to characterize graphs where the independence number is equal to the radius, for all possible values of the radius except 2, 3, and 4. We briefly discuss these remaining cases as well.     

A variation of a conjecture due to Erdös and Sós

Erdoes and Soes conjectured in 1963 that every graph G on n vertices with edge number e（G） 〉 1/2（k - 1）n contains every tree T with k edges as a subgraph. In this paper, we consider a variation of the above conjecture, that is, for n 〉 9/ 2k^2 ＋ 37/2＋ 14 and every graph G on n vertices with e（G） 〉 1/2 （k- 1）n, we prove that there exists a graph G＇ on n vertices having the same degree sequence as G and containing every tree T with k edges as a subgraph.     

Asymptotic results for jump probabilities associated to the multiple scan statistic

The concept of pattern arises in many applications comprising experimental trials with two or more possible outcomes in each trial. A binary scan of type r / k is a special pattern referring to success–failure strings of fixed length k that contain at least r-successes, where r, k are positive integers with \(r\le k\). The multiple scan statistic \(W_{t,k,r}\) is defined as the enumerating random variable for the overlapping moving windows occurring until trial t which include a scan of type r / k. In the present work, we consider a sequence of independent binary trials with not necessarily equal probabilities of success and develop upper bounds for the probability of the event that the multiple scan statistic will perform a jump from \(\ell \) to \(\ell +1\) (where \(\ell \) is a nonnegative integer) in a finite time horizon.     

Proof of the bandwidth conjecture of Bollobás and Komlós

In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and integers r ≥ 1 and Δ, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ((r ? 1)/r + γ)n and H is an r-chromatic graph with n vertices, bandwidth at most β n and maximum degree at most Δ, then G contains a copy of H.     

Random embedding of $${\ell_p^n}$$ into $${\ell_r^N}$$

For any 0 < p < 2 and any natural numbers N > n, we give an explicit definition of a random operator \({S : \ell_p^n \to \mathbb{R}^N}\) such that for every 0 < r < p < 2 with r ≤ 1, the operator \({S_r = S : \ell_p^n \to \ell_r^N}\) satisfies with overwhelming probability that \({\|S_r\| \, \|(S_r)_{| {\rm Im}\, S}^{-1}\| \le C(p,r)^{n/(N-n)}}\), where C(p, r) > 0 is a real number depending only on p and r. One of the main tools that we develop is a new type of multidimensional Esseen inequality for studying small ball probabilities.     

On the optimal robust solution of IVPs with noisy information

We investigate the optimal solution of systems of initial-value problems with smooth right-hand side functions f from a Hölder class \(F^{r,\varrho }_{\text {reg}}\), where r ≥ 0 is the number of continuous derivatives of f, and ? ∈ (0, 1] is the Hölder exponent of rth partial derivatives. We consider algorithms that use n evaluations of f, the ith evaluation being corrupted by a noise δ_i of deterministic or random nature. For δ ≥ 0, in the deterministic case the noise δ_i is a bounded vector, ∥δ_i∥≤δ. In the random case, it is a vector-valued random variable bounded in average, (E(∥δ_i∥^q))^1/q ≤ δ, q ∈ [1, + ∞). We point out an algorithm whose L_p error (p ∈ [0, + ∞]) is O(n ^{? (r + ?)} + δ), independently of the noise distribution. We observe that the level n ^{? (r + ?)} + δ cannot be improved in a class of information evaluations and algorithms. For ε > 0, and a certain model of δ-dependent cost, we establish optimal values of n(ε) and δ(ε) that should be used in order to get the error at most ε with minimal cost.     

Rational realization of the minimum ranks of nonnegative sign pattern matrices

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set {+,?, 0} ({+, 0}, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of A. Using a correspondence between sign patterns with minimum rank r ≥ 2 and point-hyperplane configurations in R^r?1 and Steinitz’s theorem on the rational realizability of 3-polytopes, it is shown that for every nonnegative sign pattern of minimum rank at most 4, the minimum rank and the rational minimum rank are equal. But there are nonnegative sign patterns with minimum rank 5 whose rational minimum rank is greater than 5. It is established that every d-polytope determines a nonnegative sign pattern with minimum rank d + 1 that has a (d + 1) × (d + 1) triangular submatrix with all diagonal entries positive. It is also shown that there are at most min{3m, 3n} zero entries in any condensed nonnegative m × n sign pattern of minimum rank 3. Some bounds on the entries of some integer matrices achieving the minimum ranks of nonnegative sign patterns with minimum rank 3 or 4 are established.     

The Bernstein-Szegö inequality for fractional derivatives of trigonometric polynomials

On the set F _n of trigonometric polynomials of degree n ≥ 1 with complex coefficients, we consider the Szegö operator \(D_\theta ^\alpha \) defined by the relation \(D_\theta ^\alpha f_n (t) = \cos \theta D^\alpha f_n (t) - \sin \theta D^\alpha \tilde f_n (t)\) for α, θ ∈ ?, where α ≥ 0. Here, \(D^\alpha f_n \) and \(D^\alpha \tilde f_n \) are the Weyl fractional derivatives of (real) order α of the polynomial f _n and of its conjugate \(\tilde f_n \). In particular, we prove that, if α ≥ n ln 2n, then, for any θ ∈ ?, the sharp inequality \(\left\| {\cos \theta D^\alpha f_n - \sin \theta D^\alpha f_n } \right\|_{L_p } \leqslant n^\alpha \left\| {f_n } \right\|_{L_p } \) holds on the set F _n in the spaces L _p for all p ≥ 0. For classical derivatives (of integer order α ≥ 1), this inequality was obtained by Szegö in the uniform norm (p = ∞) in 1928 and by Zygmund for 1 ≤ p < ∞ in 1931–1935. For fractional derivatives of (real) order α ≥ 1 and 1 ≤ p ≤ ∞, the inequality was proved by Kozko in 1998.     

Exact Solutions of a Second-Order Nonlinear Partial Differential Equation

The equation ?²u/?t?x + u^p?u/?x = u^q describing a nonstationary process in semiconductors, with parameters p and q that are a nonnegative integer and a positive integer, respectively, and satisfy p + q ≥ 2, is considered in the half-plane (x, t) ∈ ? × (0,∞). All in all, fourteen families of its exact solutions are constructed for various parameter values, and qualitative properties of these solutions are noted. One of these families is defined for all parameter values indicated above.     

Hausdorff dimension of the maximal run-length in dyadic expansion

For any x ∈ [0, 1), let x = [? ₁, ? ₂, …,] be its dyadic expansion. Call r _n (x):= max{j ? 1: ? _i+1 = … = ? _i+j = 1, 0 ? i ? n ? j} the n-th maximal run-length function of x. P.Erdös and A.Rényi showed that \(\mathop {\lim }\limits_{n \to \infty } \) r _n (x)/log₂ n = 1 almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose runlength function assumes on other possible asymptotic behaviors than log₂ n, is quantified by their Hausdorff dimension.     

The Erdös-Kac theorem for additive arithmetical semigroups

We show that the Erdös-Kac theorem for additive arithmetical semigroups can be proved under the condition that the counting function of elements has the asymptotics G(n) = q ⁿ (A + O(1/(lnn)^k) as n → ∞ with A > 0, q > 1, and arbitrary k ∈ ? and that P(n) = O(q ⁿ /n) for the number of prime elements of degree n. This improves a result of Zhang.     

Hamiltonian Type Properties in Claw-Free $$P_5$$-Free Graphs

A graph G on n vertices is said to be (k, m)-pancyclic if every set of k vertices in G is contained in a cycle of length r for each integer r in the set \(\{ m, m + 1, \ldots , n \}\). This property, which generalizes the notion of a vertex pancyclic graph, was defined by Faudree et al. in (Graphs Combin 20:291–310, 2004). The notion of (k, m)-pancyclicity provides one way to measure the prevalence of cycles in a graph. Broersma and Veldman showed in (Contemporary methods in graph theory, BI-Wiss.-Verlag, Mannheim, Wien, Zürich, pp 181–194, 1990) that any 2-connected claw-free \(P_5\)-free graph must be hamiltonian. In fact, every non-hamiltonian cycle in such a graph is either extendable or very dense. We show that any 2-connected claw-free \(P_5\)-free graph is (k, 3k)-pancyclic for each integer \(k \ge 2\). We also show that such a graph is (1, 5)-pancyclic. Examples are provided which show that these results are best possible. Each example we provide represents an infinite family of graphs.     

A Comment on Ryser’s Conjecture for Intersecting Hypergraphs

Let \(\tau({\mathcal{H}})\) be the cover number and \(\nu({\mathcal{H}})\) be the matching number of a hypergraph \({\mathcal{H}}\). Ryser conjectured that every r-partite hypergraph \({\mathcal{H}}\) satisfies the inequality \(\tau({\mathcal{H}}) \leq (r-1) \nu ({\mathcal{H}})\). This conjecture is open for all r ≥ 4. For intersecting hypergraphs, namely those with \(\nu({\mathcal{H}}) = 1\), Ryser’s conjecture reduces to \(\tau({\mathcal{H}}) \leq r-1\). Even this conjecture is extremely difficult and is open for all r ≥ 6. For infinitely many r there are examples of intersecting r-partite hypergraphs with \(\tau({\mathcal{H}}) = r-1\), demonstrating the tightness of the conjecture for such r. However, all previously known constructions are not optimal as they use far too many edges. How sparse can an intersecting r-partite hypergraph be, given that its cover number is as large as possible, namely \(\tau({\mathcal{H}}) \ge r-1\)? In this paper we solve this question for r ≤ 5, give an almost optimal construction for r = 6, prove that any r-partite intersecting hypergraph with τ(H) ≥ r ? 1 must have at least \((3-\frac{1}{\sqrt{18}})r(1-o(1)) \approx 2.764r(1-o(1))\) edges, and conjecture that there exist constructions with Θ(r) edges.     

Exponentially Many Monochromatic <Emphasis Type="Italic">n</Emphasis>-Matchings in <Emphasis Type="Italic">K</Emphasis><Subscript>3<Emphasis Type="Italic">n</Emphasis>-1</Subscript>

Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K _3n-1, there is a n-matching containing edges with the same color(we call such matching monochromatic matching). In this paper we show that for any 2-edge-coloring of K _3n-1 there exists a monochromatic subgraph H of K _3n-1 which contains exponentially many monochromatic n-matchings.