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     

Typical Frobenius coverings

A covering p from a Cayley graph Cay（G, X） onto another Cay（H, Y） is called typical Frobenius if G is a Frobenius group with H as a Frobenius complement and the map p ： G →H is a group epimorphism. In this paper, we emphasize on the typical Frobenius coverings of Cay（H, Y）. We show that any typical Frobenius covering Cay（G, X） of Cay（H, Y） can be derived from an epimorphism /from G to H which is determined by an automorphism f of H. If Cay（G, X1） and Cay（G, X2） are two isomorphic typical Frobenius coverings under a graph isomorphism Ф, some properties satisfied by Фare given.     

Applications of Bernstein-Durrmeyer operators in estimating the covering number

The paper deals with estimates of the covering number for some Mercer kernel Hilbert space with Bernstein-Durrmeyer operators. We first give estimates of l2-norm of Mercer kernel matrices reproducing by the kernels K(α,β)(x,y):=∞∑k=0 C(α,β)k Qk(α,β)(x)Qk(α,β)(y),where Qα,βk(x) are the Jacobi polynomials of order k on (0, 1), Cα,βk > 0 are real numbers,and from which give the lower and upper bounds of the covering number for some particular reproducing kernel Hilbert space reproduced by K(α,β)(x,y).     

推出-拉回图上的覆盖性同态

In a pushout-pullback diagram,which consists of four morphisms f : A → B,g : A → C,α : C → D and β : B → D,we give some relations among the covers of these four modules.If kerf ∈ I(L ),then g : A → C is L -covering if and only if β : B → D is L -covering.If every module has an L -precover and kerf ∈ I(L ),then A and C have isomorphic L -precovers if and only if B and D have isomorphic L -precovers.     

The nonidealness index of rank-ideal matrices

A polyhedron is integral if all its extreme points have 0, 1 components and in this case the matrix M is called ideal. When Q has fractional extreme points, there are different ways of classifying how far M is away from being ideal, through the polyhedral structure of Q. In this sense, Argiroffo, Bianchi and Nasini (2006) [1] defined a nonidealness index analogous to an imperfection index due to Gerke and McDiarmid (2001) [10].In this work we determine the nonidealness index of rank-ideal matrices (introduced by the authors (2008)). It is known that evaluating this index is NP-hard for any matrix. We provide a tractable way of evaluating it for most circulant matrices, whose blockers are a particular class of rank-ideal matrices, thereby following similar lines as done for the imperfection ratio of webs due to Coulonges, Pêcher and Wagler (2009) [7].Finally, exploiting the properties of this nonidealness index, we identify the facets of the set covering polyhedron of circulant matrices, having maximum strength with respect to the linear relaxation, according to a measure defined by Goemans (1995) [9].     

On the sum minimization version of the online bin covering problem

Given a set of m identical bins of size 1, the online input consists of a (potentially infinite) stream of items in (0,1]. Each item is to be assigned to a bin upon arrival. The goal is to cover all bins, that is, to reach a situation where a total size of items of at least 1 is assigned to each bin. The cost of an algorithm is the sum of all used items at the moment when the goal is first fulfilled. We consider three variants of the problem, the online problem, where there is no restriction of the input items, and the two semi-online models, where the items arrive sorted by size, that is, either by non-decreasing size or by non-increasing size. The offline problem is considered as well.     

On the relations of graph parameters and its total parameters

In this paper we get some relations between α（G）, α＇（G）, β（G）, β＇（G） and αT（G）, βT（G）. And all bounds in these relations are best possible, where α（G）, α＇（G）,/3（G）, β（G）, αT（G） and βT（G） are the covering number, edge-covering number, independent number, edge-independent number （or matching number）, total covering number and total independent number, respectively.     

用随机小区间覆盖圆周(英文)

本文考虑随机区间In=ωn+(-en/2,en/2)(mod 1).利用文献[7]中所介绍的无处不在系统,证明了圆周上由被无穷次覆盖的点构成的集合的Hausdorff维数几乎必然等于min{1,lim sup n→∞ log n/-log en},推广了文献[4]中的结果.     

ERM learning algorithm for multi-class classification

The multi-class classification problem is considered by an empirical risk minimization (ERM) approach. The hypothesis space for the learning algorithm is taken to be a ball of a Banach space of continuous functions. When the regression function lies in some interpolation space, satisfactory learning rates for the excess misclassification error are provided in terms of covering numbers of the unit ball of the Banach space. A comparison theorem is proved and is used to bound the excess misclassification error by means of the excess generalization error.     

Quadratic Lie Algebras

In this article, the notion of universal enveloping algebra introduced in Ardizzoni [4 Ardizzoni , A. On primitively generated braided bialgebras . Algebr. Represent. Theory , to appear. (doi:10.1007/s10468-010-9257-z)  [Google Scholar]] is specialized to the case of braided vector spaces whose Nichols algebra is quadratic as an algebra. In this setting, a classification of universal enveloping algebras for braided vector spaces of dimension not greater than 2 is handled. As an application, we investigate the structure of primitively generated connected braided bialgebras whose braided vector space of primitive elements forms a Nichols algebra, which is a quadratic algebra.