Related papers: Evasion and prediction II

We prove universal lower bounds for discrepancies (i.e. sizes of spectral gaps of averaging operators) of measure-preserving actions of a locally compact group on probability spaces. For example, a locally compact Hausdorff unimodular group…

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

We prove Rump's 100-euro conjecture by deriving a weighted affine escape theorem from Ball's plank theorem in [Invent. Math. \textbf{104} (1991)]. More precisely, let $\mathbb{K}\in\{\mathbb{R},\mathbb{C}\}$ and let $A\in\mathbb{K}^{n\times…

We show that unitary representations of simply connected, semisimple algebraic groups over local fields of characteristic zero obey a spectral gap absorption principle: that is, that spectral gap is preserved under tensor products. We do…

Let $G$ be a locally compact group and $\mu$ a probability measure on $G,$ which is not assumed to be absolutely continuous with respect to Haar measure. Given a unitary representation $(\pi, \cal H)$ of $G,$ we study spectral properties of…

Consider integers $k,\ell$ such that $0\le \ell \le \binom{k}2$. Given a large graph $G$, what is the fraction of $k$-vertex subsets of $G$ which span exactly $\ell$ edges? When $G$ is empty or complete, and $\ell$ is zero or…

We give a very simple and elementary proof of the existence of a weakly compact family of probability measures $\{P_{\theta}:\theta \in \Theta \}$ to represent an important sublinear expectation--G-expectation $\mathbb{E}[\cdot]$. We also…

The \emph{genus} $\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$. A drawing of a graph on a surface is \emph{independently even} if every pair of nonadjacent…

Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of…

We prove a new inequality bounding the probability that the random walk on a group has small total displacement in terms of the spectral and isoperimetric profiles of the group. This inequality implies that if the random walk on the group…

Lov\'{a}sz proved that two graphs $G$ and $H$ are isomorphic if $\hom(K,G) = \hom(K,H)$ for all graphs $K$, where $\hom(G_1,G_2)$ denotes the number of homomorphisms from $G_1$ to $G_2$. Dvo\v{r}\'{a}k showed that it suffices to count…

Let $\mathcal{I}$ be an ideal on $\omega$. For $f,g\in\omega^\omega$ we write $f \leq_{\mathcal{I}} g$ if $f(n) \leq g(n)$ for all $n\in\omega\setminus A$ with some $A\in\mathcal{I}$. Moreover, we denote…

We consider the ordinary category Span(C) of (isomorphism classes of) spans of morphisms in a category C with finite limits as needed, composed horizontally via pullback, and give a general criterion for a quotient of Span(C) to be an…

In calculations of the elementary scalar spectra of spontaneously broken gauge theories there is a number of subtleties which, though often unnecessary to deal with in the order-of-magnitude type of calculations, have to be taken into…

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group $G$, denoted $\mathfrak{s}(G)$, is the smallest $k\in\mathbb{N}$ such that any sequence of elements of $G$ of length $k$ contains a zero-sum subsequence of length $\exp(G)$. In this…

An increasing number of observations of the outer regions of globular clusters (GCs) have shown a flattening of the velocity dispersion profile and an extended surface density profile. Formation scenarios of GCs can lead to different…

A fractional matching of $G$ is a function $f: E(G)\to [0,1]$ such that $\sum_{e\in E_G(v_i)}f(e)\le 1$ for any $v_i\in V(G)$, where $E_G(v_i)=\{e: e\in E(G) \ \textrm{and}\ e \ \textrm{is incident with} \ v_i\}$. Let $\alpha_f(G)$ denote…

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that…

We investigate the group irregularity strength ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge labels at…

The anti-Kekul\'{e} number of a connected graph $G$ is the smallest number of edges whose deletion results in a connected subgraph having no Kekul\'{e} structures (perfect matchings). As a common generalization of (conditional) matching…