Related papers: Analysing cycloids using linear algebra
This article describes recent work on the topic of specifying properties of transition systems. By giving a suitably abstract description of transition systems as coalgebras, it is possible to derive logics for capturing properties of these…
We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.
A concrete representation of the Clifford algebra (for any hyperbolic quadratic space) is given using what are called Suslin matrices. This explicit construction is used to analyze the corresponding Spin groups and the involution and might…
The formalism of the models with Petri networks provides a sound theoretical base, supported by powerful mathematical methods able to extract information necessary for the formalism and simulation of the real system that provides features…
Cycles, which can be found in many different kinds of networks, make the problems more intractable, especially when dealing with dynamical processes on networks. On the contrary, tree networks in which no cycle exists, are simplifications…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
In this paper, theory and construction of spinor representations of real Clifford algebras $\cl_{p,q}$ in minimal left ideals are reviewed. Connection with a general theory of semisimple rings is shown. The actual computations can be found…
We give an algebraic formulation based on Clifford algebras and algebraic spinors for quantum information. In this context, logic gates and concepts such as chirality, charge conjugation, parity and time reversal are introduced and explored…
Linear systems under the influence of nonlinear and random linear perturbations, and with random initial and boundary conditions, are discussed. The notion of states of a system is substituted by the notion of the generating vectors for…
In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
Acyclic networks are a class of complex networks in which links are directed and don't have closed loops. Here we present an algorithm for transforming an ordinary undirected complex network into an acyclic one. Further analysis of an…
Circuit algebras are a symmetric version of Jones's planar algebras. They originated in quantum topology as a framework for encoding virtual crossings. This paper extends existing results for modular operads to construct a graphical…
Clifford algebras are important structures in Geometric Algebra and Quantum Mechanics. They have allowed a formalization of the primitive operators in Quantum Theory. The algebras are built over vector spaces with dimension a power of 2…
Inspired by the theory of classifying topoi for geometric theories, we define rounded sketches and logoi and provide the notion of classifying logos for a rounded sketch. Rounded sketches can be used to axiomatise all the known fragments of…
Recent development of network structure analysis shows that it plays an important role in characterizing complex system of many branches of sciences. Different from previous network centrality measures, this paper proposes the notion of…
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be…
We formalise a general concept of distributed systems as sequential components interacting asynchronously. We define a corresponding class of Petri nets, called LSGA nets, and precisely characterise those system specifications which can be…
Developing algorithms for distributed systems is an error-prone task. Formal models like Petri nets with transits and Petri games can prevent errors when developing such algorithms. Petri nets with transits allow us to follow the data flow…
Cyclidic nets are introduced as discrete analogs of curvature line parametrized surfaces and orthogonal coordinate systems. A 2-dimensional cyclidic net is a piecewise smooth $C^1$-surface built from surface patches of Dupin cyclides, each…