A generalization of the AZ identity

The identity discovered in [1] can be viewed as a sharpening of the LYM inequality ([3], [4], [5]). It was extended in [2] so that it covers also Bollobás' inequality [6]. Here we present a further generalization and demonstrate that it shares with its predecessors the usefullness for uniqueness proofs in extremal set theory.     

On Local LYM Identities

The LYMinequality (Lubell, Yamamoto, Meshalkin) is a generalization of Sperner’s theorem for antichains. Kleitman and Harper independently proved that the LYM inequality and the normalized matching property (or local LYM inequality) are equivalent. Many contributions have been proposed to sharpen the LYM inequality. Noticeably, Ahlswede and Zhang lifted the LYM inequality to an identity, called the AZ identity. Thus, one expects that the same sharpening of the local LYM inequality is equivalent to the AZ identity. In this paper, we introduce a local LYM identity which sharpens the local LYM inequality and prove that it is equivalent to the AZ identity. The local LYM identity shows local relationships between components in the AZ identity.     

Partial duality and Bollobás and Riordan’s ribbon graph polynomial

Recently S. Chmutov introduced a generalization of the dual of a ribbon graph (or equivalently an embedded graph) and proved a relation between Bollobás and Riordan’s ribbon graph polynomial of a ribbon graph and of its generalized duals. Here I show that the duality relation satisfied by the ribbon graph polynomial can be understood in terms of knot theory and I give a simple proof of the relation which used the homfly polynomial of a knot.     

AZ-Identities and Strict 2-Part Sperner Properties of Product Posets

One of central issues in extremal set theory is Sperner’s theorem and its generalizations. Among such generalizations is the best-known LYM (also known as BLYM) inequality and the Ahlswede–Zhang (AZ) identity which surprisingly generalizes the BLYM into an identity. Sperner’s theorem and the BLYM inequality has been also generalized to a wide class of posets. Another direction in this research was the study of more part Sperner systems. In this paper we derive AZ type identities for regular posets. We also characterize all maximum 2-part Sperner systems for a wide class of product posets.     

Partitioning 3-uniform hypergraphs

Bollobás and Thomason conjectured that the vertices of any r-uniform hypergraph with m edges can be partitioned into r sets so that each set meets at least rm/(2r−1) edges. For r=3, Bollobás, Reed and Thomason proved the lower bound (1−1/e)m/3≈0.21m, which was improved to (5/9)m by Bollobás and Scott and to 0.6m by Haslegrave. In this paper, we show that any 3-uniform hypergraph with m edges can be partitioned into 3 sets, each of which meets at least 0.65m−o(m) edges.     

Generalization of Popoviciu-Type Inequalities Via Fink’s Identity

We obtained useful identities via Fink’s identity, by which the inequality of Popoviciu for convex functions is generalized for higher order convex functions. We investigate the bounds for the identities related to the generalization of the Popoviciu inequality using inequalities for the ?eby?ev functional. Some results relating to the Grüss- and Ostrowski-type inequalities are constructed. Further, we also construct new families of exponentially convex functions and Cauchy-type means by looking at linear functional associated with the obtained inequalities.     

The chromatic polynomial of fatgraphs and its categorification

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane graphs, we show that our chromatic homology can be recovered from the Khovanov homology of an associated link. We apply this connection with Khovanov homology to show that the torsion-free part of our chromatic homology is independent of the choice of planar embedding of a graph. We extend our construction and categorify the Bollobás-Riordan polynomial (a generalization of the Tutte polynomial to embedded graphs). We prove that both our chromatic homology and the Khovanov homology of an associated link can be recovered from this categorification.     

The multivariate signed Bollobás-Riordan polynomial

We generalise the signed Bollobás-Riordan polynomial of S. Chmutov and I. Pak [S. Chmutov, I. Pak, The Kauffman bracket of virtual links and the Bollobás-Riordan polynomial, Mos. Math. J. 7(3) (2007), 409-418] to a multivariate signed polynomial Z and study its properties. We prove the invariance of Z under the recently defined partial duality of S. Chmutov [S. Chmutov, Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial, J. Combin. Theory, Ser. B 99(3) (2009), 617-638. arXiv:0711.3490, doi:10.1016/j.jctb.2008.09.007] and show that the duality transformation of the multivariate Tutte polynomial is a direct consequence of it.     

