Related papers: Erd\H{o}s-Ulam ideals vs. simple density ideals
We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
Estimated density is often interpreted as indicating how typical a sample is under a model. Yet deep models trained on one dataset can assign higher density to simpler out-of-distribution (OOD) data than to in-distribution test data. We…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…
We continue the study of the rich family of norm-closed, automorphism invariant ideals of a continuous nest algebra. First we present a unified framework which captures all stable ideals as the kernels of limits of diagonal compressions. We…
Given an ideal $I$ on $\omega$ let $a(I) $ ($\bar{a}(I)$) be minimum of the cardinalities of infinite (uncountable) maximal $I$-almost disjoint subsets of $[{\omega}]^{\omega}$, and denote $b_I$ and$d_I$ the unbounding and dominating…
We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph $G$ with average degree $\bar d$ is $\Omega(\bar{d}^{-1/2})$, under some mild assumptions on the degree sequence of $G$. The lower bound…
We work with a pre-$\lambda$-frame, which is an abstract elementary class (AEC) endowed with a collection of basic types and a non-forking relation satisfying certain natural properties with respect to models of cardinality $\lambda$. We…
A squarefree monomial ideal is called an $f$-ideal if its Stanley-Reisner and facet simplicial complexes have the same $f$-vector. We show that $f$-ideals generated in a fixed degree have asymptotic density zero when the number of variables…
In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all…
Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…
The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…
In 2012, K. Matsuda introduced the class of weakly closed graphs and investigated when binomial edge ideals are F-pure. He proved that weakly closed binomial edge ideals are F-pure whenever the base field has positive characteristic. He…
Consider the characteristic initial value problem for the Einstein vacuum equations without any symmetry assumptions. Impose a sequence of data on two intersecting null hypersurfaces, each of which is foliated by spacelike $2$-spheres.…
Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…
The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes.…
The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…
In this paper we define and study the classical Uniform Electron Gas (UEG), a system of infinitely many electrons whose density is constant everywhere in space. The UEG is defined differently from Jellium, which has a positive constant…