12,283 research outputs found

    Extensions and block decompositions for finite-dimensional representations of equivariant map algebras

    Full text link
    Suppose a finite group acts on a scheme XX and a finite-dimensional Lie algebra g\mathfrak{g}. The associated equivariant map algebra is the Lie algebra of equivariant regular maps from XX to g\mathfrak{g}. The irreducible finite-dimensional representations of these algebras were classified in previous work with P. Senesi, where it was shown that they are all tensor products of evaluation representations and one-dimensional representations. In the current paper, we describe the extensions between irreducible finite-dimensional representations of an equivariant map algebra in the case that XX is an affine scheme of finite type and g\mathfrak{g} is reductive. This allows us to also describe explicitly the blocks of the category of finite-dimensional representations in terms of spectral characters, whose definition we extend to this general setting. Applying our results to the case of generalized current algebras (the case where the group acting is trivial), we recover known results but with very different proofs. For (twisted) loop algebras, we recover known results on block decompositions (again with very different proofs) and new explicit formulas for extensions. Finally, specializing our results to the case of (twisted) multiloop algebras and generalized Onsager algebras yields previously unknown results on both extensions and block decompositions.Comment: 41 pages; v2: minor corrections, formatting changed to match published versio

    Extraction Techniques for Polycyclic Aromatic Hydrocarbons in Soils

    Get PDF
    This paper aims to provide a review of the analytical extraction techniques for polycyclic aromatic hydrocarbons (PAHs) in soils. The extraction technologies described here include Soxhlet extraction, ultrasonic and mechanical agitation, accelerated solvent extraction, supercritical and subcritical fluid extraction, microwave-assisted extraction, solid phase extraction and microextraction, thermal desorption and flash pyrolysis, as well as fluidised-bed extraction. The influencing factors in the extraction of PAHs from soil such as temperature, type of solvent, soil moisture, and other soil characteristics are also discussed. The paper concludes with a review of the models used to describe the kinetics of PAH desorption from soils during solvent extraction

    Phase separation of the Potts model in que square lattice

    Full text link
    When the two dimensional q-color Potts model in the square lattice is quenched at zero temperature with Glauber dynamics, the energy decreases in time following an Allen-Cahn power law, and the system converges to a phase with energy higher than the ground state energy after an arbitrary large time when q>4. At low but finite temperature, it cesses to obey the power-law regime and orders after a very long time, which increases with q, and before which it performs a domain growth process which tends to be slower as q increases. We briefly present and comment numerical results on the ordering at nonzero temperature.Comment: 3 pages, 1 figure, proceedings of the "International Workshop on Complex sytems", June 2006 in Santander (Spain

    An Event-Triggered Programmable Prefetcher for Irregular Workloads

    Get PDF
    Many modern workloads compute on large amounts of data, often with irregular memory accesses. Current architectures perform poorly for these workloads, as existing prefetching techniques cannot capture the memory access patterns; these applications end up heavily memory-bound as a result. Although a number of techniques exist to explicitly configure a prefetcher with traversal patterns, gaining significant speedups, they do not generalise beyond their target data structures. Instead, we propose an event-triggered programmable prefetcher combining the flexibility of a general-purpose computational unit with an event-based programming model, along with compiler techniques to automatically generate events from the original source code with annotations. This allows more complex fetching decisions to be made, without needing to stall when intermediate results are required. Using our programmable prefetching system, combined with small prefetch kernels extracted from applications, we achieve an average 3.0x speedup in simulation for a variety of graph, database and HPC workloads.</jats:p

    Equivariant map superalgebras

    Full text link
    Suppose a group Γ\Gamma acts on a scheme XX and a Lie superalgebra g\mathfrak{g}. The corresponding equivariant map superalgebra is the Lie superalgebra of equivariant regular maps from XX to g\mathfrak{g}. We classify the irreducible finite dimensional modules for these superalgebras under the assumptions that the coordinate ring of XX is finitely generated, Γ\Gamma is finite abelian and acts freely on the rational points of XX, and g\mathfrak{g} is a basic classical Lie superalgebra (or sl(n,n)\mathfrak{sl}(n,n), n>0n > 0, if Γ\Gamma is trivial). We show that they are all (tensor products of) generalized evaluation modules and are parameterized by a certain set of equivariant finitely supported maps defined on XX. Furthermore, in the case that the even part of g\mathfrak{g} is semisimple, we show that all such modules are in fact (tensor products of) evaluation modules. On the other hand, if the even part of g\mathfrak{g} is not semisimple (more generally, if g\mathfrak{g} is of type I), we introduce a natural generalization of Kac modules and show that all irreducible finite dimensional modules are quotients of these. As a special case, our results give the first classification of the irreducible finite dimensional modules for twisted loop superalgebras.Comment: 27 pages. v2: Section numbering changed to match published version. Other minor corrections. v3: Minor corrections (see change log at end of introduction

    Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis

    Full text link
    Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(\cdot) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation RR such that SAT(RR) can be solved at least as fast as any other NP-hard SAT(\cdot) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (MaxOnes(Γ\Gamma)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages (VCSP(Δ\Delta)). With the help of these languages we relate MaxOnes and VCSP to the exponential time hypothesis in several different ways.Comment: This is an extended version of Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis, appearing in Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science MFCS 2014 Budapest, August 25-29, 201

    Reação de genótipos de trigo ao mosaico comum - análise de dados 2010.

    Get PDF
    bitstream/item/62576/1/2011comunicadotecnicoonline292.pd

    Reação de genótipos de trigo ao BYDV - PAV, agente causal do nanismo amarelo: análise de dados 2010.

    Get PDF
    bitstream/item/62588/1/2011comunicadotecnicoonline297.pd
    corecore