Fractional set systems with few disjoint pairs

Ahlswede (1980) [1] and Frankl (1977) [5] independently found a result about the structure of set systems with few disjoint pairs. Bollobás and Leader (2003) [3] gave an alternate proof by generalizing to fractional set systems and noting that the optimal fractional set systems are {0,1}-valued. In this paper we show that this technique does not extend to t-intersecting families. We find optimal fractional set systems for some infinite classes of parameters, and we point out that they are strictly better than the corresponding {0,1}-valued fractional set systems. We prove some results about the structure of an optimal fractional set system, which we use to produce an algorithm for finding such systems. The run time of the algorithm is polynomial in the size of the ground set.     

Stability of the LCD model

The growing network model with loops and multiple edges proposed by Bollobás et al. (Random Structures and Algorithms 18(2001)) is restudied from another perspective. Based on the first-passage probability of Markov chains, we prove that the degree distribution of the LCD model is power-law with degree exponent 3 as the network size grows to infinity.     

Bishop–Phelps–Bollobás property for certain spaces of operators

We characterize the Banach spaces Y   for which certain subspaces of operators from _L1(μ)$L_1(\mu )$ into Y have the Bishop–Phelps–Bollobás property in terms of a geometric property of Y, namely AHSP. This characterization applies to the spaces of compact and weakly compact operators. New examples of Banach spaces Y with AHSP are provided. We also obtain that certain ideals of Asplund operators satisfy the Bishop–Phelps–Bollobás property.     

A generalization of Bessel"s inequality and Parseval"s identity

We present an inequality and an identity involving Gram determinants, which can be viewed as a generalization of Bessel"s and Parseval"s, respectively. This revised version was published online in June 2006 with corrections to the Cover Date.     

Fejér不等式加强形式的推广

通过建立积分恒等式,将一个关于4阶可微函数的Fejér不等式的加强形式推广到关于2n-1(n≥2)阶可微函数的Fejér型不等式.对此新推广的不等式还给出了若干误差估计.     

On a Norm Inequality with Respect to Vilenkin-Like Systems

We consider a new system introduced by G. Gát (see e.g. [3]). This is a common generalization of several well-known systems. We prove a norm inequality with respect to this system.     

Maximizers for Gagliardo–Nirenberg inequalities and related non-local problems

In this paper we study the existence of maximizers for two families of interpolation inequalities, namely a generalized Gagliardo–Nirenberg inequality and a new inequality involving the Riesz energy. Two basic tools in our argument are a generalization of Lieb’s Translation Lemma and a Riesz energy version of the Brézis–Lieb lemma.     

Sums and k-sums in abelian groups of order k

Let G be an abelian group of order k. How is the problem of minimizing the number of sums from a sequence of given length in G related to the problem of minimizing the number of k-sums? In this paper we show that the minimum number of k-sums for a sequence a₁,…,ar that does not have 0 as a k-sum is attained at the sequence b₁,…,br−k+1,0,…,0, where b₁,…,br−k+1 is chosen to minimise the number of sums without 0 being a sum. Equivalently, to minimise the number of k-sums one should repeat some value k−1 times. This proves a conjecture of Bollobás and Leader, and extends results of Gao and of Bollobás and Leader.     

On the Bohr inequality of operators

This paper is focused on the operator inequalities of the Bohr type. We will give a new and transparent proof for the operator Bohr inequality through an absolute value operator identity, show some related operator inequalities by means of 2×2 (block) operator matrices, and finally we will present a generalization of the operator Bohr inequality for multiple operators.     

A characterization of mean values for Csiszár’s inequality and applications

We characterize all mean values for Csiszár’s inequality in information theory as well as all mean values for the triangle inequality. Several examples are given as well. Also, as an application, we improve the Cauchy–Schwarz operator inequality.     

Packing two graphs of ordern having total size at most 2n − 2

Two graphsG andH of the same order are packable ifG can be embedded in the complement ofH. In this paper we give a complete characterization of two graphs of ordern having total size at most 2n – 2 which are packable. This result extends an earlier result of B. Bollobás and S.E. Eldridge.