Related papers: Combinatorial Morse flows are hard to find
In the case of smooth manifolds, we use Forman's discrete Morse theory to realize combinatorially any Thom-Smale complex coming from a smooth Morse function by a couple triangulation-discrete Morse function. As an application, we prove that…
We prove that for every three-dimensional vector field, either it can be accumulated by Morse-Smale ones, or it can be accumulated by ones with a transverse homoclinic intersection of some hyperbolic periodic orbit in the $C^1$ topology.
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We investigate the properties of the combinatorial Ricci flow for surfaces, both forward and backward -- existence, uniqueness and singularities formation. We show that the positive results that exist for the smooth Ricci flow also hold for…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
The aim of this work is to prove $C^1$ weak Palis conjecture for nonsingular flows. Weak Palis conjecture claims that a generic vector field either is Morse-Smale or exhibits horseshoes. Central model is come up with by Crovisier to obtain…
For Morse-Smale pairs on a smooth, closed manifold the Morse-Smale-Witten chain complex can be defined. The associated Morse homology is isomorphic to the singular homology of the manifold and yields the classical Morse relations for Morse…
There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…
We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…
We introduce a refinement of persistent homology that detects simple-homotopy-theoretic phenomena invisible to homology. Given a filtered simplicial complex, we define the Morse complexity profile as the minimal number of critical simplices…
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
Three combinatorial matrices are considered and their LU-decompositions were found. This is typically done by (creative) guessing, and necessary proofs are more or less routine calculations.
Given a Morse function on a manifold whose moduli spaces of gradient flow lines for each action window are compact up to breaking one gets a bidirect system of chain complexes. There are different possibilities to take limits of such a…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
Probability of coincidental clustering among the orbits of comets, asteroids and meteoroids depends on many factors like: the size of the orbital sample searched for clusters or the size of the identified group, it is different for groups…
We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…