English
Related papers

Related papers: Properties of simple density ideals

200 papers

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…

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. The forcing number $f(G,M)$ of a perfect matching $M$ of $G$ is the smallest cardinality of a subset of $M$ that is contained in no other perfect matching of $G$. Among…

Combinatorics · Mathematics 2022-11-23 Qian qian Liu , He ping Zhang

Let G be a reductive group over a commutative ring R. We say that G has isotropic rank >=n, if every normal semisimple reductive R-subgroup of G contains (G_m)^n. We prove that if G has isotropic rank >=1 and R is a regular domain…

K-Theory and Homology · Mathematics 2018-08-02 Anastasia Stavrova

An ideal $I$ is a family of subsets of positive integers $\textbf{N}$ which is closed under taking finite unions and subsets of its elements. A sequence $(x_n)$ of real numbers is said to be $I$-convergent to a real number $L$, if for each…

General Mathematics · Mathematics 2012-03-12 Huseyin Cakalli , Bipan Hazarika

Let F be a finite union-closed family of sets whose largest set contains n elements. In \cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all…

Combinatorics · Mathematics 2011-06-03 Igor Balla

Given a polynomial f(z) = z^d + c over a global field K and a_0 in K, we study the density of prime ideals of K dividing at least one element of the orbit of a_0 under f. The density of such sets for linear polynomials has attracted much…

Number Theory · Mathematics 2015-08-18 Spencer Hamblen , Rafe Jones , Kalyani Madhu

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

Combinatorics · Mathematics 2025-10-28 Kieran Bhaskara , Michael Y. C. Chong , Takayuki Hibi , Naveena Ragunathan , Adam Van Tuyl

Let $\Omega\subset{\mathbb R}^n$ be a relatively compact domain. A finite collection of real-valued functions on $\Omega$ is called a \emph{Noetherian chain} if the partial derivatives of each function are expressible as polynomials in the…

Number Theory · Mathematics 2017-04-04 Gal Binyamini

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}$…

Commutative Algebra · Mathematics 2025-05-21 Parangama Sarkar

Given an i.i.d. sample drawn from a density $f$, we propose to test that $f$ equals some prescribed density $f_0$ or that $f$ belongs to some translation/scale family. We introduce a multiple testing procedure based on an estimation of the…

Statistics Theory · Mathematics 2016-08-16 Magalie Fromont , Béatrice Laurent

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

Combinatorics · Mathematics 2026-05-12 Chun-Hung Liu

For a family $\mathcal{F}$ of graphs, $sat(n,\mathcal{F})$ is the minimum number of edges in a graph $G$ on $n$ vertices which does not contain any of the graphs in $\mathcal{F}$ but such that adding any new edge to $G$ creates a graph in…

Combinatorics · Mathematics 2024-01-22 Asier Calbet , Andrea Freschi

Given any dimension function $h$, we construct a perfect set $E \subseteq \mathbb{R}$ of zero $h$-Hausdorff measure, that contains any finite polynomial pattern. This is achieved as a special case of a more general construction in which we…

Classical Analysis and ODEs · Mathematics 2020-02-19 Ursula Molter , Alexia Yavicoli

A perfect Italian dominating function of a graph $G=(V,E)$ is a function $f : V \to \{0,1,2\}$ such that for every vertex $f(v) = 0$, it holds that $\sum_{u \in N(v)} f(u) = 2$, i.e., the weight of the labels assigned by $f$ to the…

Discrete Mathematics · Computer Science 2020-05-29 Juho Lauri , Christodoulos Mitillos

Given an infinite topological group G and a cardinal k>0, we say that G is almost k-free if the set of k-tuples in G^k which freely generate free subgroups of G is dense in G^k. In this note we examine groups having this property and…

Group Theory · Mathematics 2011-10-05 Zachary Mesyan

Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…

Commutative Algebra · Mathematics 2007-05-23 J. Migliore , R. M. Miró-Roig

The "extremal function" $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing $H$ as a minor, where the "density" of a graph $G$ is the ratio of the number of edges to the number of vertices. Myers and Thomason (2005),…

Combinatorics · Mathematics 2022-07-25 Kevin Hendrey , Sergey Norin , David R. Wood

Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…

Combinatorics · Mathematics 2020-07-23 Hiroki Kajiura , Makoto Matsumoto , Takayuki Okuda

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

The purpose of this Ph.D. thesis is to study and classify primitive ideals of the enveloping algebras $U(\mathfrak{o}(\infty))$ and $U(\mathfrak{sp}(\infty))$. Let $\mathfrak{g}(\infty)$ denote any of the Lie algebras $\mathfrak{o}(\infty)$…

Representation Theory · Mathematics 2020-01-14 Aleksandr Fadeev
‹ Prev 1 8 9 10 Next ›