Page 1 Next

Displaying 1 – 20 of 50

Showing per page

n-ary transit functions in graphs

Manoj Changat, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi (2010)

Discussiones Mathematicae Graph Theory

n-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural n-ary generalization of geodesicaly convexity. Furthermore, we generalize the betweenness axioms to n-ary transit functions and discuss the connectivity conditions for underlying hypergraph. Also n-ary all paths transit function is considered.

New Upper Bounds for Some Spherical Codes

Boyvalenkov, Peter, Kazakov, Peter (1995)

Serdica Mathematical Journal

The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A(n, s). We use two methods for obtaining new upper bounds on A(n, s) for some values of n and s. We find new linear programming bounds by suitable polynomials of degrees which are higher than the degrees of the previously known good polynomials due to Levenshtein [11, 12]. Also we investigate the possibilities for attaining the Levenshtein bounds [11, 12]. In such cases...

No return to convexity

Jakub Onufry Wojtaszczyk (2010)

Studia Mathematica

We study the closures of classes of log-concave measures under taking weak limits, linear transformations and tensor products. We investigate which uniform measures on convex bodies can be obtained starting from some class 𝒦. In particular we prove that if one starts from one-dimensional log-concave measures, one obtains no non-trivial uniform mesures on convex bodies.

Currently displaying 1 – 20 of 50

Page 1 Next