相关论文: Free vector lattices and free vector lattice algeb…

We discuss various old and new definitions of the notion of a vector field on a convenient manifold that can be proved to give rise to Lie algebras, and are in finite dimensions equivalent to the standard notion of a vector field.

We give a new construction of free distributive p-algebras. Our construction relies on a detailed description of completely meet-irreducible congruences, so it is purely universal algebraic. It yields a normal form theorem for p-algebra…

We study the lattice of T-spaces of a free associative k-algebra over a nonempty set. It is shown that when the field k is infinite, then the lattice has a maximum element, and that maximum element is in fact a T-ideal. In striking…

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

The set-theoretic large cardinal axiom known as I3 posits the existence of a non-trivial rank-to-rank embedding from an initial segment of the universe of sets into itself. Laver showed that the algebra generated by a single such embedding…

The field equations for both generic bosonic and generic locally supersymmetric 2D dilatonic gravity theories in the absence of matter are written as free differential algebras. This constitutes a generalization of the gauge theoretic…

A class of algebras is constructed using free fermions and the invariant antisymmetric tensors associated with irreducible holonomy groups. (This version contains minor typographical corrections and some additional references. )

We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale…

An important and long-standing open problem in universal algebra asks whether every finite lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is resolved, our understanding of finite algebras is…

The paper contains two main results that are obtained by Boolean valued analysis. The first asserts that a universally complete vector lattice without locally one-dimensional bands can be decomposed into a direct sum of two vector…

We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…

We study different versions of \emph{free objects} in the setting of quasi-Banach spaces and quasi-Banach lattices. Special attention is devoted to the free $p$-convex $p$-Banach lattice $\operatorname{FpBL}^{(p)}[E]$ generated by a…

We study the algebras of modular forms on type IV symmetric domains for simple lattices; that is, lattices for which every Heegner divisor occurs as the divisor of a Borcherds product. For every simple lattice $L$ of signature $(n,2)$ with…

We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…

We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result…

We partially prove a conjecture from [MkSh:366] which says that the spectrum of almost free, essentially free, non-free algebras in a variety is either empty or consists of the class of all successor cardinals.

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The journal of symbolic logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…

We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…