Related papers: An Instruction Sequence Semigroup with Involutive …
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
How do neural networks trained over sequences acquire the ability to perform structured operations, such as arithmetic, geometric, and algorithmic computation? To gain insight into this question, we introduce the sequential group…
With the rapid increase of compound databases available in medicinal and material science, there is a growing need for learning representations of molecules in a semi-supervised manner. In this paper, we propose an unsupervised hierarchical…
In this paper we analyse the structure of the Cuntz semigroup of certain $C(X)$-algebras, for compact spaces of low dimension, that have no $\mathrm{K}_1$-obstruction in their fibres in a strong sense. The techniques developed yield…
We use semigroup theory to describe the group of automorphisms of some semigroups of interest in holomorphic dynamical systems. We show, with some examples, that representation theory of semigroups is related to usual constructions in…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
We present a novel and well automatable approach to formal verification of C programs with underspecified semantics, i.e., a language semantics that leaves open the order of certain evaluations. First, we reduce this problem to…
We define proper, free and commuting partial actions on upper semicontinuous bundles of $C^*-$algebras. With such, we construct the $C^*-$algebra induced by a partial action and a partial actions on that algebra. Using those action we give…
We introduce a new programming language and its categorical semantics in order to design and implement neural networks within the framework of algebraic effects and handlers for arrows. Our language enables us to construct neural networks…
This is a common introduction to math.RT/0101170, math.RT/0306333, math.RT/0506043, math.RT/0601028. Compared to these references there are new results including (i) a description of a separable closure of an extension of transcendence…
For many real-world classification problems, e.g., sentiment classification, most existing machine learning methods are biased towards the majority class when the Imbalance Ratio (IR) is high. To address this problem, we propose a set…
We prolonge the list of C*-algebras for which all extensions by any stable separable C*-algebra are semi-invertible. In particular, we handle certain amalgamations, both of C*-algebras and of groups. Concerning groups we consider both…
We give a construction that takes a simple linear algebraic group $G$ over a field and produces a commutative, unital, and simple non-associative algebra $A$ over that field. Two attractions of this construction are that (1) when $G$ has…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
For 0 < s < 1, let phi_s(z)=sz+(1-s). We investigate the unital C*-algebra generated by the semigroup {C_{phi_s} : 0 < s < 1} of composition operators acting on the Hardy space of the unit disk. We determine the joint approximate point…
Sequence learning is an essential aspect of intelligence. In Artificial Intelligence, sequence prediction task is usually used to test a sequence learning model. In this paper, a model of sequence learning, which is interpretable through…
Graph-based semi-supervised learning usually involves two separate stages, constructing an affinity graph and then propagating labels for transductive inference on the graph. It is suboptimal to solve them independently, as the correlation…
A semigroupoid is a set equipped with a partially defined associative operation. Given a semigroupoid \Lambda we construct a C*-algebra C*(\Lambda) from it. We then present two main examples of semigroupoids, namely the Markov semigroupoid…