نتایج جستجو برای: l intersection number

تعداد نتایج: 1744190  

Journal: :SIAM J. Discrete Math. 1997
Nicolas Sendrier

The hull AK90],,AK92, p. 43] of a linear code is deened to be its intersection with its dual. We give here the number of distinct q-ary linear codes which have a hull of given dimension. We will prove that, asymptotically, the proportion of q-ary codes whose hull has dimension l is a positive constant that only depends on l and q, and consequently that the average dimension of the hull is asymp...

Journal: :Discrete Mathematics 2001
Zsolt Katona

Let H denote the set {f1, f2, ..., fn}, 2 the collection of all subsets of H and F ⊆ 2 be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1 ≤ k < l) is empty. This problem is reduced to a covering problem. If we have the conditions that any two subsets have a non-empty intersection and the intersection of any...

Journal: :Math. Program. 2011
Santanu S. Dey

In this note, we present a simple geometric argument to determine a lower bound on the split rank of intersection cuts. As a first step of this argument, a polyhedral subset of the lattice-free convex set that is used to generate the intersection cut is constructed. We call this subset the restricted lattice-free set. It is then shown that dlog2(l)e is a lower bound on the split rank of the int...

2017
Vincent Despré Francis Lazarus

The geometric intersection number of a curve on a surface is the minimal number of selfintersections of any homotopic curve, i.e., of any curve obtained by continuous deformation. Given a curve c represented by a closed walk of length at most ` on a combinatorial surface of complexity n we describe simple algorithms to (1) compute the geometric intersection number of c in O(n+ `2) time, (2) con...

Journal: :Discussiones Mathematicae Graph Theory 1998
In-Jen Lin Terry A. McKee Douglas B. West

The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes. The maximum of l(G) on n-vertex graphs is n − lg n− 1 2 lg lg n+O(1). The proper leafage l(G) is the minimum number of leaves when no subtree may contain another; we obtain upper and...

Journal: :Physical review letters 2000
Arkani-Hamed Dimopoulos Dvali Kaloper

We construct intersecting brane configurations in anit-de Sitter (AdS) space which localize gravity to the intersection region, generalizing the trapping of gravity to any number n of infinite extra dimensions. Since the 4D Planck scale M(Pl) is determined by the fundamental Planck scale M(*) and the AdS radius L via the familiar relation M(2)(Pl) approximately M(2+n)(*)L(n), we get two kinds o...

Let $L$ be a completely regular frame and $mathcal{R}L$ be the ring of real-valued continuous functions on $L$. We consider the set $$mathcal{R}_{infty}L = {varphi in mathcal{R} L : uparrow varphi( dfrac{-1}{n}, dfrac{1}{n}) mbox{ is a compact frame for any $n in mathbb{N}$}}.$$ Suppose that $C_{infty} (X)$ is the family of all functions $f in C(X)$ for which the set ${x in X: |f(x)|geq dfrac{1...

Journal: :iranian journal of fuzzy systems 2013
hui han jinming fang

in this paper, our purpose is twofold. firstly, the tensor andresiduum operations on $l-$nested systems are introduced under thecondition of complete residuated lattice. then we show that$l-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. thus the new representation theorem of$l-$subsets on complete re...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید