Related papers: Generalized degrees and densities for families of …

For a family $\mathcal{F}$ of subsets of [n]=\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a…

Given a poset $P$, a family $F$ of elements in the Boolean lattice is said to be $P$-saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$ contains a copy of $P$ as a subposet. The maximum size of a…

A family of sets is said to be \emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, Erd\H{o}s raised the problem of determining the maximum possible size of a union of $r$ different intersecting families of…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straight-line edges and assign each edge to a layer so that no two edges on the same layer cross. The…

Let G be a totally disconnected, locally compact group. A closed subgroup of G is locally normal if its normaliser is open in G. We begin an investigation of the structure of the family of closed locally normal subgroups of G. Modulo…

The obstruction to the local-global principle for a hermitian lattice (L, H) can be quantified by computing the mass of (L, H). The mass formula expresses the mass of (L, H) as a product of local factors, called the local densities of (L,…

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

Let $La(n,P)$ be the maximum size of a family of subsets of $[n]= \{1,2, ..., n \}$ not containing $P$ as a (weak) subposet, and let $h(P)$ be the length of a longest chain in $P$. The best known upper bound for $La(n,P)$ in terms of $|P|$…

We consider a general class of $N\times N$ random matrices whose entries $h_{ij}$ are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous…

Given a parameter dependent fixed point equation $x = F(x,u)$, we derive an abstract compactness principle for the fixed point map $u \mapsto x^*(u)$ under the assumptions that (i) the fixed point equation can be solved by the contraction…

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes, for which purpose a number of centrality measures have…

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

We analyse the local geometric structure of self-similar sets with open set condition through the study of the properties of a distinguished family of spherical neighbourhoods, the typical balls. We quantify the complexity of the local…

By studying the volume of a generalized difference body, this paper presents the first nontrivial lower bound for the lattice covering density by $n$-dimensional simplices.

We introduce a nonparametric way to estimate the global probability density function for a random persistence diagram. Precisely, a kernel density function centered at a given persistence diagram and a given bandwidth is constructed. Our…

We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…

Given a semigroup $S$, for each Green's relation $\mathcal{K}\in\{\mathcal{L},\mathcal{R},\mathcal{J},\mathcal{H}\}$ on $S,$ the $\mathcal{K}$-height of $S,$ denoted by $H_{\mathcal{K}}(S),$ is the height of the poset of…

An open neighbourhood locating-dominating set is a set $S$ of vertices of a graph $G$ such that each vertex of $G$ has a neighbour in $S$, and for any two vertices $u,v$ of $G$, there is at least one vertex in $S$ that is a neighbour of…