Related papers: Good Bounds in Certain Systems of True Complexity …

We consider evaluating improper priors in a formal Bayes setting according to the consequences of their use. Let $\Phi$ be a class of functions on the parameter space and consider estimating elements of $\Phi$ under quadratic loss. If the…

A graph property is a function $\Phi$ that maps every graph to {0, 1} and is invariant under isomorphism. In the $\#IndSub(\Phi)$ problem, given a graph $G$ and an integer $k$, the task is to count the number of $k$-vertex induced subgraphs…

Let $\Phi$ be a random $k$-CNF formula on $n$ variables and $m$ clauses, where each clause is a disjunction of $k$ literals chosen independently and uniformly. Our goal is to sample an approximately uniform solution of $\Phi$ (or…

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

We examine multidimensional polynomial progressions involving linearly independent polynomials in finite fields, proving power saving bounds for sets lacking such configurations. This jointly generalises earlier results of Peluse (for the…

Let $\Phi$ be a $C^{1+\gamma}$ smooth IFS on $\mathbb{R}$, where $\gamma>0$. We provide mild conditions on the derivative cocycle that ensure that every self conformal measure is supported on points $x$ that are absolutely normal. That is,…

Let $\varphi$ be a plurisubharmonic function defined in a neighborhood of the origin in $\mathbb C^n$. For each real number $t>-n$, we associate to $\varphi$ the weighted log canonical threshold \[ c_t(\varphi):=\sup\Bigl\{c\geq…

For $p\ge 1$ let $\varphi_p(x)=x^2/2$ if $|x|\le 1$ and $\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\xi$ let $\tau_{\varphi_p}(\xi)$ denote $\inf\{a\ge 0:\;\forall_{\lambda\in\mathbb{R}}\;…

Given sets $X,Y$ and a regular cardinal $\mu$, let $\Phi(X,Y,\mu)$ be the statement that for any function $f : X \times Y \to \mu$, there are functions $g_1 : X \to \mu$ and $g_2 : Y \to \mu$ such that or all $(x,y) \in X \times Y$,…

In this paper we investigate the uniform distribution properties of polynomials in many variables and bounded degree over a fixed finite field F of prime order. Our main result is that a polynomial P : F^n -> F is poorly-distributed only if…

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

In this work, we show that the sample complexity required in quantum learning theory within a general parametric framework, is fundamentally governed by the inverse Fisher information matrix. More specifically, we derive upper and lower…

We study norm-based uniform convergence bounds for neural networks, aiming at a tight understanding of how these are affected by the architecture and type of norm constraint, for the simple class of scalar-valued one-hidden-layer networks,…

We study the problem of learning nonparametric distributions in a finite mixture, and establish tight bounds on the sample complexity for learning the component distributions in such models. Namely, we are given i.i.d. samples from a pdf…

In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence…

It is known that if $p$ is a sufficiently large prime then for every function $f:\mathbb{Z}_p\to [0,1]$ there exists a continuous function on the circle $f':\mathbb{T}\to [0,1]$ such that the averages of $f$ and $f'$ across any prescribed…

Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…

We show that for any positive integer $d$, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function…

A hereditary class H of graphs is $\chi$-bounded if there is a $\chi$-binding function f such that for every $G$ in $H$, $\chi(G)$ less than or equal to $f(\omega(G))$. Here we prove that if a graph $G$ is free of 1. {Chair; P$_4$+K$_1$} or…