Related papers: Erd\H{o}s-Ulam ideals vs. simple density ideals

This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065--1092]. For an ideal $\mathcal{I}$ on $\omega$ we denote $\mathcal{D}_{\mathcal{I}}=\{f\in\omega^\omega: f^{-1}[\{n\}]\in\mathcal{I} \text{ for every $n\in \omega$}\}$ and…

We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…

Under the generalized Riemann Hypothesis (GRH), Baluyot, Chandee, and Li nearly doubled the range in which the density of low lying zeros predicted by Katz and Sarnak is known to hold for a large family of automorphic $L$-functions with…

We define a class of so-called thinnable ideals $\mathcal{I}$ on the positive integers which includes several well-known examples, e.g., the collection of sets with zero asymptotic density, sets with zero logarithmic density, and several…

We investigate some variants of the splitting, reaping, and independence numbers defined using asymptotic density. Specifically, we give a proof of Con($\mathfrak{i}<\mathfrak{s}_{1/2}$), Con($\mathfrak{r}_{1/2}<\mathfrak{b}$) and…

In this article, we introduce a relation including ideals of an evolution algebra and hereditary subsets of vertices of its associated graph and establish some properties among them. This relation allows us to determine maximal ideals and…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

One of the main obstacle to study compactness in topological spaces via ideals was the definition of ideal convergence of subsequences as in the existing literature according to which subsequence of an ideal convergent sequence may fail to…

For c in [0,1] let P_n(c) denote the set of n-vertex perfect graphs with density c and C_n(c) the set of n-vertex graphs without induced C_5 and with density c. We show that log|P_n(c)|/binom{n}{2}=log|C_n(c)|/binom{n}{2}=h(c)+o(1) with…

Chebotarev's density theorem asserts that the prime ideals are equidistributed among the conjugacy classes of the Galois group of any normal extension of number fields. An effective version of this theorem was first established by Lagarias…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

The theory of regular model sets is highly developed, but does not cover examples such as the visible lattice points, the k-th power-free integers, or related systems. They belong to the class of weak model sets, where the window may have a…

A $k$-uniform family of subsets of $[n]$ is intersecting if it does not contain a disjoint pair of sets. The study of intersecting families is central to extremal set theory, dating back to the seminal Erd\H{o}s-Ko-Rado theorem of 1961 that…

G. Debs and J. Saint Raymond in 2009 defined the Borel separation rank of an analytic ideal $\mathcal{I}$ ($\text{rk}(\mathcal{I})$) as minimal ordinal $\alpha<\omega_{1}$ such that there is $\mathcal{S}\in\bf{\Sigma^0_{1+\alpha}}$ with…

We introduce the following combinatorial problem. Let $G$ be a triangle-free regular graph with edge density $\rho$. What is the minimum value $a(\rho)$ for which there always exist two non-adjacent vertices such that the density of their…

Let $\mathcal{E}_n$ be the ring of the germs of $\mathcal{C}^\infty$-functions at the origin in $\R^n$. It is well known that if $I$ is an ideal of $\mathcal{E}_n$, generated by a finite number of germs of analytic functions, then $I$ is…

In this article, we extend the notion of multiplicity for weakly graded families of ideals which are bounded below linearly. In particular, we show that the limit $e_W(\mathfrak{I}):=\lim\limits_{n\to\infty}d!\frac{\ell_R(R/I_n)}{n^d}$…

We consider the edge-triangle model (or Strauss model), and focus on the asymptotic behavior of the triangle density when the size of the graph increases to infinity. This random graph belongs to the class of exponential random graphs,…

We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities.…

Let $R$ be a commutative ring and ${\Bbb{A}}(R)$ be the set of ideals with non-zero annihilators. The annihilating-ideal graph of $R$ is defined as the graph ${\Bbb{AG}}(R)$ with the vertex set ${\Bbb{A}}(R)^*={\Bbb{A}}\setminus\{(0)\}$ and…