Related papers: Meet-completions and ordered domain algebras
The paper concerns perfect diassociative algebras and their implications to the theory of central extensions. It is first established that perfect diassociative algebras have strong ties with universal central extensions. Then, using a…
We construct non-isogenous simple ordinary abelian varieties over an algebraic closure of a finite field with isomorphic endomorphism algebras.
Completion problems, of recovering a point from a set of observed coordinates, are abundant in applications to image reconstruction, phylogenetics, and data science. We consider a completion problem coming from algebraic statistics: to…
For a finitely-generated vertex operator algebra of central charge c, a locally convex topological completion is constructed. We construct on the completion a structure of an algebra over the operad of the c/2-th power of the determinant…
We prove that the incomparability orthoset of a finite poset is Dacey if and only if the poset is N-free. We give a characterization of finite posets with compatible incomparability orthosets.
We study operator algebras associated to integral domains. In particular, with respect to a set of natural identities we look at the possible nonselfadjoint operator algebras which encode the ring structure of an integral domain. We show…
We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…
Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…
Orthomodular posets form an algebraic formalization of the logic of quantum mechanics. The question is how to introduce the connective implication in such a logic. We show that this is possible when the orthomodular poset in question is of…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
The matrix normed structure of the unitization of a (non-selfadjoint) operator algebra is determined by that of the original operator algebra. This yields a classification up to completely isometric isomorphism of two-dimensional unital…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…
For mapping with branching points that satisfy the inverse inequality of Poletsky, we obtained the results of their continuous boundary extension in terms of prime ends. Under certain conditions, the specified classes od mappings are also…
On a complex symplectic manifold we prove a finiteness result for the global sections of solutions of holonomic DQ-modules in two cases: (a) by assuming that there exists a Poisson compactification (b) in the algebraic case. This extends…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…
The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of…