Related papers: On finite reflexive homomorphism-homogeneous binar…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
We introduce the concept of F-decomposable systems, well-ordered inverse systems of Hausdorff compacta with fully closed bonding mappings. A continuous mapping between Hausdorff compacta is called fully closed if the intersection of the…
We address the homotopy theory of 2-crossed modules of commutative algebras, which are equivalent to simplicial commutative algebras with Moore complex of length two. In particular, we construct for maps of 2-crossed modules a homotopy…
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have attained a lot of attention from both the structural and…
By a classical theorem transversal homoclinic points of maps lead to shift dynamics on a maximal invariant set, also referred to as a homoclinic tangle. In this paper we study the fate of homoclinic tangles in parameterized systems from the…
Homotopy is an important feature of associative and Jordan algebraic structures: such structures always come in families whose members need not be isomorphic among other, but still share many important properties. One may regard homotopy as…
For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t(H,W)$. One may then define corresponding functionals…
A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone, i.e., for every pair of points in the interior of the cone, there exists a cone automorphism that maps one point to the other. Cones that…
For r at least 3, p at least 2, we classify all actions of the groups Diff^r_c(R) and Diff^r_+(S1) by C^p -diffeomorphisms on the line and on the circle. This is the same as describing all nontrivial group homomorphisms between groups of…
Given two discrete Morse functions on a simplicial complex, we introduce the {\em connectedness homomorphism} between the corresponding discrete Morse complexes. This concept leads to a novel framework for studying the connectedness in…
This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…
We show that a bounded, linear map between C*-algebras is a weighted $\ast$-homomorphism (the central compression of a $\ast$-homomorphism) if and only if it preserves zero-products, range-orthogonality, and domain-orthogonality. It follows…
We show that every non-degenerate homogeneous plane continuum is homeomorphic to either the unit circle, the pseudo-arc, or the circle of pseudo-arcs. It follows that any planar homogenous compactum has the form $X \times Z$, where $X$ is a…
Balogh, Bollob\'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic…
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…
In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are…
In this paper, we classify compact simply connected cohomogeneity one manifolds up to equivariant diffeomorphism whose isotropy representation by the connected component of the principal isotropy subgroup has three or less irreducible…
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…
In this article, we investigate the topological structure of large scale interacting systems on infinite graphs, by constructing a suitable cohomology which we call the uniform cohomology. The central idea for the construction is the…