Search results

Create the page "Is topology enough?" on this wiki! See also the search results found.

• Topology of graphs
  Here we take our first step toward ''algebraic topology''. *verifying that it is path-connected<!--\index{path-connectedness}--> requires testing ''infinite
  25 KB (4,214 words) - 16:08, 28 November 2015
• Compact spaces
  ...nnectedness}--> (under a continuous map<!--\index{continuous function}-->) is a path-connected. The second main topological theorem from Calculus 1 is:
  19 KB (3,207 words) - 13:06, 29 November 2015
• Cubical complex
  Suppose the Euclidean space ${\bf R}^N$ is given and so is its cubical grid ${\bf Z}^N$. Suppose also that we have its decomposition $ ...of cubical cells $K\subset {\mathbb R}^N$ for which the boundary operator is well defined. This requires us to include all “faces” of the cells alre
  29 KB (4,800 words) - 13:41, 1 December 2015
• Computing homology
  ..., typically, integer coefficients. Then the set of all $k$-chains $C_k(K)$ is an [[abelian group]] with respect to chain addition generated by the $k$-ce ...tyle\sum_i s_i \sigma_i \colon s_i \in {\bf Z}, \sigma_i {\rm \hspace{3pt} is \hspace{3pt} a \hspace{3pt}} k{\rm -cell \hspace{3pt} in \hspace{3pt}} K \r
  26 KB (4,370 words) - 21:55, 10 January 2014
• Simplicial maps and chain maps
  A graph map<!--\index{graph map}--> $f:K\to L$ is a function between graphs $K,L$ that satisfies, for each edge $e$, either: *1. (cloning) $f(e)$ is an edge $g$ and $f$ takes the end-points of $e$ to the end-points of $g$; o
  34 KB (5,897 words) - 16:05, 26 October 2015
• Robustness of topology of digital images and point clouds by Saveliev
  ''Robustness of topology of digital images and point clouds'' by [[Peter Saveliev]] ...ements of the filtration without double count. The second step of analysis is to discard the features that lie outside the user's choice of the acceptabl
  27 KB (4,547 words) - 04:08, 6 November 2012
• Modeling with discrete exterior calculus
  ...erential forms. Our main conclusion is that the isotropy of heat on a grid is heavily dependant upon the geometry of the grid. For example, the square gr ...T}{\partial t}=-k\nabla^{2} T$ as the [[Heat transfer |heat equation]]. It is continuous and its solution relies upon both initial and boundary condition
  31 KB (5,254 words) - 17:57, 21 July 2012
• Simplicial maps
  A graph map<!--\index{graph map}--> $f:K\to L$ is a function between graphs $K,L$ that satisfies, for each edge $e$, either: *1. (cloning) $f(e)$ is an edge $g$ and $f$ takes the end-points of $e$ to the end-points of $g$; o
  34 KB (5,929 words) - 03:31, 29 November 2015
