Related papers: On The Morse Ensemble Polynomial Of Simplicial Com…
Given a compact manifold with a non-empty boundary and equipped with a generic Morse function (that is, no critical point on the boundary and the restriction to the boundary is a Morse function), we already knew how to construct two Morse…
A recursion due to Kook expresses the Laplacian eigenvalues of a matroid M in terms of the eigenvalues of its deletion M-e and contraction M/e by a fixed element e, and an error term. We show that this error term is given simply by the…
The ordinary generating function of the number of complete subgraphs (cliques) of $G$, denoted by $C(G,x)$, is called the The clique polynomial of the graph $G$. In this paper, we first introduce some \emph{clique} incidence matrices…
The connection zeta function of a finite abstract simplicial complex G is defined as zeta_L(s)=sum_x 1/lambda_x^s, where lambda_x are the eigenvalues of the connection Laplacian L defined by L(x,y)=1 if x and y intersect and 0 else. (I) As…
We study the $k$-th nearest neighbor distance function from a finite point-set in $\mathbb{R}^d$. We provide a Morse theoretic framework to analyze the sub-level set topology. In particular, we present a simple combinatorial-geometric…
On symplectic manifolds, we introduce a Morse-type complex with elements generated by pairs of critical points of a Morse function. The differential of the complex consists of gradient flows and an integration of the symplectic structure…
We generalize and extend the Conley-Morse-Forman theory for combinatorial multivector fields introduced in \cite{Mr2017}. The generalization consists in dropping the restrictive assumption in \cite{Mr2017} that every multivector has a…
Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…
We construct an equivariant version of discrete Morse theory for simplicial complexes endowed with group actions. The key ingredient is a 2-categorical criterion for making acyclic partial matchings on the quotient space compatible with an…
The mesh matrix $Mesh(G,T_0)$ of a connected finite graph $G=(V(G),E(G))=(vertices, edges) \ of \ G$ of with respect to a choice of a spanning tree $T_0 \subset G$ is defined and studied. It was introduced by Trent \cite{Trent1,Trent2}. Its…
A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…
The independence complex of a graph $G=(V,E)$ is the simplicial complex $I(G)$ on vertex set $V$ whose simplices are the independent sets in $G$. We present new lower bounds on the eigenvalues of the $k$-dimensional Laplacian $L_k(I(G))$ in…
In this article we establish the asymptotic behavior of generating functions related to the exponential sum over finite fields of elementary symmetric functions and their perturbations. This asymptotic behavior allows us to calculate the…
Consider an $M$-th order linear differential operator, $M\geq 2$, $$ \mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\rho_M $ is a monic complex polynomial such that $degree[\rho_M]=M$ and $(\rho_k)_{k=0}^{M-1}$ are…
We compute analytically the joint probability density of eigenvalues and the level spacing statistics for an ensemble of random matrices with interesting features. It is invariant under the standard symmetry groups (orthogonal and unitary)…
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…
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…