Related papers: Transitive Hall sets
First, we review the notion of a Poisson structure on a noncommutative algebra due to Block-Getzler and Xu and introduce a notion of a Hamiltonian vector field on a noncommutative Poisson algebra. Then we describe a Poisson structure on a…
In this paper we define 3-crossed modules for commutative (Lie) algebras and investigate the relation between this construction and the simplicial algebras. Also we define the projective 3-crossed resolution for investigate a higher…
This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…
In the paper ``Weil transfer of algebraic cycles'', published by the second author in Indagationes Mathematicae about 25 years ago, a Weil transfer map for Chow groups of smooth algebraic varieties has been constructed and its basic…
Let $G$ be a finite group. There is a standard theorem on the classification of $G$-equivariant finite dimensional simple commutative, associative, and Lie algebras (i.e., simple algebras of these types in the category of representations of…
A continuous family of non-outer conjugate aperiodic automorphisms whose crossed-products are all isomorphic is given on every interpolated free group factor. An explicit "duality" relationship between compact co-commutative Kac algebra…
It has been recently shown that, under appropriate hypotheses, the $\omega$-limit sets of a dynamical system are characterized by internal chain transitivity. In this paper, we examine generalizations of these ideas in the context of the…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are…
This work creates two categories of "array-weighted sets" for the purposes of constructing universal matrix-normed spaces and algebras. These universal objects have the analogous universal property to the free vector space, lifting maps…
We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups…
To a planar algebra P in the sense of Jones we associate a natural non- commutative ring, which can be viewed as the ring of non-commutative polynomials in several indeterminates, invariant under a symmetry encoded by P. We show that this…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…
We construct free monoids in a monoidal category with finite limits and countable colimits, in which tensoring on either side preserves reflexive coequalizers and colimits of countable chains.
The supercharacter theory of algebra groups gave us a representation theoretic realization of the Hopf algebra of symmetric functions in noncommuting variables. The underlying representation theoretic framework comes equipped with two…
A binary relation on a finite set is called a Hall relation if it contains a permutation of the set. Under the usual relational product, Hall relations form a semigroup which is known to be a block-group, that is, a semigroup with at most…
We introduce the calculus of Classical Transitions (CT), which extends the research line on the relationship between linear logic and processes to labelled transitions. The key twist from previous work is registering parallelism in typing…
Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…