• Selection votes
  ...seen as mutually exclusive but ''all'' of them may come true. What happens is determined by the probabilities assigned to the primary events. These conve ...epresents the lottery when either is equally likely to appear while “hail” is impossible. The probabilities of the three events give the vector $(\tfrac{
  24 KB (3,989 words) - 01:56, 16 May 2016
• Applied Topology and Geometry
  #REDIRECT[[Topology Illustrated]] ''Applied Topology and Geometry'' by [[Peter Saveliev]]
  16 KB (2,088 words) - 16:37, 29 November 2014
• Test
  ''Applied Topology and Geometry'' by [[Peter Saveliev]] ...appreciate your comments. If you are a beginner, you might want to start [[Topology Illustrated|here]] instead.
  16 KB (2,139 words) - 23:01, 9 February 2015
• Lefschetz numbers in control theory
  The goal is to develop some applications of the Lefschetz fixed point theory techniques ...one, $x\in M$. The ''equilibrium'' set $C=\{x\in M:f(x)=x\}$ of the system is the set of fixed points of $f.$
  17 KB (3,052 words) - 22:12, 15 July 2014
• Discrete Calculus: Applied Analysis on Graphs for Computational Science by Grady and Polimeni
  This is an informal review... <center>'''[[Calculus is topology]].'''</center>
  11 KB (1,663 words) - 16:03, 26 November 2012
• Products of complexes
  The idea of the product may be traced to the image of a stack, which is a simple arrangement of multiple copies of $X$: We can think of it as if a copy of the $y$-axis is attached to every point on the $x$-axis. Or, we can think in terms of ''pro
  16 KB (2,892 words) - 22:39, 18 February 2016
• Calculus as a part of topology
  Topology, Algebra, and Geometry are disciplines within Mathematics. In calculus we u ...d Geometry. However, take a look at where this is all happening. The locus is the ''Euclidean space''. Such a space has three different types of structur
  13 KB (2,233 words) - 14:41, 20 February 2015
• More about manifolds
  Suppose the circle is centered at $0$ on the $xy$-plane. In other words, each point is identified with the one symmetric with respect to the $x$-axis. Then
  9 KB (1,542 words) - 19:58, 21 January 2014
• Nerve of cover
  ...ebraic invariants. But how do you find this representation if all you have is a topological space, i.e., a collection of open sets. To solve this problem, let's start with a study of the topology of a [[simplicial complex]].
  8 KB (1,389 words) - 13:35, 12 August 2015
• Constructions
  ...ical sense. The Reflexivity Axiom, $A \sim A$, is: every spot of the sheet is glued to itself. The Symmetry Axiom, $A \sim B \Longrightarrow B \sim A$, b Thinking of a ''zipper'' is also appropriate:
  13 KB (2,270 words) - 22:14, 18 February 2016
• Algebra of differential forms
  For example, we see below that $\phi = x^2 dx + xy dy$ is a [[linear function]] of $dx$ and $dy$, non-linear for $x,y$. This is called ''[[additivity]]''.
  11 KB (1,947 words) - 18:14, 22 August 2015
• Equilibria of dynamical systems
  ...em]] is simply a map $F:S \to S$. Therefore the meaning of its equilibrium is simple: $F(a)=a$. It's a [[fixed point]]! ...ith an example outside the realm of physics, for a change. The application is to the existence of equilibria supply and demand in a simple market economy
  7 KB (1,251 words) - 15:00, 4 April 2014
• Cell decomposition of images
  ...ixel]]s. Normally, it is assumed that objects are black and the background is white. ...ent the object simply as a list of pairs of numbers and this is the way it is commonly done. We will follow this convention.
  11 KB (1,829 words) - 19:26, 10 February 2015
• Algebraic topology: course
  ...uctory, two semester course on algebraic topology and its applications. It is intended for advanced undergraduate and beginning graduate students. ...dated. The source of material is currently in a draft of a book called ''[[Topology Illustrated]]''.
  3 KB (448 words) - 13:32, 17 March 2014
• Euclidean space made discrete
  ...<!--\index{finite differences}-->. Usually only the time (i.e., ${\bf R}$) is discretized: ...wave propagation<!--\index{ wave propagation}--> etc. This time the space is discretized as well:
  11 KB (1,801 words) - 15:50, 25 July 2014
• Pattern recognition in computer vision
  ...and then match them with those of the other image or images. This approach is complex and limited to face identification. In order to develop a content i ...and pattern recognition methods can be used. Nice! The most common method is probably [[clustering]] – looking for groups of points unusually close to
  9 KB (1,526 words) - 17:54, 1 July 2011
• Diffusion with various geometry
  Recall that, naively, [[diffusion]] is modeled with [[Excel]] as follows: On a deeper level, the geometry is supplied by [[Hodge duality]] and affects the forms that we deal with.
  13 KB (2,121 words) - 16:33, 7 June 2013
