Search results for "Category theory"

Locality of order-invariant first-order formulas

1998

A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.

Partial Finitely Generated Bi-Ideals

2016

Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. This paper gives a solution for some problems for partial reccurrent words. This paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. The paper states that it is always possible to find a basis for a given finitely generated bi-ideal. The main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. This led to the st…

Some closed 4-manifolds with exotic differentiable structure

1984

Interpolating sequences on uniform algebras

2009

Abstract We consider the problem of whether a given interpolating sequence for a uniform algebra yields linear interpolation. A positive answer is obtained when we deal with dual uniform algebras. Further we prove that if the Carleson generalized condition is sufficient for a sequence to be interpolating on the algebra of bounded analytic functions on the unit ball of c 0 , then it is sufficient for any dual uniform algebra.

Timed Sets, Functional Complexity, and Computability

2012

AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…

Elements with square roots in compact groups

2010

The probability that a randomly chosen element has a square root is studied in [1, 2, 8] in the finite case. Here we deal with the infinite case.

Finitary Representations and Images of Transitive Finitary Permutation Groups

1999

Abstract We characterize the point stabilizers and kernels of finitary permutation representations of infinite transitive groups of finitary permutations. Moreover, the number of such representations is determined.

The indirect force method

1990

Abstract It is known that the matrix force method shows some advantages over the displacement method for certain classes of problems, particularly in optimization and in the stress concentration analysis. Notwithstanding this, few efforts have been made to employ this method in engineering problems. In this paper, within the elastic analysis of frames and trusses, the indirect force method, utilizing beam-node type finite elements, is proposed. This method is based on the kinematical and mechanical study of nodes and of beams, the latter connected with the nodes by their first extremes according to a preliminary arrangement. In this formulation kinematical singularities are included, in the…

Symmetric BEM Formulations for Elastic-Damage Material Models

1997

BEM analysis for elastic-damage materials is addressed by “undamaged” fundamental solutions. In step-by-step analysis, the actual response is obtained by an iterative procedure in which the undamaged structure is subjected to the loads and to some fictitious strains (or relaxation stresses) simulating the damage effects. Through symmetric BEM, the solution to the typical iteration problem is shown to solve a boundary/domain stationarity principle, whereas the above iterative procedure can be incorporated in a predictor/corrector scheme aimed at the integration of the damage laws. Discretization by boundary and interior elements leads to a symmetric equation system.

Networks of Manufacturers and Retailers

2005

We study the endogenous formation of networks between manufacturers of differentiated goods and multi-product retailers who interact in a successive duopoly. Joint consent is needed to establish and/or maintain a costly link between a manufacturer and a retailer. We find that only three distribution networks are stable for particular values of the degree of product differentiation and link costs: (i) the non-exclusive distribution and non-exclusive dealing network in which both retailers distribute both products is stable for intermediate degree of product differentiation and small link costs; (ii) the exclusive distribution and exclusive dealing network in which each retailer distributes a…