Báo cáo toán học: "New Optimal Constant Weight Codes" pot
Báo cáo toán học: " Near optimal bound of orthogonal matching pursuit using restricted isometric constant" docx
... θ
|I
1
|,|I
2
|
x
2
.
6
Nea
r optimal bound of orthogonal matching pursuit using
restricted isometric constant
Jian Wang, Seokbeop Kwon and Byonghyo Shim
∗
School of Information and Communication, ... formatted
PDF and full text (HTML) versions will be made available soon.
Near optimal bound of orthogonal matching pursuit using restricted isometric
c...
Báo cáo toán học: " New proofs of Schur-concavity for a class of symmetric functions" potx
... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted
PDF and full text (HTML) versions will be made available soon.
New proofs of Schur-concavity for a class of symmetric ... 0,
and then h
(t) ≤ 0, so f (t) is concave on (0, 1).
NEW PROOFS OF SCHUR-CONCAVITY FOR A CLASS OF
SYMMETRIC FUNCTIONS
HUAN-NAN SHI
∗
, JIAN Z...
Báo cáo toán học: " Outage-optimal opportunistic scheduling with analog network coding in multiuser two-way relay networks" docx
... Upadhyay and Prakriya: Outage-optimal opportunistic
scheduling with analog network coding in multiuser two-way relay
networks. EURASIP Journal on Wireless Communications and Networking
2011 2011:194.
Submit ... Open Access
Outage-optimal opportunistic scheduling with
analog network coding in multiuser two-way
relay networks
Prabhat K Upadhyay
1*
and...
Báo cáo toán học: On coupling constant thresholds in two dimensions " ppt
... class="bi x0 y4 w1 h 8" alt =""
Báo cáo toán học: "New Characterizations and Generalizations of PP Rings" ppt
... general. For example, let R = Z/4Z, and note that R has exactly
New Characterizations and Generalizations of PP Rings 103
J -PP ring is right PS.
Proof. If aR is simple and (aR)
2
=0,thenaR = eR for ... New Characterizations and Generalizations of PP Rings 101
Since K and E(L)areP -injective, so is H by (6). Note that E(L)/L is P -
injective by (6). Thus (6) ⇒ (2)...
Báo cáo toán học: " New Lower Bounds for Some Multicolored Ramsey Numbers" pot
... triangles.
Harvesting Some Lower Bounds for Ramsey Numbers
It is amazing that the result of this section has not been observed for the 25 years
since [C] was published. Using this observation we will give 6 new lower ... 87-95.
[R] S. Radziszowski, Small Ramsey Numbers, Electronic Journal of Combinatorics,
Dynamic Survey DS1, 1994, 28pp.
[S] Song En Min, New Lower Bound...
Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf
... appear.
[2]G.D.Cohen,I.Honkala,S.LitsynandA.Lobstein:Covering Codes, Elsevier,
1997.
[3] M.G.Karpovsky,K.ChakrabartyandL.B.Levitin: Onanewclassofcodes
for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, ... vertex of degree
zero.
Since, by symmetry, one element in C
2
produces two vertices with degree zero or
New Bounds for Codes Identifying
Vertices...
Báo cáo toán học: "NEW UPPER BOUNDS ON THE ORDER OF CAGES1" pps
... were constructed in [9] by Făuredi, Seress, and the authors.
The fact that the orders of these constructions actually meet the upper bound in
(2) for q odd follows from [13]. The constructions ... that these upper bounds are roughly the squares of the previously indicated
lower bounds.
In this paper we establish general upper bounds on v(k, g) which are roughly...
Báo cáo toán học: "New symmetric designs from regular Hadamard matrices" pdf
... regular Hadamard matrix of order 4 and H is a regular
Hadamard matrix of order 9 · 4
d+1
. Therefore, one can obtain a family of regular
Hadamard matrices of order 9 · 4
d
, starting with a regular ... Yamada, Hadamard matrices, sequences, and block designs, in Contemporary
Design Theory, eds. J.H. Dinitz and D.R. Stinson, John Wiley & Sons, 1992, 431–560.
New symmetric...
Báo cáo toán học: " New Bounds for Union-free Families of Sets" potx
... bounds on the size of union-free families.
the electronic journal of combinatorics 5 (1998), # R39 11
4 Lower bound on f
We give a construction of a (strongly) union-free family of subsets of ... ≤
n
i=1
H(2p
i
− p
2
i
) ≤ nφ(p)
(since pn =
p
i
). Therefore
αn ≤
1
2
[β(p)+φ(p)+o(1)]n.
New Bounds for Union-free
Families of Sets
Don Coppersmith (email: copper...
Báo cáo toán học: "Asymptotically optimal tree-packings in regular graphs" pps
... t.
Proof. Partition the set of vertices V into t subsets V
1
,V
2
, ,V
t
by choosing for each
vertex randomly and independently an index i in {1, ,t} and placing it into V
i
.For
v ∈ V (G)and1≤ i ≤ t,letA
i,v
denote ... certain regularity and local density conditions on H,
one can find an almost perfect matching M in H, i.e., the number of vertices in no edge
of M is negligible. In fac...
Báo cáo toán học: "New lower bounds for Heilbronn numbers" pps
... determination of optimal values and lower
bounds for every H
n
. Besides the trivial cases H
3
and H
4
, Golberg showed constructions
providing lower bounds for n ≤ 15. A.W.M. Dress, Yang Lu, ... lower bound for for Heilbronn s triangle problem in d dimensions.
SIAM J. Discrete Math. 14 (2001), no. 2, 230–236.
[3] C. Bertram–Kretzberg, T. Hofmeister, and H. Lefmann, An algori...
Báo cáo toán học: "New Lower Bound Formulas for Multicolored Ramsey Numbers" pptx
... Classification: 05D10
Abstract
We give two lower bound formulas for multicolored Ramsey numbers. These formu-
las improve the bounds for several small multicolored Ramsey numbers.
1. INTRODUCTION
In ... INTRODUCTION
In this short article we give two new lower bound formulas for edgewise r-colored
Ramsey numbers, R(k
1
,k
2
, ,k
r
), r ≥ 3, defined below. Both formul...
Báo cáo toán học: "New Optimal Constant Weight Codes" pot
... of constant weight codes, updating
existing tables originally created by Brouwer et al. This paper improves upon these
results by filling in 9 missing constant weight codes, all of which are optimal ... A. Sloane, “Table of Constant Weight Binary Codes,”
http://www.research.att.com/~njas/codes/Andw/
[4] D. H. Smith, L. A. Hughes and S. Perkins, “A New Table of Constant Weight...
Báo cáo toán học: "Asymptotically Optimal Box Packing Theorems" potx
... large boxes that can be packed
by T . If we can resolve this, then we have what we call an “asymptotically optimal
box- packing theorem”. In the special case that all the prototiles are boxes ... determines sufficient conditions for a box
to be packable. Moreover, these conditions are also necessary, by Theorem 3.6, so it is
easy to give an asymptotically optimal box- packing theore...