排序方式: 共有9条查询结果,搜索用时 15 毫秒
1
1.
Apurba Das 《Journal of Pure and Applied Algebra》2021,225(6):106599
We study formal deformations of multiplication in an operad. This closely resembles Gerstenhaber's deformation theory for associative algebras. However, this applies to various algebras of Loday-type and their twisted analogs. We explicitly describe the cohomology of these algebras with coefficients in a representation. Finally, deformation of morphisms between algebras of the same Loday-type is also considered. 相似文献
2.
Gilles Halbout 《Advances in Mathematics》2006,207(2):617-633
Let (g,δ?) be a Lie bialgebra. Let (U?(g),Δ?) a quantization of (g,δ?) through Etingof-Kazhdan functor. We prove the existence of a L∞-morphism between the Lie algebra C(g)=Λ(g) and the tensor algebra (without unit) T+U=T+(U?(g)[−1]) with Lie algebra structure given by the Gerstenhaber bracket. When s is a twist for (g,δ), we deduce from the formality morphism the existence of a quantum twist F. When (g,δ,r) is a coboundary Lie bialgebra, we get the existence of a quantization R of r. 相似文献
3.
F. Blanchet-SadriRobert Merca? William SeveraSean Simmons Dimin Xu 《Journal of Combinatorial Theory, Series A》2012,119(1):257-270
Erd?s raised the question whether there exist infinite abelian square-free words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words, or sequences that may contain some holes. In particular, we give lower and upper bounds for the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. Several of our constructions are based on iterating morphisms. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five. We also investigate the number of partial words of length n with a fixed number of holes over a five-letter alphabet that avoid abelian squares and show that this number grows exponentially with n. 相似文献
4.
G. Richomme 《Discrete Applied Mathematics》2007,155(15):2001-2016
A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. When k?3, we provide such an algorithm for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite test-sets for k-power-freeness. 相似文献
5.
Thomas Cluzeau 《Linear algebra and its applications》2008,428(1):324-381
Within a constructive homological algebra approach, we study the factorization and decomposition problems for a class of linear functional (determined, over-determined, under-determined) systems. Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we first concentrate on the computation of morphisms from a finitely presented left module M over an Ore algebra to another one M′, where M (resp., M′) is a module intrinsically associated with the linear functional system Ry = 0 (resp., R′z = 0). These morphisms define applications sending solutions of the system R′z = 0 to solutions of R y = 0. We explicitly characterize the kernel, image, cokernel and coimage of a general morphism. We then show that the existence of a non-injective endomorphism of the module M is equivalent to the existence of a non-trivial factorization R = R2R1 of the system matrix R. The corresponding system can then be integrated “in cascade”. Under certain conditions, we also show that the system Ry = 0 is equivalent to a system R′z = 0, where R′ is a block-triangular matrix of the same size as R. We show that the existence of idempotents of the endomorphism ring of the module M allows us to reduce the integration of the system Ry = 0 to the integration of two independent systems R1y1 = 0 and R2y2 = 0. Furthermore, we prove that, under certain conditions, idempotents provide decompositions of the system Ry = 0, i.e., they allow us to compute an equivalent system R′z = 0, where R′ is a block-diagonal matrix of the same size as R. Applications of these results in mathematical physics and control theory are given. Finally, the different algorithms of the paper are implemented in the Maple package Morphisms based on the library oremodules. 相似文献
6.
This paper studies the ambiguity of morphisms in free monoids. A morphism σ is said to be ambiguous with respect to a string α if there exists a morphism τ which differs from σ for a symbol occurring in α, but nevertheless satisfies τ(α)=σ(α); if there is no such τ then σ is called unambiguous. Motivated by the recent initial paper on the ambiguity of morphisms, we introduce the definition of a so-called segmented morphism σn, which, for any , maps every symbol in an infinite alphabet onto a word that consists of n distinct factors in , where and are different letters. For every n, we consider the set U(σn) of those finite strings over an infinite alphabet with respect to which σn is unambiguous, and we comprehensively describe its relation to any U(σm), m≠n.Thus, our work features the first approach to a characterisation of sets of strings with respect to which certain fixed morphisms are unambiguous, and it leads to fairly counter-intuitive insights into the relations between such sets. Furthermore, it shows that, among the widely used homogeneous morphisms, most segmented morphisms are optimal in terms of being unambiguous for a preferably large set of strings. Finally, our paper yields several major improvements of crucial techniques previously used for research on the ambiguity of morphisms. 相似文献
7.
Lucio Guerra 《Annali di Matematica Pura ed Applicata》2006,185(3):319-335
We describe the moduli spaces of morphisms between polarized complex abelian varieties. The discrete invariants, derived from
a Poincaré decomposition of morphisms, are the types of polarizations and of lattice homomorphisms occurring in the decomposition.
For a given type of morphisms the moduli variety is irreducible, and is obtained from a product of Siegel spaces modulo the
action of a discrete group.
Mathematics Subject Classification (2000) 14K20 相似文献
8.
1