Related papers: Random subcomplexes and Betti numbers of random ed…

We asymptotically estimate from above the expected Betti numbers of random real hypersurfaces in smooth real projective manifolds. Our upper bounds grow as the square root of the degree of the hypersurfaces as the latter grows to infinity,…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…

We study the almost complete intersection ring $R$ defined by $n+1$ general quadrics in a polynomial ring in $n$ variables over a field $\sf{k}$ and a corresponding linked Gorenstein ring $A$. The overarching theme is that, while not Koszul…

We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.

For an ideal $I$ in a regular local ring or a graded ideal $I$ in the polynomial ring we study the limiting behavior of the Betti numbers of S/I^k as k goes to infinity. By Kodiyalam's result it is known that in each homological degree the…

We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points…

Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…

The asymptotic behavior of graded Betti numbers of powers of homogeneous ideals in a polynomial ring over a field has recently been reviewed. We extend quasi polynomial behavior of graded Betti numbers of powers of homogenous ideals to…

We investigate the structure and properties of symmetric ideals generated by general forms in the polynomial ring under the natural action of the symmetric group. This work significantly broadens the framework established in our earlier…

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

Let $G$ be a finitely generated abelian group, and let $S = A[x_1, ..., x_n]$ be a $G$-graded polynomial ring over a commutative ring $A$. Let $I_1, ..., I_s$ be $G$-homogeneous ideals in $S$, and let $M$ be a finitely generated $G$-graded…

We present a novel theoretical framework connecting k-component edge connectivity with spectral graph theory and homology theory to pro vide new insights into the resilience of real-world networks. By extending classical edge connectivity…

Let S be a polynomial algebra over a field. If I is the edge ideal of a perfect semiregular tree, then we give precise formulas for values of depth, Stanley depth, projective dimension, regularity and Krull dimension of S/I.

Let $(R,\mathfrak{m},k)$ be a Noetherian local ring and let $M$ be a finitely generated $R$-module. The main focus of this paper is to give positive answers for some long-standing homological conjectures over the idealization ring $R\ltimes…

We consider the random clique complex process - the process of clique complexes induced by the complete graph with i.i.d. Uniform edge weights. We investigate the evolution of the Betti numbers of the clique complex process in the critical…

Let $G$ be a finite simple graph on $n$ vertices and set $R=\Bbbk[x_1,\dots,x_n]$, with edge ideal $I(G)$ and cover ideal $J(G)$. We give an explicit description of the $h$-polynomial of $R/J(G)$, in a form that extends to the Alexander…

These lectures provide an informal introduction into the notions and tools used to analyze statistical properties of eigenvalues of large random Hermitian matrices. After developing the general machinery of orthogonal polynomial method, we…

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…