English
Related papers

Related papers: Generalized degrees and densities for families of …

200 papers

Let G be a graph with maximum degree \Delta whose vertex set is partitioned into parts V(G) = V_1 \cup ... \cup V_r. A transversal is a subset of V(G) containing exactly one vertex from each part V_i. If it is also an independent set, then…

Combinatorics · Mathematics 2007-06-15 Po-Shen Loh , Benny Sudakov

Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid…

Number Theory · Mathematics 2022-08-09 Abhishek Jha

The Union-Closed Sets Conjecture asks whether every union-closed set family $\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in…

Combinatorics · Mathematics 2025-07-15 Shagnik Das , Saintan Wu

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point.…

Combinatorics · Mathematics 2023-09-11 Angela Aguglia , Bence Csajbók , Zsuzsa Weiner

We let $\mathcal{F}$ be a finite family of sets closed under taking unions and $\emptyset \not \in \mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\mathcal{F}$. In this notation, the classical…

Combinatorics · Mathematics 2023-05-31 Adam Kabela , Michal Polák , Jakub Teska

In this paper, we study product-free subsets of the free semigroup over a finite alphabet $A$. We prove that the maximum density of a product-free subset of the free semigroup over $A$, with respect to the natural measure that assigns a…

Combinatorics · Mathematics 2018-12-13 Imre Leader , Shoham Letzter , Bhargav Narayanan , Mark Walters

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

Combinatorics · Mathematics 2007-05-23 Jaroslav Nesetril , Patrice Ossona De Mendez

Recently, the notion of visibility from the origin has been generalized by viewing lattice points through curved lines of sights, where the family of curves considered are $y=mx^k$, $k\in\mathbb{N}$. In this note, we generalize the notion…

Number Theory · Mathematics 2021-09-20 Sneha Chaubey , Ashish Kumar Pandey

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

Functional Analysis · Mathematics 2026-03-20 M N N Namboodiri

Let $G$ be a connected Lie group. In this paper, we study the density of the images of individual power maps $P_k:G\to G:g\mapsto g^k$. We give criteria for the density of $P_k(G)$ in terms of regular elements, as well as Cartan subgroups.…

Group Theory · Mathematics 2017-01-03 Saurav Bhaumik , Arunava Mandal

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

Classical Analysis and ODEs · Mathematics 2019-01-08 Ben Krause

Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…

Logic · Mathematics 2022-09-12 Johanna N. Y. Franklin , Meng-Che "Turbo" Ho , Julia Knight

Let $D$ be the ring of $S$-integers in a global field and $\hat{D}$ its profinite completion. We discuss the relation between density in $D$ and the Haar measure of $\hat{D}$: in particular, we ask when the density of a subset $X$ of $D$ is…

Number Theory · Mathematics 2023-12-14 Luca Demangos , Ignazio Longhi

We establish that for q>=1, the class of convex combinations of q translates of a smooth probability density has local doubling dimension proportional to q. The key difficulty in the proof is to control the local geometric structure of…

Statistics Theory · Mathematics 2015-02-04 Elisabeth Gassiat , Ramon Van Handel

We provide a local probabilistic description of the limiting statistics of large preferential attachment trees in terms of the ordinary degree (number of neighbors) but augmented with information on leafdegree (number of neighbors that are…

Statistical Mechanics · Physics 2026-02-03 Harrison Hartle , P. L. Krapivsky

Let K\subset R^N be any convex body containing the origin. A measurable set G\subset R^N with finite and positive Lebesgue measure is said to be K-dense if, for any fixed r>0, the measure of G\cap (x+r K) is constant when x varies on the…

Metric Geometry · Mathematics 2013-08-07 Rolando Magnanini , Michele Marini

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…

Combinatorics · Mathematics 2022-09-07 József Balogh , William B. Linz , Balázs Patkós

Let $\mathcal{F}$ be a family of subsets of $[n]=\{1,\ldots,n\}$ and let $L$ be a set of nonnegative integers. The family $\mathcal{F}$ is \emph{$L$-intersecting} if $|F\cap F'|\in L$ for every two distinct members $F,F'\in\mathcal{F}$; and…

Combinatorics · Mathematics 2018-11-29 Yandong Bai , Binlong Li , Jiuqiang Liu , Shenggui Zhang

We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…

Information Theory · Computer Science 2009-04-07 Shachar Lovett
‹ Prev 1 4 5 6 7 8 10 Next ›