Spline Subdivision Schemes for Compact Sets. A Survey

Dedicated to the memory of our colleague Vasil Popov January 14, 1942 – May 31, 1990 * Partially supported by ISF-Center of Excellence, and by The Hermann Minkowski Center for Geometry at Tel Aviv University, Israel

Approximation of Univariate Set-Valued Functions - an Overview

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Motzkin Decomposable Sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. We have provided several characterizations of the larger class of closed convex sets, Motzkin decomposable, in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed. Another result establishes that a closed convex set is Motzkin decomposable if and only if the set of extreme points of its intersection with the linear subspace orthogonal to its lineality is bounded. We characterize the class of the extended functions whose epigraphs are Motzkin decomposable sets showing, in particular, that these functions attain their global minima when they are bounded from below. Calculus of Motzkin decomposable sets and functions is provided.

Decomposition of Banach Space into a Direct Sum of Separable and Reflexive Subspaces and Borel Maps

* This paper was supported in part by the Bulgarian Ministry of Education, Science and Technologies under contract MM-506/95.

Evolution of Sets Systems and Homotopy Groups of Spheres

Симеон Т. Стефанов, Велика И. Драгиева - В работата е изследвана еволюцията на системи от множества върху n-мерната евклидова сфера S^n. Установена е връзката на такива системи с хомотопичните групи на сферите. Получени са някои комбинаторни приложения за многостени.

On a Generalization of a Theorem due to Larcombe on the Sum of a 3F2 Series

MSC 2010: 33C20

The Boundary Descriptors of the n-dimensional Unit Cube Subset Partitioning

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

Essential Arity Gap of Boolean Functions

In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions with a given arity gap. The Full Conjunctive Normal Forms are also sum of conjunctions, in which all variables occur.

Some Examples of Rigid Representations

*Research partially supported by INTAS grant 97-1644.

On Representations of Algebraic Polynomials by Superpositions of Plane Waves

* The author was supported by NSF Grant No. DMS 9706883.

Isomorphism of Commutative Modular Group Algebras

∗ The work was supported by the National Fund “Scientific researches” and by the Ministry of Education and Science in Bulgaria under contract MM 70/91.

Matricial Model for the Study of Lower Bounds

Let V be an array. The range query problem concerns the design of data structures for implementing the following operations. The operation update(j,x) has the effect vj ← vj + x, and the query operation retrieve(i,j) returns the partial sum vi + ... + vj. These tasks are to be performed on-line. We define an algebraic model – based on the use of matrices – for the study of the problem. In this paper we establish as well a lower bound for the sum of the average complexity of both kinds of operations, and demonstrate that this lower bound is near optimal – in terms of asymptotic complexity.

Algorithm BIDIMS for Automated Systematization of Data Array. Case Study: Rediscovering Mendeleev’s Periodic Table of Chemical Elements

The method (algorithm BIDIMS) of multivariate objects display to bidimensional structure in which the sum of differences of objects properties and their nearest neighbors is minimal is being described. The basic regularities on the set of objects at this ordering become evident. Besides, such structures (tables) have high inductive opportunities: many latent properties of objects may be predicted on their coordinates in this table. Opportunities of a method are illustrated on an example of bidimentional ordering of chemical elements. The table received in result practically coincides with the periodic Mendeleev table.

Sylow P-Subgroups of Abelian Group Rings

2000 Mathematics Subject Classification: Primary 20C07, 20K10, 20K20, 20K21; Secondary 16U60, 16S34.

The gauge invariant currents of the Maxwellian field

We show that a conserved current for the Maxwellian field, which is invariant under the gauge group of that field, is the sum of two currents Ф+T, where Ф corresponds to a Poincare symmetry of the field, and T is a topological form that is conserved under every dynamics.