Related papers: On The Morse Ensemble Polynomial Of Simplicial Com…

We consider a finite simplicial complex $K$ together with its successive barycentric subdivisions $Sd^d(K), d\geq0,$ and study the expected topology of a random subcomplex in $Sd^d(K), d\gg0$. We get asymptotic upper and lower bounds for…

For each partition $\tau$ of $N$ there are irreducible modules of the symmetric groups $\mathcal{S}_{N}$ or the corresponding Hecke algebra $\mathcal{H}_{N}\left( t\right) $ whose bases consist of reverse standard Young tableaux of shape…

The symmetric group acts on polynomial differential forms on $\mathbb{R}^{n}$ through its action by permuting the coordinates. In this paper the $S_{n}% $-invariants are shown to be freely generated by the elementary symmetric polynomials…

We consider orthogonal polynomials with respect to a linear differential operator $$\mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\{\rho_k\}_{k=0}^{M}$ are complex polynomials such that $deg[\rho_k]\leq k, 0\leq k…

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…

As part of a program to develop $K$-theoretic analogues of combinatorially important polynomials, Monical, Pechenik, and Searles (2021) proved two expansion formulas $\overline{\mathfrak{A}}_a = \sum_b Q_b^a(\beta)\overline{\mathfrak{P}}_b$…

The generalized Rosenzweig-Porter model with real (GOE) off-diagonal entries arguably constitutes the simplest random matrix ensemble displaying a phase with fractal eigenstates, which we characterize here by using replica methods. We first…

We establish a cosymplectic counterpart of Banyaga's theorem by proving that the group of weakly Hamiltonian diffeomorphisms, $\Ham_{\eta,\omega}(M)$, is simple on any closed cosymplectic manifold. A key structural result, derived from Lie…

Let G be a torus of dimension n > 1 and M a compact Hamiltonian G-manifold with $M^G$ finite. A circle, $S^1$, in G is generic if $M^G = M^{S^1}$. For such a circle the moment map associated with its action on M is a perfect Morse function.…

We study transformations between discrete Morse functions on a finite simplicial complex via birth-death transitions--elementary chain maps between discrete Morse complexes that either create or cancel pairs of critical simplices. We prove…

Let $K$ be a finite simplicial complex, let $g\colon K\to K$ be a simplicial map and let $f$ be a discrete Morse-Bott function on $K$ satisfying $f(g(\sigma))\leq f(\sigma)$ for all simplices $\sigma$ in $K$. We establish a set of…

Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated quantum many-particle systems. For the simplest spinless fermion (or boson) systems with say $m$ fermions (or bosons) in $N$ single…

We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…

The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…

Theta series for exceptional groups have been suggested as a possible description of the eleven-dimensional quantum supermembrane. We present explicit formulae for these automorphic forms whenever the underlying Lie group $G$ is split (or…

In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…

Let $G$ be a simply connected semisimple algebraic group over $\mathbb{C}$ and let $\rho :G\rightarrow GL(V_\lambda)$ be an irreducible representation of highest weight $\lambda$. Suppose that $\rho$ has finite kernel. Springer defined…

The cell complex structure is one of the most fundamental structures in topology and combinatorics, the Morse decomposition of a dynamical system analyzes the global gradient behavior, and the Reeb graph of a function is an elementary tool…

The eigenvalue probability density function for symplectic invariant random matrix ensembles can be generalised to discrete settings involving either a linear or exponential lattice. The corresponding correlation functions can be expressed…

We proved that for any finite collection of sparse subgraphs $(D_m)_{m=1}^\ell$ of the complete graph $K_{2n}$, and a uniformly chosen perfect matching $R$ in $K_{2n}$, the random vector $(|E(R \cap D_m)|)_{m=1}^\ell$ jointly converges to a…