Bridged extremal distance and maximal capacity
نویسندگان
چکیده
منابع مشابه
New Maximal Two-Distance Sets
A two-distance set in E is a point set X in the d-dimensional Euclidean space such that the distances between distinct points in X assume only two different nonzero values. Based on results from classical distance geometry, we develop an algorithm to classify, for a given d, all maximal (largest possible) two-distance sets in E. Using this algorithm we have completed the full classification for...
متن کاملeffect of maximal versus supra-maximal exhausting race on lipid peroxidation, antioxidant activity and muscle-damage biomarkers in long-distance and middle-distance runners
conclusions maximal and supra-maximal races induce a significant increase in lipid peroxidation and cause non-negligible inflammation and muscle damage. these effects were relatively related to the physical exercise type and the sportive specialty. results a significant increase in malondialdehyde (mda) concentrations was observed in ss and mdr after the vameval test and in ldr after the limite...
متن کاملOn Extremal Maximal Self-orthogonal Codes of Type I-iv
For a Type T ∈ {I, II, III, IV} and length N where there exists no self-dual Type T code of length N , upper bounds on the minimum weight of the dual code of a self-orthogonal Type T code of length N are given, allowing the notion of dual extremal codes. It is proven that the Hamming weight enumerator of a dual extremal maximal self-orthogonal code of a given length is unique.
متن کاملExtremal Distance Maintenance for Parametric Curves and Surfaces
A new extremal distance tracking algorithm is presented for parametric curves and surfaces undergoing rigid body motion. The essentially geometric extremization problem is transformed into a dynamical control problem by differentiating with respect to time. Extremization is then solved with the design of a stabilizing controller. We use a feedback linearizing controller. The controller simultan...
متن کاملOn Minimum Maximal Distance-k Matchings
We study the computational complexity of several problems connected with the problems of finding a maximal distance-k matching of minimum cardinality or minimum weight. We introduce the class of k-equimatchable graphs which is an edge analogue of k-equipackable graphs. We prove that the recognition of k-equimatchable graphs is co-NP-complete for any fixed k ≥ 2. We provide a simple characteriza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1996
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1996.176.507