Related papers: Finite Diagram Semigroups: Extending the Computati…
Semidefinite programs (SDPs) are a class of optimisation problems that find application in numerous areas of physics, engineering and mathematics. Semidefinite programming is particularly suited to problems in quantum physics and quantum…
We introduce a framework for generating, organizing, and reasoning with computational knowledge. It is motivated by the observation that most problems in Computational Sciences and Engineering (CSE) can be formulated as that of completing…
Structures of commuting semigroups of isometries under certain additional assumptions like double commutativity or dual double commutativity are found.
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
In 1995 Grillet introduced the concept of a stratified semigroup as a kind of generalisation of finite nilsemigroups. We extend these ideas here by allowing a more general Base and describe them in terms of extensions of semigroups by…
We introduce square diagrams that represent numerical semigroups and we obtain an injection from the set of numerical semigroups into the set of Dyck paths.
Plan of this report is given below: 1. Motivation from Physical and Mathematical Point of View; 2. Differential Calculi on Finite Groups; 3. Metrics; 4. Lagrangian Field Theory and Symplectic Structure; 5. Scalar Field Theory and Spectral…
Group theory involves the study of symmetry, and its inherent beauty gives it the potential to be one of the most accessible and enjoyable areas of mathematics, for students and non-mathematicians alike. Unfortunately, many students never…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
In this paper, we introduce the category of blueprints, which is a category of algebraic objects that include both commutative (semi)rings and commutative monoids. This generalization allows a simultaneous treatment of ideals resp.\…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded…
We describe all finite subsemigroups of a free left regular band of infinite rank. Moreover, we show applications of this result in algebraic geometry and model theory.
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
The study of open quantum systems relies on the notion of unital completely positive semigroups on $C^*$-algebras representing physical systems. The natural generalisation would be to consider the unital completely positive semigroups on…
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
We study the question whether the affine semigroup of integer points in a convex cone can be finitely generated up to symmetries of the cone. We establish general properties of finite generation up to symmetry, and then concentrate on the…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
As a generalization of the free semigroup algebras considered by Davidson and Pitts, and others, the second author and D.W. Kribs initiated a study of reflexive algebras associated with directed graphs. A free semigroupoid algebra L_G is…