Applying relation algebra and RelView to measures in a social network

We present an application of relation algebra to measure agents’ ‘strength’ in a social network with influence between agents. In particular, we deal with power, success, and influence of an agent as measured by the generalized Hoede–Bakker index and its modifications, and by the influence indices. We also apply relation algebra to determine followers of a coalition and the kernel of an influence function. This leads to specifications, which can be executed with the help of the BDD-based tool RelView after a simple translation into the tool’s programming language. As an example we consider the present Dutch Parliament.     

Multiple positive fixed points for the sum of expansive mappings and k‐set contractions

In this work, we are concerned with the existence of multiple positive fixed points for the sum of an expansive mapping with constant h > 1 and a k‐set contraction when 0 ≤ k < h ? 1. In particular, the case of the sum of an expansive mapping with constant h > 1 and an e‐concave operator and an e‐convex operator is considered. Two examples of application illustrate some of the theoretical results.     

Construction of Matrices with Prescribed Singular Values and Eigenvalues

Two issues concerning the construction of square matrices with prescribe singular values an eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values an m ( n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating the case when m = n. Second, an algorithm is given to generate a triangular matrix with prescribe singular values an eigenvalues. Unlike earlier algorithms, the eigenvalues can be arranged in any prescribe order on the diagonal. A slight modification of this algorithm allows one to construct a real matrix with specified real an complex conjugate eigenvalues an specified singular values. The construction is done by multiplication by diagonal unitary matrices, permutation matrices and rotation matrices. It is numerically stable and may be useful in developing test software for numerical linear algebra packages.     

Ambient connections realising conformal Tractor holonomy

For a conformal manifold we introduce the notion of an ambient connection, an affine connection on an ambient manifold of the conformal manifold, possibly with torsion, and with conditions relating it to the conformal structure. The purpose of this construction is to realise the normal conformal Tractor holonomy as affine holonomy of such a connection. We give an example of an ambient connection for which this is the case, and which is torsion free if we start the construction with a C-space, and in addition Ricci-flat if we start with an Einstein manifold. Thus, for a C-space this example leads to an ambient metric in the weaker sense of Čap and Gover, and for an Einstein space to a Ricci-flat ambient metric in the sense of Fefferman and Graham. Current address for first author: Erwin Schr?dinger International Institute for Mathematical Physics (ESI), Boltzmanngasse 9, 1090 Vienna, Austria Current address for second author: Department of Mathematics, University of Hamburg, Bundesstra?e 55, 20146 Hamburg, Germany     

Refinable Functions with Exponential Decay: An?Approach via Cascade Algorithms

Refinable functions with exponential decay arise from applications such as the Butterworth filters in signal processing. Refinable functions with exponential decay also play an important role in the study of Riesz bases of wavelets generated from multiresolution analysis. A fundamental problem is whether the standard solution of a refinement equation with an exponentially decaying mask has exponential decay. We investigate this fundamental problem by considering cascade algorithms in weighted L _p spaces (1≤p≤∞). We give some sufficient conditions for the cascade algorithm associated with an exponentially decaying mask to converge in weighted L _p spaces. Consequently, we prove that the refinable functions associated with the Butterworth filters are continuous functions with exponential decay. By analyzing spectral properties of the transition operator associated with an exponentially decaying mask, we find a characterization for the corresponding refinable function to lie in weighted L ₂ spaces. The general theory is applied to an interesting example of bivariate refinable functions with exponential decay, which can be viewed as an extension of the Butterworth filters.     

Semi-algebraic Absolute Valued Algebras with an Involution

Abstract

Let A be an absolute valued algebra. In El-Mallah (El-Mallah,M. L. (1988). Absolute valued algebras with an involution. Arch. Math. 51: 39–49) we proved that,if A is algebraic with an involution,then A is finite dimensional. This result had been generalized in El-Amin et al. (El-Amin,K.,Ramirez,M. I.,Rodriguez,A. (1997). Absolute valued algebraic algebras are finite dimensional. J. Algebra 195:295–307),by showing that the condition “algebraic” is sufficient for A to be finite dimensional. In the present paper we give a generalization of the concept “algebraic”,which will be called “semi-algebraic”,and prove that if A is semi-algebraic with an involution then A is finite dimensional. We give an example of an absolute valued algebra which is semi-algebraic and infinite dimensional. This example shows that the assumption “with an involution” cannot be removed in our result.     

Asymptotic analysis for a downside risk minimization problem under partial information

We give an analytic characterization of a large-time “downside risk” probability associated with an investor’s wealth. We assume that risky securities in our market model are affected by “hidden” economic factors, which evolve as a finite-state Markov chain. We formalize and prove a duality relation between downside risk minimization and the related risk-sensitive optimization. The proof is based on an analysis of an ergodic-type Hamilton–Jacobi–Bellman equation with large (exponentially growing) drift.     

Deterministic symmetric rendezvous with tokens in a synchronous torus

In the rendezvous problem, the goal for two mobile agents is to meet whenever this is possible. In the rendezvous with detection problem, an additional goal for the agents is to detect the impossibility of a rendezvous (e.g., due to symmetrical initial positions of the agents) and stop. We consider the rendezvous problem with and without detection for identical anonymous mobile agents (i.e., running the same deterministic algorithm) with tokens in an anonymous synchronous torus with a sense of direction, and show that there is a striking computational difference between one and more tokens. Specifically, we show that (1) two agents with a constant number of unmovable tokens, or with one movable token each, cannot rendezvous in an n×n torus if they have o(logn) memory, while they can solve the rendezvous with detection problem in an n×m torus as long as they have one unmovable token and O(logn+logm) memory; in contrast, (2) when two agents have two movable tokens each then the rendezvous problem (respectively, rendezvous with detection problem) is solvable with constant memory in an arbitrary n×m (respectively, n×n) torus; and finally, (3) two agents with three movable tokens each and constant memory can solve the rendezvous with detection problem in an n×m torus. This is the first publication in the literature that studies tradeoffs between the number of tokens, memory and knowledge the agents need in order to meet in a torus.     

On estimates for integral solutions of linear inequalities

Recently, Bombieri and Vaaler obtained an interesting adelic formulation of the first and the second theorems of Minkowski in the Geometry of Numbers and derived an effective formulation of the well-known “Siegel’s lemma” on the size of integral solutions of linear equations. In a similar context involving linearinequalities, this paper is concerned with an analogue of a theorem of Khintchine on integral solutions for inequalities arising from systems of linear forms and also with an analogue of a Kronecker-type theorem with regard to euclidean frames of integral vectors. The proof of the former theorem invokes Bombieri-Vaaler’s adelic formulation of Minkowski’s theorem.     

Invariant measures for frequently hypercyclic operators

We investigate frequently hypercyclic and chaotic linear operators from a measure-theoretic point of view. Among other things, we show that any frequently hypercyclic operator T acting on a reflexive Banach space admits an invariant probability measure with full support, which may be required to vanish on the set of all periodic vectors for T  ; that there exist frequently hypercyclic operators on the sequence space _c0$c_0$ admitting no ergodic measure with full support; and that if an operator admits an ergodic measure with full support, then it has a comeager set of distributionally irregular vectors. We also give some necessary and sufficient conditions (which are satisfied by all the known chaotic operators) for an operator T to admit an invariant measure supported on the set of its hypercyclic vectors and belonging to the closed convex hull of its periodic measures. Finally, we give a Baire category proof of the fact that any operator with a perfectly spanning set of unimodular eigenvectors admits an ergodic measure with full support.     

Donaldson's theorem,Heegaard Floer homology,and knots with unknotting number one

We establish an obstruction to unknotting an alternating knot by a single crossing change. The obstruction is lattice-theoretic in nature, and combines Donaldson's diagonalization theorem with an obstruction developed by Ozsváth and Szabó using Heegaard Floer homology. As an application, we enumerate the alternating 3-braid knots with unknotting number one, and show that each has an unknotting crossing in its standard alternating diagram.     

pth Power Lagrangian Method for Integer Programming

When does there exist an optimal generating Lagrangian multiplier vector (that generates an optimal solution of an integer programming problem in a Lagrangian relaxation formulation), and in cases of nonexistence, can we produce the existence in some other equivalent representation space? Under what conditions does there exist an optimal primal-dual pair in integer programming? This paper considers both questions. A theoretical characterization of the perturbation function in integer programming yields a new insight on the existence of an optimal generating Lagrangian multiplier vector, the existence of an optimal primal-dual pair, and the duality gap. The proposed pth power Lagrangian method convexifies the perturbation function and guarantees the existence of an optimal generating Lagrangian multiplier vector. A condition for the existence of an optimal primal-dual pair is given for the Lagrangian relaxation method to be successful in identifying an optimal solution of the primal problem via the maximization of the Lagrangian dual. The existence of an optimal primal-dual pair is assured for cases with a single Lagrangian constraint, while adopting the pth power Lagrangian method. This paper then shows that an integer programming problem with multiple constraints can be always converted into an equivalent form with a single surrogate constraint. Therefore, success of a dual search is guaranteed for a general class of finite integer programming problems with a prominent feature of a one-dimensional dual search.     

Obstacle Numbers of Graphs

An obstacle representation of a graph G is a drawing of G in the plane with straight-line edges, together with a set of polygons (respectively, convex polygons) called obstacles, such that an edge exists in G if and only if it does not intersect an obstacle. The obstacle number (convex obstacle number) of G is the smallest number of obstacles (convex obstacles) in any obstacle representation of G. In this paper, we identify families of graphs with obstacle number 1 and construct graphs with arbitrarily large obstacle number (convex obstacle number). We prove that a graph has an obstacle representation with a single convex k-gon if and only if it is a circular arc graph with clique covering number at most k in which no two arcs cover the host circle. We also prove independently that a graph has an obstacle representation with a single segment obstacle if and only if it is the complement of an interval bigraph.     

Ordered interval routing schemes

An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address, and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is called a k-IRS. In this paper, we propose a new type of interval routing scheme, called an Ordered Interval Routing Scheme (OIRS), that uses an ordering of the outgoing edges at each vertex and allows non-disjoint intervals in the labels of those edges. We show for a number of graph classes that using an OIRS instead of an IRS reduces the size of the routing tables in the case of optimal routing, i.e., routing along shortest paths. We show that optimal routing in any k-tree is possible using an OIRS with at most 2^k−1 intervals per edge label, although the best known result for an IRS is 2^k+1 intervals per edge label. Any torus has an optimal 1-OIRS, although it may not have an optimal 1-IRS. We present similar results for the Petersen graph, k-garland graphs and a few other graphs.     

A new class of almost complex structures

The purpose of this paper is to introduce a new class of almost complex structures J on a Riemannian manifold M by using a certain identity for the relationship between the tensor F _i ^j of J and the Riemann curvature tensor R _hijk of M. This class contains the Kählerian structures, and its relationship with some known classes of almost Hermitian structures defined by similar identities is discussed. For convenience we call each structure of this new class an almost C-structure, and a manifold with an almost C-structure an almost C-manifold. We obtain an analogue of F. Schur's theorem concerning the holomorphic sectional curvature of an almost Hermitian C-manifold, and some sufficient conditions for an almost Hermitian C-manifold to be Kählerian. We show that these results are also true for a manifold with a complex structure.     

An index theorem for Toeplitz operators on odd-dimensional manifolds with boundary

We establish an index theorem for Toeplitz operators on odd-dimensional spin manifolds with boundary. It may be thought of as an odd-dimensional analogue of the Atiyah-Patodi-Singer index theorem for Dirac operators on manifolds with boundary. In particular, there occurs naturally an invariant of η type associated to K¹ representatives on even-dimensional manifolds, which should be of independent interests. For example, it gives an intrinsic interpretation of the so called Wess-Zumino term in the WZW theory in physics.     

Frequent hypercyclicity,chaos, and unconditional Schauder decompositions

We prove that if X is any complex separable infinite-dimensional Banach space with an unconditional Schauder decomposition, X supports an operator T which is chaotic and frequently hypercyclic. In contrast with the complex case, we observe that there are real Banach spaces with an unconditional basis which support no chaotic operator.     

Embedding of eigenfunctions of the Johnson graph into eigenfunctions of the Hamming graph

Under study is the relationship between the eigenfunctions of the Johnson and Hamming graphs. An eigenfunction of a graph is an eigenvector of its adjacency matrix with some eigenvalue; moreover, an eigenfunction can be identically zero. We find a criterion for the embeddability of an eigenfunction of the Johnson graph J(n, w) with a given eigenvalue into a certain eigenfunction of the Hamming graph with a given eigenvalue.     

Balanced arrays of strength two and nested (r, λ)-designs

An (r,λ)-design with mutually balanced nested subdesigns (for brevity, (r,λ)-design with MBN) is introduced firstly in this article. It is shown that an r,λ-design with MBN is equivalent to a balanced array of strength 2 with s symbols. By the use of a nested design and an orthogonal array, a construction of an r,λ-design with MBN is given. A direct construction of such an (r,λ)-design, based on the result obtained by Wilson [15], is also given. By these constructions, new balanced arrays with s ≥ 3 are presented. © 1994 John Wiley & Sons, Inc.     

Distributions on almost contact manifolds

It is known that any hypersurface in an almost complex space admits an almost contact manifold [11, 14]. In this article we show that a hyperplane in an almost contact manifold has an almost complex structure. Along with this result, we explain how to determine when an almost contact structure induces a contact structure, followed by examples of a manifold with a closed G₂-structure.