On Vector Quasi-Variational Inequality Problems in H-Space

The purpose to this paper is to study the existence problem of solutions to the vector quasi-variational inequality for vector-valued functions in H-space.     

Reformulation of the support set selection problem in the logical analysis of data

The paper is concerned with the problem of binary classification of data records, given an already classified training set of records. Among the various approaches to the problem, the methodology of the logical analysis of data (LAD) is considered. Such approach is based on discrete mathematics, with special emphasis on Boolean functions. With respect to the standard LAD procedure, enhancements based on probability considerations are presented. In particular, the problem of the selection of the optimal support set is formulated as a weighted set covering problem. Testable statistical hypothesis are used. Accuracy of the modified LAD procedure is compared to that of the standard LAD procedure on datasets of the UCI repository. Encouraging results are obtained and discussed.     

Trace Equivalence in SU(2, 1)

In this paper it is shown that one can choose an arbitrarily large number of inconjugate elements of the group Z/2Z*Z/2Z*Z/2Z which have the property that, under all representations of the group in SU(2,1) as a discrete complex hyperbolic ideal triangle group, the elements are hyperbolic and correspond to closed geodesics of equal length on the associated complex hyperbolic surface. This is an analogue of the geometric fact that the multiplicity of the length spectrum of a Riemann surface is never bounded or the equivalent algebraic phenomenon that an arbitrarily large number of conjugacy classes in a free group can have the same trace under all representations in SL(2,R ).     

The Maximal Closed Classes of Unary Functions in p-Valued Logic

In many-valued logic the decision of functional completeness is a basic and important problem, and the thorough solution to this problem depends on determining all maximal closed sets in the set of many-valued logic functions. It includes three famous problems, i.e., to determine all maximal closed sets in the set of the total, of the partial and of the unary many-valued logic functions, respectively. The first two problems have been completely solved ([1], [2], [8]), and the solution to the third problem boils down to determining all maximal subgroups in the k-degree symmetric group S_k, which is an open problem in the finite group theory. In this paper, all maximal closed sets in the set of unary p-valued logic functions are determined, where p is a prime. Mathematics Subject Classification: 03B50, 20B35.     

The Choquet-Deny convolution equation μ=μ*σ for probability measures on Abelian semigroups

In this note, we characterize the regular probability measures satisfying the Choquet-Deny convolution equation =* on Abelian topological semigroups for a given probability measure .     

Networks and chain coverings in partial orders and their products

For an arbitrary poset P, subposets {P _i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.     

Zhang–Zhang Polynomials of Multiple Zigzag Chains Revisited: A Connection with the John–Sachs Theorem

Multiple zigzag chains Zm,n of length n and width m constitute an important class of regular graphene flakes of rectangular shape. The physical and chemical properties of these basic pericondensed benzenoids can be related to their various topological invariants, conveniently encoded as the coefficients of a combinatorial polynomial, usually referred to as the ZZ polynomial of multiple zigzag chains Zm,n. The current study reports a novel method for determination of these ZZ polynomials based on a hypothesized extension to John–Sachs theorem, used previously to enumerate Kekulé structures of various benzenoid hydrocarbons. We show that the ZZ polynomial of the Zm,n multiple zigzag chain can be conveniently expressed as a determinant of a Toeplitz (or almost Toeplitz) matrix of size m2×m2 consisting of simple hypergeometric polynomials. The presented analysis can be extended to generalized multiple zigzag chains Zkm,n, i.e., derivatives of Zm,n with a single attached polyacene chain of length k. All presented formulas are accompanied by formal proofs. The developed theoretical machinery is applied for predicting aromaticity distribution patterns in large and infinite multiple zigzag chains Zm,n and for computing the distribution of spin densities in biradical states of finite multiple zigzag chains Zm,n.     

General constructions of biquandles and their symmetries

Biquandles are algebraic objects with two binary operations whose axioms encode the generalized Reidemeister moves for virtual knots and links. These objects also provide set theoretic solutions of the well-known Yang-Baxter equation. The first half of this paper proposes some natural constructions of biquandles from groups and from their simpler counterparts, namely, quandles. We completely determine all words in the free group on two generators that give rise to (bi)quandle structures on all groups. We give some novel constructions of biquandles on unions and products of quandles, including what we refer as the holomorph biquandle of a quandle. These constructions give a wealth of solutions of the Yang-Baxter equation. We also show that for nice quandle coverings a biquandle structure on the base can be lifted to a biquandle structure on the covering. In the second half of the paper, we determine automorphism groups of these biquandles in terms of associated quandles showing elegant relationships between the symmetries of the underlying structures.     

Real analysis related to the Monge-Ampère equation

In this paper we consider a family of convex sets in , , , , satisfying certain axioms of affine invariance, and a Borel measure satisfying a doubling condition with respect to the family The axioms are modelled on the properties of the solutions of the real Monge-Ampère equation. The purpose of the paper is to show a variant of the Calderón-Zygmund decomposition in terms of the members of This is achieved by showing first a Besicovitch-type covering lemma for the family and then using the doubling property of the measure The decomposition is motivated by the study of the properties of the linearized Monge-Ampère equation. We show certain applications to maximal functions, and we prove a John and Nirenberg-type inequality for functions with bounded mean oscillation with respect to

     

Series representation for semistable laws and their domains of semistable attraction

If the centered and normalized partial sums of an i.i.d. sequence of random variables converge in distribution to a nondegenerate limit then we say that this sequence belongs to the domain of attraction of the necessarily stable limit. If we consider only the partial sums which terminate atk _n wherek _n+1 ck _n then the sequence belongs to the domain of semistable attraction of the necessarily semistable limit. In this paper, we consider the case where the limiting distribution is nonnormal. We obtain a series representation for the partial sums which converges almost surely. This representation is based on the order statistics, and utilizes the Poisson process. Almost sure convergence is a useful technical device, as we illustrate with a number of applications.This research was supported by a research scholarship from the Deutsche Forschungsgemeinschaft (DFG).