Related papers: The algebra of complete binary trees is affine com…
We introduce and study completely-extendable conformal intertwining algebras. Based on results obtained in other papers, various examples are given. Duals of these algebras are constructed and nondegenerate such algebras are defined. We…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…
Let $\varphi\colon X\to Y$ be an affine continuous surjection between compact convex sets. Suppose that the canonical copy of the space of real-valued affine continuous functions on $Y$ in the space of real-valued affine continuous…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…
A geometric extension algebra is an extension algebra of a semi-simple perverse sheaf (allowing shifts), e.g. a push-forward of the constant sheaf under a projective map. Particular nice situations arise for collapsings of homogeneous…
Proposition algebra is based on Hoare's conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
We prove that the algebra of invariants of a complete path algebra under the action of a homogeneous group of continuous algebra automorphisms is a complete path algebra and preserves finite or tame representation type.
We study affine semigroup rings as algebras over subsemigroup rings. From this relative viewpoint with respect to a given subsemigroup ring, the fibered sum of two affine semigroup algebras is constructed. Such a construction is compared to…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
Mining for trees in a graph is shown to be NP-complete.
We study partially and totally associative ternary algebras of first and second kind. Assuming the vector space underlying a ternary algebra to be a topological space and a triple product to be continuous mapping we consider the trivial…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
We prove the following completeness result about classical realizability: given any Boolean algebra with at least two elements, there exists a Krivine-style classical realizability model whose characteristic Boolean algebra is elementarily…
We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the…
A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…
A class of linear positive, trace preserving maps in $M_n$ is given in terms of affine maps in $\bBR^{n^2-1}$ which map the closed unit ball into itself.