Related papers: Tree sums of maximal connected spaces

It is known that the folded sum of two contact mapping tori whose fibers are compact exact symplectic manifolds having a common convex boundary (called the ``fold'') admits a cooriented contact structure compatible with the obvious…

It is shown that the Topological Massive and ``Self-dual'' theories, which are known to provide locally equivalent descriptions of spin 1 theories in 2+1 dimensions, have different global properties when formulated over topologically…

For a simple graph $G$, the energy $E(G)$ is defined as the sum of the absolute values of all eigenvalues of its adjacent matrix. For $\Delta\geq 3$ and $t\geq 3$, denote by $T_a(\Delta,t)$ (or simply $T_a$) the tree formed from a path…

Let M be a module over a commutative ring and let Spec(M) (resp. Max(M)) be the collection of all prime (resp. maximal) submodules of M. We topologize Spec(M) with Zariski topology, which is analogous to that for Spec(R), and consider…

We study local connectedness, local accessibility and finite connectedness at the boundary, in relation to the compactness of the Mazurkiewicz completion of a bounded domain in a metric space. For countably connected planar domains we…

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…

This mini-course was given in the First Yaroslavl Summer School on Discrete and Computational Geometry in August 2012, organized by International Delaunay Laboratory "Discrete and Computational Geometry" of Demidov Yaroslavl State…

For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding…

Syntax connects words to each other in very specific ways. Two words are syntactically connected if they depend directly on each other. Syntactic connections usually happen within a sentence. Gathering all those connection across several…

This is the second paper in a series on aura topological spaces $(X, \tau, \mathfrak{a})$, where $\mathfrak{a}: X \to \tau$ is a scope function with $x \in \mathfrak{a}(x)$. We study covering and connectivity properties in this setting.…

Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\cap E(T_j)= \emptyset$ and $V(T_i)\cap V(T_j)=S$ for any pair…

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of…

The Tree Augmentation Problem (TAP) is a fundamental network design problem in which we are given a tree and a set of additional edges, also called \emph{links}. The task is to find a set of links, of minimum size, whose addition to the…

Let X=(V, E) be a digraph. X is maximally connected, if \kappa(X)=\delta(X). X is maximally arc-connected, if \lambda(X)=\delta(X). And X is super arc-connected, if every minimum arc-cut of X is either the set of inarcs of some vertex or…

A connected sum construction for local rings was introduced in a paper by H. Ananthnarayan, L. Avramov, and W.F. Moore. In the graded Artinian Gorenstein case, this can be viewed as an algebraic analogue of the topological construction of…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

In this paper, the core convex topology on a real vector space $X$, which is constructed just by $X$ operators, is investigated. This topology, denoted by $\tau_c$, is the strongest topology which makes $X$ into a locally convex space. It…

We introduce the set-self-Tietze property, an analogue of the self-Tietze property for upper semi-continuous set-valued functions. A topological space $X$ is self-Tietze, if for every closed $A \subseteq X$ and continuous function $f \colon…

Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show…