相关论文: Homogeneous Equations of Algebraic Petri Nets
Stable event structures, and their duality with prime algebraic domains arising as partial orders of configurations, are a landmark of concurrency theory, providing a clear characterisation of causality in computations. They have been used…
Persistent homology is a fundamental tool in topological data analysis; however, it lacks methods to quantify the fragility or fineness of cycles, anticipate their formation or disappearance, or evaluate their stability beyond persistence.…
We investigate analogues of some of the classical results in homogeneous dynamics in non-linear setting. Let $G$ be a closed subgroup of the group of automorphisms of a biregular tree and $\Gamma<G$ a discrete subgroup. For a large class of…
We investigate the flat holomorphic vector bundles over compact complex parallelizable manifolds $G / \Gamma$, where $G$ is a complex connected Lie group and $\Gamma$ is a cocompact lattice in it. The main result proved here is a structure…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem 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…
An algebraic criterion that is sufficient to establish the existence of certain a priori estimates for the solution of first-order homogeneous linear characteristic problems is derived. Estimates of such kind ensure the stability of the…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Associated to every group with a weak spherical Tits system of rank n+1 with an appropriate rank n subgroup, we construct a relative spectral sequence involving group homology of Levi subgroups of both groups. Using the fact that such Levi…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
We show that if $G$ is a discrete Abelian group and $A \subset G$ has $\|1_A\|_{B(G)} \leq M$ then $A$ is $O(\exp(\pi M))$-stable in the sense of Terry and Wolf.
Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that…
Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…
We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we…
Let $G$ be a Polish (i.e., complete separable metric topological) group. Define $G$ to be an algebraically determined Polish group if for any Polish group $L$ and algebraic isomorphism $\varphi: L \mapsto G$, we have that $\varphi$ is a…
We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the…
The word stable is used to describe a situation when mathematical objects that almost satisfy an equation are close to objects satisfying it exactly. We study operator-algebraic forms of stability for unitary representations of groups and…
We say that a group is anti-solvable if all of its composition factors are non-abelian. We consider a particular family of anti-solvable finite groups containing the simple alternating groups for $n\neq 6$ and all 26 sporadic simple groups.…
We study a continuous dynamics for a class of Petri nets which allows the routing at non-free choice places to be determined by priorities rules. We show that this dynamics can be written in terms of policies which identify the bottleneck…