Pluriassociative algebras II: The polydendriform operad and related operads

Dendriform algebras form a category of algebras recently introduced by Loday. A dendriform algebra is a vector space endowed with two nonassociative binary operations satisfying some relations. Any dendriform algebra is an algebra over the dendriform operad, the Koszul dual of the diassociative operad. We introduce here, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter γ of dendriform algebras, called γ-polydendriform algebras, so that 1-polydendriform algebras are dendriform algebras. For that, we consider the operads obtained as the Koszul duals of the γ-pluriassociative operads introduced by the author in a previous work. In the same manner as dendriform algebras are suitable devices to split associative operations into two parts, γ-polydendriform algebras seem adapted structures to split associative operations into 2γ operation so that some partial sums of these operations are associative. We provide a complete study of the γ-polydendriform operads, the underlying operads of the category of γ-polydendriform algebras. We exhibit several presentations by generators and relations, compute their Hilbert series, and construct free objects in the corresponding categories. We also provide consistent generalizations on a nonnegative integer parameter of the duplicial, triassociative and tridendriform operads, and of some operads of the operadic butterfly.     

Operads and varieties of algebras defined by polylinear identities

We show that varieties of algebras over abstract clones and over the corresponding operads are rationally equivalent. We introduce the class of operads (which we call commutative for definiteness) such that the varieties of algebras over these operads resemble in a sense categories of modules over commutative rings. In particular, the notions of a polylinear mapping and the tensor product of algebras. The categories of modules over commutative rings and the category of convexors are examples of varieties over commutative operads. By analogy with the theory of linear multioperator algebras, we develop a theory of C-linear multioperator algebras; in particular, of algebras, defined by C-polylinear identities (here C is a commutative operad). We introduce and study symmetric C-linear operads. The main result of this article is as follows: A variety of C-linear multioperator algebras is defined by C-polylinear identities if and only if it is rationally equivalent to a variety of algebras over a symmetric C-linear operad.     

Abstract Clones and Operads

We establish a connection between abstract clones and operads, which implies that both clones and operads are particular instances of a more general notion. The latter is called W-operad (due to a close resemblance with operads) and can be regarded as a functor on a certain subcategory W, of the category of finite ordinals, with some rather natural properties. When W is a category whose morphisms are the various bijections, the variety of W-operads is rationally equivalent to the variety of operads in the traditional sense. Our main result claims that if W coincides with the category of all finite ordinals then the variety of W-operads is rationally equivalent to the variety of abstract clones.     

Pluriassociative algebras I: The pluriassociative operad

Diassociative algebras form a category of algebras recently introduced by Loday. A diassociative algebra is a vector space endowed with two associative binary operations satisfying some very natural relations. Any diassociative algebra is an algebra over the diassociative operad, and, among its most notable properties, this operad is the Koszul dual of the dendriform operad. We introduce here, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter γ of diassociative algebras, called γ-pluriassociative algebras, so that 1-pluriassociative algebras are diassociative algebras. Pluriassociative algebras are vector spaces endowed with 2γ associative binary operations satisfying some relations. We provide a complete study of the γ-pluriassociative operads, the underlying operads of the category of γ-pluriassociative algebras. We exhibit a realization of these operads, establish several presentations by generators and relations, compute their Hilbert series, show that they are Koszul, and construct the free objects in the corresponding categories. We also study several notions of units in γ-pluriassociative algebras and propose a general way to construct such algebras. This paper ends with the introduction of an analogous generalization of the triassociative operad of Loday and Ronco.     

Modular operads

We develop a higher genus analogue of operads, which we call modular operads, in which graphs replace trees in the definition. We study a functor F on the category of modular operads, the Feynman transform, which generalizes Kontsevichs graph complexes and also the bar construction for operads. We calculate the Euler characteristic of the Feynman transform, using the theory of symmetric functions: our formula is modelled on Wicks theorem. We give applications to the theory of moduli spaces of pointed algebraic curves.     

