Related papers: Combinatorial Morse flows are hard to find

Morse decompositions partition the flows in a vector field into equivalent structures. Given such a decomposition, one can define a further summary of its flow structure by what is called a connection matrix.These matrices, a generalization…

We introduce a new `geometric realization' of an (abstract) simplicial complex, inspired by probability theory. This space (and its completion) is a metric space, which has the right (weak) homotopy type, and which can be compared with the…

We introduce the \emph{Morse ensemble polynomial} $\ME_K(z_0,\ldots,z_d)$ of a finite simplicial complex $K$, defined as the generating function $\ME_K = \sum_M \prod_i z_i^{c_i(M)}$ over all acyclic matchings $M$ on the face poset of $K$,…

We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

In this paper we develop an approach to conformal geometry of piecewise flat metrics on manifolds. In particular, we formulate the combinatorial Yamabe problem for piecewise flat metrics. In the case of surfaces, we define the combinatorial…

Let $M_n$ be an $n\times n$ signed random combinatorial matrix whose rows are independent and uniformly distributed over the set of $\{-1,0,1\}$-vectors with exactly $n/2$ zero coordinates. Despite the dependence induced by the row…

Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…

In this article, we present a short, non-exhaustive study of an important and well-known property of combinatorial sequences - unimodality. We shall have a look at a sample of classical results on unimodality and related properties, and…

We formulate a variational fictitious-time flow which drives an initial guess torus to a torus invariant under given dynamics. The method is general and applies in principle to continuous time flows and discrete time maps in arbitrary…

We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof…

For a stationary Poisson hyperplane tessellation $X$ in ${\mathbb R}^d$, whose directional distribution satisfies some mild conditions (which hold in the isotropic case, for example), it was recently shown that with probability one every…

Eight combinatorial identities are listed and proved by counting paths in the one-dimensional random walk. Four of these identities are assumed to be new.

Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such problem is maximum clique which -- under standard assumptions in complexity theory -- cannot be solved in…

In this paper, we present our general results about traversing flows on manifolds with boundary in the context of the flows on surfaces with boundary. We take advantage of the relative simplicity of $2D$-worlds to explain and popularize our…

We construct random Morse functions on surfaces by random walk and compute related distributions. We study the space of Morse functions through these random variables. We consider subspaces characterized by the surfaces with boundary…

We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}ev, Morrison and the second author. Moreover, we prove that any large system containing such a…

In this paper, we study Forman's discrete Morse theory in the context of weighted homology. We develop weighted versions of classical theorems in discrete Morse theory. A key difference in the weighted case is that simplicial collapses do…

In chaotic dynamical systems, a number of rare trajectories with low level of chaoticity are embedded in chaotic sea, while extraordinary unstable trajectories can exist even in weakly chaotic regions. In this study, a quantitative method…