Related papers: Representable and diagonally representable weakeni…
We build a notion of algebraic recognition for visibly pushdown languages by finite algebraic objects. These come with a typical Eilenberg relationship, now between classes of visibly pushdown languages and classes of finite algebras.…
We study representations of Banach algebras on reflexive Banach spaces. Algebras which admit such representations which are bounded below seem to be a good generalisation of Arens regular Banach algebras; this class includes dual Banach…
We characterize finite-dimensional thick representations over ${\Bbb C}$ of connected complex semi-simple Lie groups by irreducible representations which are weight multiplicity-free and whose weight posets are totally ordered sets.…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…
Let $G$ be a simple algebraic group over an algebraically closed field $k$ of characteristic $p$. The classification of the conjugacy classes of unipotent elements of $G(k)$ and nilpotent orbits of $G$ on $\operatorname{Lie}(G)$ is…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
The Pareto dominance relation of a preference profile is (the asymmetric part of) a partial order. For any integer n, the problem of the existence of an n-agent preference profile that generates the given Pareto dominance relation is to…
We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal…
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of…
In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…
We introduce the notion of partial representation of a weak Hopf algebra. We present the universal algebra $H_{par}^w$, which factorizes these partial representations by algebra morphisms. Also, it is shown that $\Hp$ is isomorphic to a…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…
We study the behavior of representation varieties of quivers with relations under the operation of node splitting. We show how splitting a node gives a correspondence between certain closed subvarieties of representation varieties for…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of…
We introduce the notion of a weakly reflective submanifold, which is an austere submanifold with a certain global condition, and study its fundamental properties. Using these, we determine weakly reflective orbits and austere orbits of…
A decomposition space (also called 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses composition, the new condition expresses decomposition. It is…
We address the problem of learning a distributed representation of entities in a relational database using a low-dimensional embedding. Low-dimensional embeddings aim to encapsulate a concise vector representation for an underlying dataset…
Discourse relations bind smaller linguistic units into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked arguments. A more subtle challenge is…