Colored operads,series on colored operads,and combinatorial generating systems

We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way. The theory of bud generating systems uses colored operads. Indeed, an object is generated by a bud generating system if it satisfies a certain equation in a colored operad. To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these. Series on colored operads are crucial to express the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics. Some examples of bud generating systems are constructed; in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.     

On Recognition by Spectrum of Finite Simple Linear Groups over Fields of Characteristic 2

A finite group G is said to be recognizable by spectrum, i.e., by the set of element orders, if every finite group H having the same spectrum as G is isomorphic to G. We prove that the simple linear groups L _n (2^k) are recognizable by spectrum for n = 2^m ≥ 32.Original Russian Text Copyright © 2005 Vasil’ev A. V. and Grechkoseeva M. A.The authors were supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program “ Development of the Scientific Potential of Higher School” of the Ministry for Education of the Russian Federation (Grant 8294), the Program “Universities of Russia” (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 749–758, July–August, 2005.     

Models for operads

We study properties of differential graded (dg) operads modulo weak equivalences, that is, modulo the relation given by the existence of a chain of dg operad maps including a homology isomorphism. This approach, naturally arising in string theory, leads us to consider various versions of models. Some applications in topology (homotopy-everything spaces), algebra (cotangent cohomology) and mathematical physics (closed string-field theory) - are also given     

The Degree Spectra of Definable Relations on Boolean Algebras

We study some questions concerning the structure of the spectra of the sets of atoms and atomless elements in a computable Boolean algebra. We prove that if the spectrum of the set of atoms contains a 1-low degree then it contains a computable degree. We show also that in a computable Boolean algebra of characteristic (1, 1, 0) whose set of atoms is computable the spectrum of the atomless ideal consists of all Π ₀ ² degrees.Original Russian Text Copyright © 2005 Semukhin P. M.The author was supported by the Russian Foundation for Basic Research (Grant 02-01-00593), the Leading Scientific Schools of the Russian Federation (Grant NSh-2112.2003.1), and the Program “Universities of Russia” (Grant UR.04.01.013).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 928–941, July–August, 2005.     

A Koszul duality for props

The notion of prop models the operations with multiple inputs and multiple outputs, acting on some algebraic structures like the bialgebras or the Lie bialgebras. In this paper, we generalize the Koszul duality theory of associative algebras and operads to props.

     

Crossed Modules Over Operads and Operadic Cohomology

It is known that elements in the cohomology of groups and in the Hochschild cohomology of algebras are represented by crossed extensions. We introduce the notion of crossed modules and crossed extensions for algebras over operads and obtain in this way an operadic version of Hochschild cohomology. Applications are given for the operads Com, Ass and for E operads.     

Noncommuting Coordinates,Exotic Particles,and Anomalous Anyons in the Hall Effect

We review our previous “exotic” particle, together with the more recent anomalous anyon model (which has the arbitrary gyromagnetic factor g). The nonrelativistic limit of the anyon generalizes the exotic particle with g = 0 to any g. In a planar electromagnetic field, the Hall effect becomes mandatory for all g ≠ 2 when the field takes some critical value.__________Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 144, No. 1, pp. 26–34, July, 2005.     

Soluble Groups and Varieties of <Emphasis Type="Italic">l</Emphasis>-Groups

A sufficient condition is given under which factors of a system of normal convex subgroups of a linearly ordered (l.o.) group are Abelian. Also, a sufficient condition is specified subject to which factors of a system of normal convex subgroups of an l.o. group are contained in a group variety . In particular, for every soluble l.o. group G of solubility index n, n ⩾ 2, factors of a system of normal convex subgroups are soluble l.o. groups of solubility index at most n − 1. It is proved that the variety of all lattice-ordered groups, approximable by linearly ordered groups, does not coincide with a variety generated by all soluble l.o. groups. It is shown that if is any o-approximable variety of l-groups, and if every identity in the group signature is not identically true in , then contains free l.o. groups.Supported by FP “Universities of Russia” grant UR. 04. 01. 001.__________Translated from Algebra i Logika, Vol. 44, No. 3, pp. 355–367, May–June, 2005.     

The Kervaire-Laudenbach Conjecture and Presentations of Simple Groups

The statement “no non-Abelian simple group can be obtained from a non-simple one by adding one generator and one relator” first is equivalent to the Kervaire-Laudenbach conjecture, and second, becomes true under the additional assumption that an initial non-simple group is either finite or torsion free.Supported by RFBR grant No. 02-01-00170.__________Translated from Algebra i Logika, Vol. 44, No. 4, pp. 399–437, July–August, 2005.     

Polynomial identity rings as rings of functions

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where “varieties” carry a PGL_n-action, regular and rational “functions” on them are matrix-valued, “coordinate rings” are prime polynomial identity algebras, and “function fields” are central simple algebras of degree n. In particular, a prime polynomial identity algebra of degree n is finitely generated if and only if it arises as the “coordinate ring” of a “variety” in this setting. For n=1 our definitions and results reduce to those of classical affine algebraic geometry.     

<Emphasis Type="Italic">n</Emphasis>-Lie Structures That Are Generated by Wronskians

We study the (k + 1)-Lie structures, k-left commutative and homotopy (k + 1)-Lie structures with multiplication generated by Wronskians and prove that the nontrivial structures of n-Lie algebras appear only in the case of small characteristic.Original Russian Text Copyright © 2005 Dzhumadil’daev A. S.__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 759–773, July–August, 2005.     

k-Best Solutions under Distance Constraints in Valuated -Matroids

In discrete maximization problems one usually wants to find an optimal solution. However, in several topics like “alignments,” “automatic speech recognition,” and “computer chess” people are interested to find thekbest solutions for somek ≥ 2. We demand that theksolutions obey certain distance constraints to avoid that thekalternatives are too similar. Several results for valuated -matroids are presented, some of them concerning time complexity of algorithms.     

On the Self-Similar Jordan Arcs Admitting Structure Parametrization

We study the attractors γ of a finite system of contraction similarities S _j (j = 1,..., m) in ℝ^d which are Jordan arcs. We prove that if a system possesses a structure parametrization (ℐ,ϕ) and ℱ(ℐ) is the associated family of ℐ then we have one of the following cases:1. The identity mapping Id does not belong to the closure of ℱ(ℐ). Then (if properly rearranged) is a Jordan zipper.2. The identity mapping Id is a limit point of ℱ(ℐ). Then the arc γ is a straight line segment.3. The identity mapping Id is an isolated point of .We construct an example of a self-similar Jordan curve which implements the third case.Original Russian Text Copyright © 2005 Aseev V. V. and Tetenov A. V.The authors were supported by the Program “Universities of Russia” (Grant UR.04.01.456).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 733–748, July–August, 2005.     

Fuzzy Relation Equations for Compression/Decompression Processes of Colour Images in the RGB and YUV Colour Spaces

We use particular fuzzy relation equations for compression/decompression of colour images in the RGB and YUV spaces, by comparing the results of the reconstructed images obtained in both cases. Our tests are made over well known images of 256×256 pixels (8 bits per pixel in each band) extracted from Corel Gallery. After the decomposition of each image in the three bands of the RGB and YUV colour spaces, the compression is performed using fuzzy relation equations of “min - →_t” type, where “t” is the Lukasiewicz t-norm and “→_t” is its residuum. Any image is subdivided in blocks and each block is compressed by optimizing a parameter inserted in the Gaussian membership functions of the fuzzy sets, used as coders in the fuzzy equations. The decompression process is realized via a fuzzy relation equation of max-t type. In both RGB and YUV spaces we evaluate and compare the root means square error (RMSE) and the consequentpeak signal to noise ratio (PSNR) on the decompressed images with respect to the original image under several compression rates.