相关论文: Tension continuous maps--their structure and appli…

Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field.…

A temporal graph is a dynamic graph where every edge is assigned a set of integer time labels that indicate at which discrete time step the edge is available. In this paper, we study how changes of the time labels, corresponding to delays…

Linked-twist maps are area-preserving, piece-wise diffeomorphisms, defined on a subset of the torus. They are non-uniformly hyperbolic generalisations of the well-known Arnold Cat Map. We show that a class of canonical examples have…

We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…

The estimation of correspondences between two images resp. point sets is a core problem in computer vision. One way to formulate the problem is graph matching leading to the quadratic assignment problem which is NP-hard. Several so called…

Complex networks are universal, arising in fields as disparate as sociology, physics, and biology. In the past decade, extensive research into the properties and behaviors of complex systems has uncovered surprising commonalities among the…

A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify…

This paper addresses the ubiquity of remarkable measures on graphs, and their applications. In many queueing systems, it is necessary to take into account the compatibility constraints between users, or between supply and demands, and so…

In this paper, a link between monotonicity of deterministic dynamical systems and propagation of order by Markov processes is established. The order propagation has received considerable attention in the literature, however, this notion is…

We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…

We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…

A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we…

Turing theory of pattern formation is among the most popular theoretical means to account for the variety of spatio-temporal structures observed in Nature and, for this reason, finds applications in many different fields. While Turing…

Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…

In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion…

Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…

We analyse a new notion of total anisotropic higher-order variation which, differently from the Total Generalized Variation by Bredies et al., quantifies for possibly non-symmetric tensor fields their variations at arbitrary order weighted…

We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…