• Filtering output data
  ...ick only one. This is to be done by the user based on his criteria of what is [[noise]]: too small, low [[contrast]], low [[roundness]] etc. ...[[Pixcavator]]. In fact, [[Pixcavator's output table]] gives you a sample topology. After that you are on your own. And you have several ruler/sliders to use.
  3 KB (598 words) - 15:02, 9 October 2010
• Classification of points with respect to a subset
  For the background see [[Introduction to point-set topology]]. *a point $x$ is called an ''interior point'' of $A$ if there is a [[Neighborhoods and topologies|neighborhood]] $W$ of $x$ that lies entire
  4 KB (703 words) - 01:55, 1 October 2013
• Computational science training: 2010 projects
  <li>''[[The topology of data]]'' by Joseph Snyder, and</li> ...se issues were mostly resolved. Unfortunately, in either case there wasn't enough time to test the programs with real-life data.
  6 KB (926 words) - 17:02, 7 February 2011
• Geometry in calculus
  <center>$\lim_{x\to a}f(x)=L$ if for any $\epsilon >0$ there is a $\delta >0$ such that $0<|x-a|<\delta$ implies that $|f(x)-L|<\epsilon$. ...m_{x\to a}f(x)=L$ if for any open [[neighborhood]] $\epsilon$ of $L$ there is an open neighborhood $\delta$ of $a$ such that $x\in\delta$ implies $f(x)\i
  9 KB (1,604 words) - 18:08, 27 August 2015
• How to compute homology
  The $k$-[[chain group]] $C_k(K)$ is given as a vector space with [[basis of vector space|basis]] consisting of Its dimension is then obvious.
  6 KB (1,049 words) - 09:21, 3 September 2011
• Bad math
  ...ut a more typical problem with how [[mathematics]] is used in applications is '''made-up and hidden parameters'''. Compare: ...sentation of the topology of gray scale images|graph representation of the topology of images]] (and [[Pixcavator]] in particular),
  3 KB (453 words) - 10:35, 26 February 2013
• How to compute Betti numbers
  The $k$-[[chain group]] $C_k(K)$ is given as a vector space with [[basis of vector space|basis]] consisting of Its dimension is then obvious.
  5 KB (890 words) - 14:47, 24 August 2014
• Simply connected spaces
  *Can you can get from $A$ to $B$ in two ([[topology|topologically]]) different ways? So, $X$ is called ''simply connected'' if every closed curve can be "contracted" -- vi
  5 KB (785 words) - 22:07, 3 January 2014
• Connectivity
  ...ent the object simply as a list of pairs of numbers and this is the way it is commonly done. ...ent" they are connected by an edge, as shown in these pictures. The result is a ''graph representation of the binary image''.
  4 KB (636 words) - 14:53, 9 October 2010
• Examples of homology of cubical complexes
  The simplest way to capture the [[topology]] of $X$ is by considering a square and an edge as on the right. Its cubical representa (This is called the $0$-[[skeleton]] of $K$.)
  3 KB (519 words) - 18:06, 27 August 2015
• Stages of analysis
  Suppose we have found the [[topology graph]] of the [[gray scale image]]. '''Image -> its topology graph -> one of the possible topologies'''
  1 KB (174 words) - 18:34, 30 January 2011
• Intro to Higher Mathematics -- Spring 2018 -- final exam
  *Show enough work to justify your answers. $\bullet$ '''2.''' Below is the addition (multiplication) table of a group. Complete it.
  2 KB (284 words) - 18:23, 4 May 2018
• Advanced Topology -- Spring 2013 -- final exam
  *Show enough work to justify your answers. Refer to theorems whenever necessary. #A set $Y \subset {\bf R}^n$ is called star-shaped if there is $a\in Y$ such that for any $x \in Y$ the segment from $x$ to $a$ lies entir
  3 KB (532 words) - 15:09, 8 May 2013
• Peter Saveliev
  Hello! My name is Peter Saveliev (rhymes with “leave”). Pronouns are available upon reque *''Topology Illustrated'' (Note: Due to my day job, the second edition is postponed indefinitely.)
  4 KB (652 words) - 14:02, 15 April 2024
• Topology I -- Fall 2013 -- final exam
  *Show enough work to justify your answers. Refer to theorems whenever necessary. ...Y U I O P [ ] \. Think of them as if they are made of wires so that there is no width in these lines. Classify them "up to homeomorphism". (Just the ans
  2 KB (317 words) - 16:34, 10 December 2013
• Topology I -- Fall 2013 -- midterm
  *Show enough work to justify your answers. Refer to theorems whenever necessary. #Show that any set is both open and closed relative to itself. (short proof)
  1 KB (241 words) - 17:53, 21 October 2013
• How to use Pixcavator
  Stage 1: automatic.</strong> The software creates a [[topology graph|data structure]] that contains the complete information about the con ...ntours so that the user can choose the best segmentation. The output table is also updated instantly.
  3 KB (442 words) - 14:43, 4 November 2011

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)