**1**

vote

**0**answers

50 views

### On low rank $0/1$ real matrices with one connected component

Let $M$ be an $n\times n$ $0-1$ matrix of real rank $r$.
Moreover assume every row of $M$ is distinct and every column of $M$ is distinct. Such a matrix cannot be bigger than $2^r\times 2^r$.
As in ...

**2**

votes

**0**answers

74 views

### Number of self avoiding paths which are not ``tie together''

Consider the lattice $\mathbb{Z}^d$. Let $A_{n}$ be the set of returning self-avoiding paths (from $0$ to $0$) having length $n$. For any path $\omega \in A_{n}$, let $f(\omega)$ be the number of ...

**2**

votes

**2**answers

181 views

### A Jordan Separation Theorem for Polyhedral Surfaces

Let me begin by defining what a polyhedral surface is.
A path-connected subset $ P $ of $ \mathbb{R}^{3} $ is called a polyhedral surface iff it is the union of a finite collection $ \mathcal{C} $ of ...

**1**

vote

**1**answer

173 views

### Two questions on path connected spaces

Is it true to say that a compact hausdorff space $X$ is path connected if and only if for every continuous function $f:X\to \mathbb{C}$, we have $f(X)\subset \mathbb{C}$ is path connected?
...

**13**

votes

**1**answer

578 views

### Connected components $0-1$ matrices

Let $M$ be a $0-1$ matrix.
Here a matrix has one component means we can traverse from a matrix entry $(i,j)$ which is $1$ to any other one by moving step of $(i\pm1,j),(i,j\pm1),(i\pm1,j\pm1)$ where ...

**2**

votes

**1**answer

82 views

### How to infer missing nodes from a path?

I have a first data set which is a list of train stops with coordinates (lat, lon), but not the "links" between the nodes/stops (this could thought of as a null or empty graph).
I have a second data ...

**-1**

votes

**1**answer

104 views

### Complements of images of complex analytic sets

It is known that the complement of an analytic set is connected. In general, the complement of a proper complex analytic set in a connected complex manifold is an arcwise connected dense open set. My ...

**5**

votes

**2**answers

345 views

### Beyond Cantor's Teepee

From Counterexamples in Topology by Steen and Seebach (2nd edition) example 129 page 145 we have an example of connected and totally path-disconnected space.
It is defined as follow:
Fix $p= ...

**1**

vote

**0**answers

66 views

### Analogue of a path-connected subspace in the context of point processes

Given a set of points $S$ in some metric space, a pair of points $x, x'$ will be termed $\epsilon$-connected if they are connected by a series of points $x_1, \ldots, x_m \in S$ such that $d(x, x_1)$, ...

**2**

votes

**1**answer

265 views

### topological group that is connected and locally connected but not path-connected

Is there a ($\mathrm{T}_0$) topological group that is connected and locally connected but is not path-connected?
This is a cross-post from MSE, since my question there was posted over three weeks ...

**3**

votes

**1**answer

191 views

### When is a sublevel set path-connected?

I am trying to completely characterize the conditions on $f : \mathbb{R}^n \to \mathbb{R}$ under which $\{x | f(x) \le 0 \}$ is path-connected. There are many obvious conditions that are sufficient ...

**0**

votes

**0**answers

172 views

### When is $\{ x \ge 0 | f(x) \le 0\}$ path-connected?

I'm trying to determine the conditions on $f : \mathbb{R}^n_{\ge 0} \to \mathbb{R^n}$ under which $\{ x \ge 0 | f(x) \le 0 \}$ is path-connected. We can assume that $f$ is continuous and concave.
...

**2**

votes

**1**answer

727 views

### number of totally different path between two nodes in graph theory

I have an undirected, unweighted graph representing a network.
I have a starting node and an end one.
My 'network' is reliable if there is no node such that without that node s and t are not reachable ...

**5**

votes

**2**answers

279 views

### Refining open covers in locally path connected spaces

Suppose $X$ is a locally path connected topological space and $\mathcal{U}$ is an open cover of $X$ (consisting of path connected sets if we want).
One often wants the intersection $A\cap B$ of ...

**3**

votes

**1**answer

593 views

### Connected level sets

This may be an ill-posed question, but suppose I have a collection of continuous, bounded, scalar-valued nonnegative functions $f_1(x,y),\dots,f_n(x.y)$ defined on the closed unit disk. Given a ...

**4**

votes

**0**answers

559 views

### Path connected set of matrices?

Consider the collection of $n$ by $n$ matrices
$$S=\{ A: A_{ij}\le0,\quad (-1)^{c_i}\det A(P_i;Q_i)<0 \quad \text{for} \quad i=1,\ldots, k\}$$
where $c_i\in \{0,1\}$, $P_i$ and $Q_i$ are disjoint ...

**11**

votes

**2**answers

884 views

### Connectedness of space of ergodic measures

Let $X = \Sigma_p^+ = \{1,\dots,p\}^\mathbb{N}$ and let $f=\sigma\colon X\to X$ be the shift map. Let $\mathcal{M}$ be the space of Borel $f$-invariant probability measures on $X$ endowed with the ...

**4**

votes

**2**answers

480 views

### Ends of topological spaces. Why independent of choice of ascending sequence of compact subsets?

Quoting from http://en.wikipedia.org/wiki/End_(topology):
"Let X be a topological space, and suppose that
K1 ⊂ K2 ⊂ K3 ⊂ · · ·
is an ascending sequence of compact ...

**-2**

votes

**1**answer

614 views

### epsilon tube around continuous path in open set in R^n [closed]

This may have a simple answer, but I'm not getting anywhere.
If $U$ is an open set in $\mathbb{R}^n$ (usual topology), and $p:[0,1] \to U$ is a continuous path, from $x=p(0)$ to $y=p(1)$, with $x,y ...

**12**

votes

**2**answers

1k views

### (Path) connected set of matrices?

Let $N \in \mathfrak{M}_n(\mathbb{C})$ nilpotent, such that there exists $X \in \mathfrak M_n(\mathbb{C})$ with $X^2=N$ (take for instance $n>2$ and $N(1,n)=1$; $N(i,j)=0$ otherwise).
Denote by ...

**11**

votes

**5**answers

39k views

### Finding all paths on undirected graph

I have an undirected, unweighted graph, and I'm trying to come up with an algorithm that, given 2 unique nodes on the graph, will find all paths connecting the two nodes, not including cycles. Here's ...

**5**

votes

**2**answers

15k views

### Difference between connected vs strongly connected vs complete graphs [closed]

What is the difference between
connected
strongly-connected and
complete?
My understanding is:
connected: you can get to every vertex from every other vertex.
strongly connected: every vertex ...

**4**

votes

**2**answers

2k views

### What does the property that path-connectedness implies arc-connectedness imply?

A space X is path-connected if any two points are the endpoints of a path, that is, the image of a map [0,1] \to X. A space is arc-connected if any two points are the endpoints of a path, that, the ...

**17**

votes

**4**answers

4k views

### Can you explicitly write $\mathbb{R}^2$ as a disjoint union of two totally path disconnected sets?

An anonymous question from the 20-questions seminar:
Can you explicitly write $\mathbb{R}^2$ as a disjoint union of two totally path disconnected sets?