On BGG resolutions of unitary modules for quiver Hecke and Cherednik algebras

We provide a homological construction of unitary simple modules of Cherednik and Hecke algebras of type A via BGG resolutions, solving a conjecture of Berkesch–Griffeth–Sam. We vastly generalize the conjecture and its solution to cyclotomic Cherednik and Hecke algebras over arbitrary ground fields, and calculate the Betti numbers and Castelnuovo–Mumford regularity of certain symmetric linear subspace arrangements.

Volume and macroscopic scalar curvature

We prove the macroscopic cousins of three conjectures: (1) a conjectural bound of the simplicial volume of a Riemannian manifold in the presence of a lower scalar curvature bound, (2) the conjecture that rationally essential manifolds do not admit metrics of positive scalar curvature, (3) a conjectural bound of $$\ell ^2$$ ℓ 2 -Betti numbers of aspherical Riemannian manifolds in the presence of a lower scalar curvature bound. The macroscopic cousin is the statement one obtains by replacing a lower scalar curvature bound by an upper bound on the volumes of 1-balls in the universal cover.

DETERMINATION OF GALAXY DISTRIBUTION WITH STATISTICAL MOMENTS

In this report we discuss topological studies of large scale structure of the Universe (LSS) from XMM-Newton, Sloan Digital Sky Survey and simulated data of galaxy distribution. Early works in this mentioned field were based on genus statistics, which is averaged curvature of isosurface of smoothed density field. Later, significant number of other methods was developed. This comprise Euler characteristics, Minkowski functionals, Voronoi clustering, alpha shapes, Delanuay tesselation, Morse theory, Hessian matrix and Soneira-Peebles models. In practice, modern topology methods are reducedto calculation of the three Betti numbers which shall be interpreted as a number of galaxy clusters, filaments and voids. Such an approach was applied by different authors both for simulated and observed LSS data. Topology methods are generally verified using LSS simulations. Observational data normally includes SDSS, CFHTLS and other surveys. These data have many systematical and statistical errors and gaps. Furthermore, there is also a problem of underlying dark matter distribution. The situation is not better in relation to calculations of the power spectrum and its power law index which does not provide a clear picture as well. In this work we propose some tools to solve above problems. First, we performed topology description of simple LSS models such as cubic, graphite-like and random Gaussian distribution of matter. Our next idea is to set a task for LSS topology assessment using X-ray observations of the galaxies. Although, here could be a major complication due to current lack of detected high energy emitting galaxies. Nevertheless, we are expecting to get sufficient results in the future encouraging comprehensive X-ray data. Here we present analysis of statistical moments for four galaxy samples and compare them with the behavior of Betti numbers. Finally, we consider the options of applying artificial neural networks to observed galaxies and fill the data deficiency. This shall enable to define topology at least for superimposed superclusters and other LSS elements.

Odd dimensional analogue of the Euler characteristic

When compact manifolds X and Y are both even dimensional, their Euler characteristics obey the Künneth formula χ(X × Y) = χ(X)χ(Y). In terms of the Betti numbers bp(X), χ(X) = Σp(−1)pbp(X), implying that χ(X) = 0 when X is odd dimensional. We seek a linear combination of Betti numbers, called ρ, that obeys an analogous formula ρ(X × Y) = χ(X)ρ(Y) when Y is odd dimensional. The unique solution is ρ(Y) = − Σp(−1)ppbp(Y). Physical applications include: (1) ρ → (−1)mρ under a generalized mirror map in d = 2m + 1 dimensions, in analogy with χ → (−1)mχ in d = 2m; (2) ρ appears naturally in compactifications of M-theory. For example, the 4-dimensional Weyl anomaly for M-theory on X4× Y7 is given by χ(X4)ρ(Y7) = ρ(X4× Y7) and hence vanishes when Y7 is self-mirror. Since, in particular, ρ(Y × S1) = χ(Y), this is consistent with the corresponding anomaly for Type IIA on X4× Y6, given by χ(X4)χ(Y6) = χ(X4× Y6), which vanishes when Y6 is self-mirror; (3) In the partition function of p-form gauge fields, ρ appears in odd dimensions as χ does in even.

Computing cliques and cavities in networks

Complex networks contain complete subgraphs such as nodes, edges, triangles, etc., referred to as simplices and cliques of different orders. Notably, cavities consisting of higher-order cliques play an important role in brain functions. Since searching for maximum cliques is an NP-complete problem, we use k-core decomposition to determine the computability of a given network. For a computable network, we design a search method with an implementable algorithm for finding cliques of different orders, obtaining also the Euler characteristic number. Then, we compute the Betti numbers by using the ranks of boundary matrices of adjacent cliques. Furthermore, we design an optimized algorithm for finding cavities of different orders. Finally, we apply the algorithm to the neuronal network of C. elegans with data from one typical dataset, and find all of its cliques and some cavities of different orders, providing a basis for further mathematical analysis and computation of its structure and function.

Graded Betti Numbers of Balanced Simplicial Complexes

We prove upper bounds for the graded Betti numbers of Stanley-Reisner rings of balanced simplicial complexes. Along the way we show bounds for Cohen-Macaulay graded rings S/I, where S is a polynomial ring and $I\subseteq S$ I ⊆ S is a homogeneous ideal containing a certain number of generators in degree 2, including the squares of the variables. Using similar techniques we provide upper bounds for the number of linear syzygies for Stanley-Reisner rings of balanced normal pseudomanifolds. Moreover, we compute explicitly the graded Betti numbers of cross-polytopal stacked spheres, and show that they only depend on the dimension and the number of vertices, rather than also the combinatorial type.