Results 261 to 270 of about 5,610 (306)

Extremal Problems of Information Combining [PDF]

open access: yesIEEE Transactions on Information Theory, 2005
In this paper we study moments of soft-bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the extremal information combining problem. Further, we extend the information combining problem by adding a constraint on the second moment of soft-bits, and find the extreme distributions
Yibo Jiang   +3 more
openaire   +3 more sources

Extremal problems under dimension constraints [PDF]

open access: yesDiscrete Mathematics, 2003
Ahlswede R, Aydinian H, Khachatrian LH. Extremal problems under dimension constraints. In: Discrete Mathematics. Discrete Mathematics. Vol 273.
H Aydinian, R Ahlswede
exaly   +2 more sources

Solution of an Extremal Problem

Theory of Probability & Its Applications, 1957
Let N be a set of pairs of integers $\langle {i,j} \rangle ,i, j = 1,2, \cdots ,h$, and M a non-empty subset of N. We shall denote by $\mathcal{P}_M$ the class of all systems $P = \{ p_{ij} \} ,\langle {i,j} \rangle \in N$ satisfying the following conditions: \[ p_{ij} \geqq 0\quad {\text{for}}\quad \langle {i,j} \rangle \in N, \,p_{ij} = 0\quad {\text{
Rubinshteĭn, G. Sh., Urbanik, Kazimierz
openaire   +2 more sources

Problems and results in extremal combinatorics—I [PDF]

open access: yesDiscrete Mathematics, 2003
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Science, Geometry and Game Theory.
Dedicated To Miki Simonovits, Noga Alon
exaly   +1 more source

ON A CLASS OF EXTREMAL PROBLEMS

Mathematics of the USSR-Izvestiya, 1988
Translation from Izv. Akad. Nauk SSSR, Ser. Mat. 51, No.2, 436-443 (Russian) (1987; Zbl 0626.47020).
openaire   +3 more sources

Extremal Problems for Imbalanced Edges

Graphs and Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter Rautenbach, Ingo Schiermeyer
openaire   +1 more source

Extremal problems for convex polygons

Journal of Global Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles Audet   +2 more
openaire   +3 more sources

An Extremal Problem for Polynomials

Bulletin of the London Mathematical Society, 1985
In the paper the following result is proved: Theorem. Let p(z) be a monic polynomial of degree N all of whose roots lie on the unit circle, and E be any subset of \([-\pi,\pi]\) of measure \(2\alpha ...
openaire   +2 more sources

Extremal Boundary Problems

Proceedings of the London Mathematical Society, 1988
Suppose S is the usual class of functions \(f(z)=z+a_ 2z\) \(2+..\). analytic and univalent in the unit disk U. Various properties of the support points and the extreme points of S are known, and it has been conjectured that every extreme point is a support point.
openaire   +1 more source

Home - About - Disclaimer - Privacy