Related papers: Existence and explicit formula for a semigroup rel…
We show how strongly continuous semigroups can be associated with evolutionary equations. For doing so, we need to define the space of admissible history functions and initial states. Moreover, the initial value problem has to be formulated…
We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras…
We consider local singular perturbations of a one-dimensional Laplace operator from the point of view of semigroup theory. Under certain assumptions, we prove the convergence of the corresponding semigroups to the heat semigroup with…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We study the damped wave equation with a damping coefficient which is possibly singular and unbounded at infinity. In general, zero belongs to the spectrum of the corresponding generator, which prevents a uniform (exponential) decay for the…
We present a perturbation result for generators of $C_0$-semigroups which can be considered as an operator theoretic version of the Weiss-Staffans perturbation theorem for abstract linear systems. The result are illustrated by applications…
Let $\Omega$ be an operator semigroup with generator $A$ in a sequentially complete locally convex topological vector space $E$. For a semigroup with generator $A+D$, where $D$ is a bounded linear operator on $E$, two integral equations are…
We consider expanding semiflows on branched surfaces. The family of transfer operators associated to the semiflow is a one-parameter semigroup of operators. The transfer operators may also be viewed as an operator-valued function of time…
We study elliptic and parabolic problems governed by the singular elliptic operators \begin{align*} \mathcal L=y^{\alpha_1}\mbox{Tr }\left(QD^2_xu\right)+2y^{\frac{\alpha_1+\alpha_2}{2}}q\cdot \nabla_xD_y+\gamma y^{\alpha_2}…
The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…
In this paper, we introduce a general constructive method to compute solutions of initial value problems of semilinear parabolic partial differential equations on hyper-rectangular domains via semigroup theory and computer-assisted proofs.…
We introduce the concept of a semigroup coupled cell network and show that the collection of semigroup network vector fields forms a Lie algebra. This implies that near a dynamical equilibrium the local normal form of a semigroup network is…
A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…
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 develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
We prove local well-posedness for the initial-boundary-value problem associated to some quadratic nonlinear Schr\"odinger equations on the half-line. The results are obtained in the low regularity setting by introducing an analytic family…
The `global' Zarankiewicz problem for hypergraphs asks for an upper bound on the number of edges of a finite $r$-hypergraph $V$ in terms of the number $|V|$ of its vertices, assuming the edge relation is induced by a fixed $K_{k, \dots,…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…