Related papers: Generalized degrees and densities for families of …

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…

We prove that for an irreducible representation $\tau:GL(n)\to GL(W)$, the associated homogeneous ${\bf P}_k^n$-vector bundle $W_{\tau}$ is strongly semistable when restricted to any smooth quadric or to any smooth cubic in ${\bf P}_k^n$,…

We introduce the concept of a hyperuniformity disorder length that controls the variance of volume fraction fluctuations for randomly placed windows of fixed size. In particular, fluctuations are determined by the average number of…

We state conditions under which the set S(k) of k-rational points on a del Pezzo surface S of degree 1 over an infinite field k of characteristic not equal to 2 or 3 is Zariski dense. For example, it suffices to require that the elliptic…

We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…

Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…

We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…

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. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$.…

The tensor power of the clique on $t$ vertices (denoted by $K_t^n$) is the graph on vertex set $\{1, ..., t\}^n$ such that two vertices $x, y \in \{1, ..., t\}^n$ are connected if and only if $x_i \neq y_i$ for all $i \in \{1, ..., n\}$.…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

We prove the density hypothesis for congruence subgroups of an irreducible uniform lattice in $\mathrm{PSL}_2(\mathbb{R})^d$, extending previous results on the spherical density hypothesis to bound multiplicities of non-tempered…

Given a finite poset $P$, we consider the largest size $\lanp$ of a family $\F$ of subsets of $[n]:=\{1,...,n\}$ that contains no subposet $P$. This continues the study of the asymptotic growth of $\lanp$; it has been conjectured that for…

We consider the local eigenvalue distribution of large self-adjoint $N\times N$ random matrices $\mathbf{H}=\mathbf{H}^*$ with centered independent entries. In contrast to previous works the matrix of variances $s_{ij} = \mathbb{E}\,…

A $ B_h $ set (or Sidon set of order $ h $) in an Abelian group $ G $ is any subset $ \{b_0, b_1, \ldots,b_{n}\} $ of $ G $ with the property that all the sums $ b_{i_1} + \cdots + b_{i_h} $ are different up to the order of the summands.…

We clarify the meaning of spatial densities of hadrons. A physical density is given by the expectation value of a local operator for a physical state, and depends on both internal structure and the hadron's wave packet. In some particular…

Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under…

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

In Theorem 1 of Acta Arith. 99 (2001), 321-329, Cobeli and Zaharescu give a result about the distribution of the ${\bf F}_p$-points on an affine curve. An easy corollary to their theorem is that the set $\bigcup_p \lbrace (\frac{x_1}{p},…

In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $k\in \mathbb{N}$ such that any $g\in G$…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…