Stable rank of leavitt path algebra

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

Turkey's accession to the EU: interests, ideas and path dependence

The paper is divided into four sections. The first offers a critical assessment of explanations of both rationalist and constructivist approaches currently dominating European studies and assesses the notion of path dependence. The second and third sections analyse the role of both material interests and polity ideas in EU enlargement to Turkey, and conclude that explanations exclusively based on either strategic calculations or values and identities have significant shortcomings. The fourth section examines the institutional path of Turkey's candidacy to show how the course of action begun at Helsinki restricted the range of possible and legitimate options three years later in Copenhagen.

Chain conditions for Leavitt path algebras

In this paper, results known about the artinian and noetherian conditions for the Leavitt path algebras of graphs with finitely many vertices are extended to all row-finite graphs. In our first main result, necessary and sufficient conditions on a row-finite graph E are given so that the corresponding (not necessarily unital) Leavitt path K-algebra L(E) is semisimple. These are precisely the algebras L(E)for which every corner is left (equivalently, right)artinian. They are also precisely the algebras L(E) for which every finitely generated left (equivalently, right) L(E)-module is artinian. In our second main result, we give necessary and sufficient conditions for every corner of L(E) to be left (equivalently, right) noetherian. They also turn out to be precisely those algebras L(E) for which every finitely generated left(equivalently, right) L(E)-module is noetherian. In both situations, isomorphisms between these algebras and appropriate direct sums of matrix rings over K or K[x, x−1] are provided. Likewise, in both situations, equivalent graph theoretic conditions on E are presented.

The Difficult and tortuous path of agricultural cooperative networks in spain, 1890-1935

The rural associationism developed from the last decades of the XIX century could be consider as an answer of the agriculturists to the increasing integration of agriculture in the market, and to the effects of the Great Depression. In the case of Spain, the initiatives in this sense arose with certain delay in relation to the countries of Western Europe. The beginning of the Spanish cooperativism is closely bound to the Law of 1906. It granted the agrarian cooperatives with fiscal exemptions and other types of supports to the associates, although the process did not really accelerate until the promulgation of the law regulation in 1908.

Tensor products of Leavitt path algebras

Vegeu el resum a l'inici del document del fitxer adjunt.

Partial disjoint path for multi-layer protection in GMPLS networks

In this paper, different recovery methods applied at different network layers and time scales are used in order to enhance the network reliability. Each layer deploys its own fault management methods. However, current recovery methods are applied to only a specific layer. New protection schemes, based on the proposed partial disjoint path algorithm, are defined in order to avoid protection duplications in a multi-layer scenario. The new protection schemes also encompass shared segment backup computation and shared risk link group identification. A complete set of experiments proves the efficiency of the proposed methods in relation with previous ones, in terms of resources used to protect the network, the failure recovery time and the request rejection ratio

Optimization of floor cleaning coverage performance of a random path-planning mobile robot

Floor cleaning is a typical robot application. There are several mobile robots aviable in the market for domestic applications most of them with random path-planning algorithms. In this paper we study the cleaning coverage performances of a random path-planning mobile robot and propose an optimized control algorithm, some methods to estimate the are of the room, the evolution of the cleaning and the time needed for complete coverage.

X-chromosome tiling path array detection of copy number variants in patients with chromosome X-linked mental retardation

Background: Aproximately 5–10% of cases of mental retardation in males are due to copy number variations (CNV) on the X chromosome. Novel technologies, such as array comparative genomic hybridization (aCGH), may help to uncover cryptic rearrangements in X-linked mental retardation (XLMR) patients. We have constructed an X-chromosome tiling path array using bacterial artificial chromosomes (BACs) and validated it using samples with cytogenetically defined copy number changes. We have studied 54 patients with idiopathic mental retardation and 20 controls subjects. Results: Known genomic aberrations were reliably detected on the array and eight novel submicroscopic imbalances, likely causative for the mental retardation (MR) phenotype, were detected. Putatively pathogenic rearrangements included three deletions and five duplications (ranging between 82 kb to one Mb), all but two affecting genes previously known to be responsible for XLMR. Additionally, we describe different CNV regions with significant different frequencies in XLMR and control subjects (44% vs. 20%). Conclusion:This tiling path array of the human X chromosome has proven successful for the detection and characterization of known rearrangements and novel CNVs in XLMR patients.

BRST-invariant path integral for a spinning relativistic particle

The propagator of a relativistic spinning particle is calculated using the Becchi-Rouet-Stora-Tyutin-(BRST)-invariant path-integral formalism of Fradkin and Vilkovisky. The spinless case is considered as an introduction to the formalism.

Equivalence of reduced, Polyakov, Faddeev-Popov, and Faddeev path-integral quantization of gauge theories

A geometrical treatment of the path integral for gauge theories with first-class constraints linear in the momenta is performed. The equivalence of reduced, Polyakov, Faddeev-Popov, and Faddeev path-integral quantization of gauge theories is established. In the process of carrying this out we find a modified version of the original Faddeev-Popov formula which is derived under much more general conditions than the usual one. Throughout this paper we emphasize the fact that we only make use of the information contained in the action for the system, and of the natural geometrical structures derived from it.

Hamiltonian formalism for path-dependent Lagrangians

A presymplectic structure for path-dependent Lagrangian systems is set up such that, when applied to ordinary Lagrangians, it yields the familiar Legendre transformation. It is then applied to derive a Hamiltonian formalism and the conserved quantities for those predictive invariant systems whose solutions also satisfy a Fokker-type action principle.

Canonical formalism for path dependent Lagrangians. Coupling constant expansions

A canonical formalism obtained for path-dependent Lagrangians is applied to Fokker-type Lagrangians. The results are specialized for coupling constant expansions and later on are applied to relativistic systems of particles interacting through symmetric scalar and vector mesodynamics and electrodynamics.

The path: sustainable development in conjunction with meeting the demands of a changing environment.

In the context of severe economic recession, the Library is compelled to adapt to this changing environment, in order to meet the requirements and demands of users with very specific needs. Taking the pillars of sustainable development as a reference point, and extrapolating them to our domain, we establish the next main goals

Identifying the Role of Final Consumption in Structural Path Analysis: An Application to Water Uses

The complexity of the connexions within an economic system can only be reliably reflected in academic research if powerful methods are used. Researchers have used Structural Path Analysis (SPA) to capture not only the linkages within the production system but also the propagation of the effects into different channels of impacts. However, the SPA literature has restricted itself to showing the relations among sectors of production, while the connections between these sectors and final consumption have attracted little attention. In order to consider the complete set of channels involved, in this paper we propose a structural path method that endogenously incorporates not only sectors of production but also the final consumption of the economy. The empirical application comprises water usages, and analyses the dissemination of exogenous impacts into various channels of water consumption. The results show that the responsibility for water stress is imputed to different sectors and depends on the hypothesis used for the role played by final consumption in the model. This highlights the importance of consumers’ decisions in the determination of ecological impacts. Keywords: Input-Output Analysis, Structural Path Analysis, Final Consumption, Water uses.