Nonadditive Set Functions on a Finite Set and Linear Inequalities

A set function is a function whose domain is the power set of a set, which is assumed to be finite in this paper. We treat a possibly nonadditive set function, i.e., a set function which does not satisfy necessarily additivity, ?(A) + ?(B) = ?(A ∪ B) forA ∩ B = ∅, as an element of the linear space on the power set. Then some of the famous classes of set functions are polyhedral in that linear space, i.e., expressed by a finite number of linear inequalities. We specify the sets of the coefficients of the linear inequalities for some classes of set functions. Then we consider the following three problems: (a) the domain extension problem for nonadditive set functions, (b) the sandwich problem for nonadditive set functions, and (c) the representation problem of a binary relation by a nonadditive set function, i.e., the problem of nonadditive comparative probabilities.     

Additive Functions with Asymptotically Finite Supports

A characterization of a set of strongly additive functions f _x with asymptotically finite support is obtained. Strongly additive functions which take the unit or zero values for each prime number p are considered.     

整函数及其差分分担有限集的唯一性

研究了整函数及其差分多项式分担有限复数集的唯一性,得到了如下结果:设S_m={1,ω,…,ω~(m-1)},其中ω=cos(2π/m)+i sin(2π/m),c为非零有限复数,n(>5),m(≥2)均为正整数.如果f(z),g(z)为有限级整函数,满足E(S_m,f(z)~n(f(z)-1)f(z+c))=E(S_m,g(z)~n(g(z)-1))g(z+c)),那么f(z)≡g(z).     

On the Functions on Linear Spaces

In this paper are considered the authors results that have been received in the last few years and are devoted to the research of functions mapping a finite linear space to itself. The characteristics of functions representing interest from the point of view of cryptography, geometrical properties of functions are resulted. This research is supported by RFFI (grants 99-01-00929 and 99-01-00941).Mathematics Subject Classifications (2000) 51E15, 51E20.     

On the Support of Distributions of Integer-Valued Additive Functions

We obtain a characterization of a set of additive functions with asymptotically finite support. Additive functions taking integer values on prime powers p ^r are considered.     

关于等差数列型素数集的分解

设C为非负整数集.若存在非负整数集A和B,使得C=A+B,其中|A|,|B|≥2,则称C为可分解的,否则称C为不可分解的或本原的.讨论特殊的等差数列型素数集合,证明了4k+1型素数集不可分解,以及4k+3型素数集不可分解.     

Functions on Linear Spaces Associated with Finite Projective Planes

Using spread sets that define finite translation planes, we construct functions that map a finite linear space into itself. Properties of such functions, which are of interest from the standpoint of cryptography, are examined. We look into the relationship between these functions and corresponding translation planes.     

Verification of Linear (In)Dependence in Finite Precision Arithmetic

We present theoretical background for verification of linear dependence/independence of columns of a matrix by means of finite precision arithmetic.     

A Basis Set of Functions for Curved Elements in the Finite Element Method

Two dimensional elements with a curved boundary are considered.A transformation is given that maps the unit square or the unittriangle into the corresponding curved element. The method maybe applied under the condition that the Jacobian determinantof the transformation does not vanish. The conditions of validity of the method are given when theboundary is represented by an algebraic curve of degree 2. Atest case is considered with its numerical results.     

On Large Deviations of Vector-Valued Additive Functions of a Markov Gaussian Field

We prove a local limit theorem for large deviations of the sums , where , is a Markov Gaussian random field, is a bounded vector-valued function, and . This paper generalizes the paper [13].     

On the Stability of the Feasible Set in Linear Optimization

This paper deals with the stability of two families of linear optimization problems, each one formed by the dual problems to the members of the other family. We characterize the problems of these families that are stable in the sense that they remain consistent (inconsistent) under sufficiently small arbitrary perturbations of all the data. This characterization is established in terms of the lower semicontinuity property of the feasible set mapping and the boundedness of the optimal set of the corresponding coupled problem. Other continuity properties of the feasible set mapping are also derived. This stability theory extends some well-known theorems of Williams and Robinson on the stability of ordinary linear programming problems to linear optimization problems with infinitely many variables or constraints.     

On Linear Dependence Over Complete Differential Algebraic Varieties

We extend Kolchin's results from [12 Kolchin, E. (1974). Differential equations in a projective space and linear dependence over a projective variety. Contributions to analysis (A collection of papers dedicated to Lipman Bers). Cambridge, MA: Academic Press, pp. 195–214.[Crossref] , [Google Scholar]] on linear dependence over the constant points of projective algebraic varieties to linear dependence over arbitrary complete differential algebraic varieties. We show that in this more general setting, the notion of linear dependence still has necessary and sufficient conditions given by the vanishing of a certain system of differential-polynomials equations. We also discuss some conjectural questions around completeness and the catenary problem.     

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.     

On Finite Linear Systems Containing Strict Inequalities

This paper deals with linear systems containing finitely many weak and/or strict inequalities, whose solution sets are referred to as evenly convex polyhedral sets. The classical Motzkin theorem states that every (closed and convex) polyhedron is the Minkowski sum of a convex hull of finitely many points and a finitely generated cone. In this sense, similar representations for evenly convex polyhedra have been recently given by using the standard version for classical polyhedra. In this work, we provide a new dual tool that completely characterizes finite linear systems containing strict inequalities and it constitutes the key for obtaining a generalization of Motzkin theorem for evenly convex polyhedra.     

Poisson Distribution for a Sum of Additive Functions

We consider the limit distribution of values of a sum of additive arithmetic functions with shifted argument. The case of the Poisson limit distribution is studied. The functions considered take at most two values on the set of primes, 0 and 1, and satisfy some additional conditions. Some examples are given.      

On Optimization over the Efficient Set in Linear Multicriteria Programming

The efficient set of a linear multicriteria programming problem can be represented by a reverse convex constraint of the form g(z)≤0, where g is a concave function. Consequently, the problem of optimizing some real function over the efficient set belongs to an important problem class of global optimization called reverse convex programming. Since the concave function used in the literature is only defined on some set containing the feasible set of the underlying multicriteria programming problem, most global optimization techniques for handling this kind of reverse convex constraint cannot be applied. The main purpose of our article is to present a method for overcoming this disadvantage. We construct a concave function which is finitely defined on the whole space and can be considered as an extension of the existing function. Different forms of the linear multicriteria programming problem are discussed, including the minimum maximal flow problem as an example. The research was partly done while the third author was visiting the Department of Mathematics, University of Trier with the support by the Alexander von Humboldt Foundation. He thanks the university as well as the foundation.     

On the Isaacs Problem Concerning Finite p-Solvable Linear Groups

In this work a finite $\Pi$ -separable complex irreducible linear group G is studied. The conditions for its $S_\Pi$ -subgroup to be normal in G and Abelian are determined. The results provide a solution to the well-known Isaacs problem in some particular cases.