Related papers: Permutations, substitutions and finite axiomatizab…

We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…

Motivated by a recent conjecture of Zabrocki, Wallach described the alternants in the super-coinvariant algebra of the symmetric group in one set of commuting and one set of anti-commuting variables under the diagonal action. We give a…

The algebra of monodromy matrices for sl(n) trigonometric R-matrices is studied. It is shown that a generic finite-dimensional polynomial irreducible representation of this algebra is equivalent to a tensor product of L-operators.…

We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…

For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…

Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

We consider affine representable algebras, that is, finitely generated algebras over a field that can be embedded into some matrix algebra over a commutative algebra. We show that this algebra can in fact be chosen to be a polynomial…

Quasi relation algebras (qRAs) were first described by Galatos and Jipsen in 2013. They are generalisations of relation algebras and can also be viewed as certain residuated lattice expansions. We identify positive symmetric idempotent…

This paper considers the estimation and inference of the low-rank components in high-dimensional matrix-variate factor models, where each dimension of the matrix-variates ($p \times q$) is comparable to or greater than the number of…

For any finite dimensional basic associative algebra, we study the presentation spaces and their relation with the representation spaces. We prove two propositions about a general presentation, one on its subrepresentations and the other on…

We study representations of the Loop Kac-Moody Lie algebra g \otimes A, where g is any Kac-Moody algebra and A is a ring of Laurent polynomials in n commuting variables. In particular, we study representations with finite dimensional weight…

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…

$\mathop{\rm rp}\nolimits ({\mathbb B})$ denotes the reduced power ${\mathbb B}^\omega /\Phi$ of a Boolean algebra ${\mathbb B}$, where $\Phi$ is the Fr\'{e}chet filter $\Phi$ on $\omega$. We investigate iterated reduced powers…

Historical approaches to Table Representation Learning (TRL) have largely adopted the sequential paradigms of Natural Language Processing (NLP). We argue that this linearization of tables discards their essential geometric and relational…

We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…

Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…

Construction of superintegrable systems based on Lie algebras have been introduced over the years. However, these approaches depend on explicit realisations, for instance as a differential operators, of the underlying Lie algebra. This is…

In this paper we study some algebraic properties of the rack structure as well as the representation theory of it, following the ideas given by M. Elhamdadi and E. M. Moutuou in \cite{Elhamdadi}. We establish a correspondence between the…