Related papers: Spectrum and combinatorics of two-dimensional Rama…
Spectrum is an important numerical invariant of an isolated hypersurface singularity, connecting its topological and analytic structures. The well-known Hertling conjecture tells the relation of range and variance of exponents i.e. elements…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
Hodge Laplacians have been previously proposed as a natural tool for understanding higher-order interactions in networks and directed graphs. Here we introduce a Hodge-theoretic approach to spectral theory and dimensionality reduction for…
Random unimodular lattice triangulations have been recently used as an embedded random graph model, which exhibit a crossover behaviour between an ordered, large-world and a disordered, small-world behaviour. Using the ergodic Pachner flips…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
We survey divisibility properties of the Fourier coefficients of modular functions inspired by Ramanujan. Then using recent results of the generalized Hecke operator on harmonic Maass functions and known divisibility of Fourier coefficients…
Many fundamental structures of Riemannian geometry have found discrete counterparts for graphs or combinatorial ones for simplicial complexes. These include those discussed in this survey, Hodge theory, Morse theory, the spectral theory of…
Complementary Romanovski-Routh polynomials play an important role in extracting specific properties of orthogonal polynomials. In this work, a generalized form of the Complementary Romanovski-Routh polynomials (GCRR) that has the Gaussian…
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges…
The Ramanujan polynomials arise in three intertwined contexts. As remarked by BerndtEvans-Wilson, no combinatorial perspective seems to be alluded to in the original definition of Ramanujan. On a different stage, Dumont-Ramamonjisoa…
Symmetry analysis of Ramanujan's system of differential equations is performed by representing it as a third-order equation. A new system consisting of a second-order and a first-order equation is derived from Ramanujan's system. The Lie…
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…
We define bilateral series related to Ramanujan-like series for $1/\pi^2$. Then, we conjecture a property of them and give some applications.
We consider spectra of $n$-by-$n$ irreducible tridiagonal matrices over a field and of their $n-1$-by-$n-1$ trailing principal submatrices. The real symmetric and complex Hermitian cases have been fully understood: it is necessary and…
A numerical scheme to compute the spectrum of a large class of self-adjoint extensions of the Laplace-Beltrami operator on manifolds with boundary in any dimension is presented. The algorithm is based on the characterisation of a large…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…
We consider a family of compact, oriented and connected Riemannian manifolds shrinking to a metric graph and describe the asymptotic behaviour of the eigenvalues of the Hodge Laplacian. We apply our results to produce manifolds with…
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost…