REALIZING PROFINITE REDUCED SPECIAL GROUPS

Special groups are an axiomatization of the algebraic theory of quadratic forms over fields. It is known that any finite reduced special group is the special group of some field. We show that any special group that is the projective limit of a projective system of finite reduced special groups is also the special group of some field.

ON NONSYMMETRIC THEOREMS FOR (H, G)-COINCIDENCES

Let X be a compact Hausdorff space, phi: X -> S(n) a continuous map into the n-sphere S(n) that induces a nonzero homomorphism phi*: H(n)(S(n); Z(p)) -> H(n)(X; Z(p)), Y a k-dimensional CW-complex and f: X -> a continuous map. Let G a finite group which acts freely on S`. Suppose that H subset of G is a normal cyclic subgroup of a prime order. In this paper, we define and we estimate the cohomological dimension of the set A(phi)(f, H, G) of (H, G)-coincidence points of f relative to phi.

Coincidence theorems and its applications to equilibrium problems

Given two maps h : X x K -> R and g : X -> K such that, for all x is an element of X, h(x, g(x)) = 0, we consider the equilibrium problem of finding (x) over tilde is an element of X such that h((x) over tilde, g(x)) >= 0 for every x is an element of X. This question is related to a coincidence problem.

LaSalle`s theorems in impulsive semidynamical systems

We consider a semidynamical system subject to variable impulses and we obtain the LaSalle invariance principle and the asymptotic stability theorem for this semidynamical system. (C) 2009 Elsevier Ltd. All rights reserved.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

Identifying the borders of mathematical knowledge

Based on a divide and conquer approach, knowledge about nature has been organized into a set of interrelated facts, allowing a natural representation in terms of graphs: each `chunk` of knowledge corresponds to a node, while relationships between such chunks are expressed as edges. This organization becomes particularly clear in the case of mathematical theorems, with their intense cross-implications and relationships. We have derived a web of mathematical theorems from Wikipedia and, thanks to the powerful concept of entropy, identified its more central and frontier elements. Our results also suggest that the central nodes are the oldest theorems, while the frontier nodes are those recently added to the network. The network communities have also been identified, allowing further insights about the organization of this network, such as its highly modular structure.

Limit theorems for sequences of random trees

We consider a random tree and introduce a metric in the space of trees to define the ""mean tree"" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose tests to check if two samples of random trees have the same law.

Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.

Rigidity theorems for complete spacelike hypersurfaces with constant scalar curvature in De Sitter space

In this paper we give a partially affirmative answer to the following question posed by Haizhong Li: is a complete spacelike hypersurface in De Sitter space S(1)(n+1)(c), n >= 3, with constant normalized scalar curvature R satisfying n-2/nc <= R <= c totally umbilical? (C) 2008 Elsevier B.V. All rights reserved.

A family of Schroeder-Bernstein type theorems for Banach spaces

Motivated by a characterization of the complemented subspaces in Banach spaces X isomorphic to their squares X-2, we introduce the concept of P-complemented subspaces in Banach spaces. In this way, the well-known Pelczynski`s decomposition method can be seen as a Schroeder-Bernstein type theorem. Then, we give a complete description of the Schroeder-Bernstein type theorems for this new notion of complementability. By contrast, some very elementary questions on P-complementability are refinements of the Square-Cube Problem closely connected with some Banach spaces introduced by W.T. Gowers and B. Maurey in 1997. (C) 2007 Elsevier Inc. All rights reserved.

Some Schroeder-Bernstein type theorems for Banach spaces

We first introduce the notion of (p, q, r)-complemented subspaces in Banach spaces, where p, q, r is an element of N. Then, given a couple of triples {(p, q, r), (s, t, u)} in N and putting Lambda = (q + r - p)(t + u - s) - ru, we prove partially the following conjecture: For every pair of Banach spaces X and Y such that X is (p, q, r)-complemented in Y and Y is (s, t, u)-complemented in X, we have that X is isomorphic Y if and only if one of the following conditions holds: (a) Lambda not equal 0, Lambda divides p - q and s - t, p = 1 or q = 1 or s = 1 or t = 1. (b) p = q = s = t = 1 and gcd(r, u) = 1. The case {(2, 1, 1), (2, 1,1)} is the well-known Pelczynski`s decomposition method. Our result leads naturally to some generalizations of the Schroeder-B em stein problem for Banach spaces solved by W.T. Gowers in 1996. (C) 2007 Elsevier Inc. All rights reserved.

Representation type of Jordan algebras

The problem of classification of Jordan bit-nodules over (non-semisimple) finite dimensional Jordan algebras with respect to their representation type is considered. The notions of diagram of a Jordan algebra and of Jordan tensor algebra of a bimodule are introduced and a mapping Qui is constructed which associates to the diagram of a Jordan algebra J the quiver of its universal associative enveloping algebra S(J). The main results are concerned with Jordan algebras of semi-matrix type, that is, algebras whose semi-simple component is a direct sum of Jordan matrix algebras. In this case, criterion of finiteness and tameness for one-sided representations are obtained, in terms of diagram and mapping Qui, for Jordan tensor algebras and for algebras with radical square equals to 0. (c) 2010 Elsevier Inc. All rights reserved.