Related papers: The algebra of complete binary trees is affine com…
It is well known that the set of universal functions on a tree contains a vector space except zero which is dense in the set of harmonic functions. In this paper we improve this result by proving that the set of universal functions on a…
We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.
We say that an algebraic group $G$ over a field is anti-affine if every regular function on $G$ is constant. We obtain a classification of these groups, with applications to the structure of algebraic groups in positive characteristics, and…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…
One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…
If $\A$ is an algebra over a field $\F$ and $\s$ is a generating set of $\A$, the length of $\s$ indicates the maximal length needed to express an arbitrary element of $\A$ as a linear combination of words in the elements of $\s$. The…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
In this paper, we develop some foundations for a theory of algebraic varieties of congruences on commutative semirings. By studying the structure of congruences, firstly, we show that the spectrum $ \text{Spec}^{c}(A) $ consisting of prime…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…
We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…
We prove that the finite representation property holds for representation by partial functions for the signature consisting of composition, intersection, domain and range and for any expansion of this signature by the antidomain, fixset,…
In this paper we introduce new affine algebraic varieties whose points correspond to associative algebras. We show that the algebras within a variety share many important homological properties. In particular, any two algebras in the same…
A strongly Fregean algebra is an algebra such that the class of its homomorphic images is Fregean and the variety generated by this algebra is congruence modular. To understand the structure of these algebras we study the prime intervals…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…
We prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
In this paper we face the problem of representation of functional data with the tools of algebraic topology. We represent functions by means of merge trees, which, like the more commonly used persistence diagrams, are invariant under…