English
Related papers

Related papers: A structure theorem for Boolean functions with sma…

200 papers

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

Combinatorics · Mathematics 2016-05-17 Anne de Roton

The classical hypercontractive inequality for the noise operator on the discrete cube plays a crucial role in many of the fundamental results in the Analysis of Boolean functions, such as the KKL (Kahn-Kalai-Linial) theorem, Friedgut's…

Combinatorics · Mathematics 2019-06-14 Peter Keevash , Noam Lifshitz , Eoin Long , Dor Minzer

We first provide an approach to the recent conjecture of Bierstone-Milman-Pawlucki on Whitney's old problem on smooth extendability of functions defined on a closed subset of a Euclidean space, using higher order paratangent bundle they…

Classical Analysis and ODEs · Mathematics 2011-02-15 Shuzo Izumi

Let $Z$ be a Boolean model based on a stationary Poisson process $\eta$ of compact, convex particles in Euclidean space ${\mathbb{R}}^d$. Let $W$ denote a compact, convex observation window. For a large class of functionals $\psi$, formulas…

Probability · Mathematics 2016-02-11 Daniel Hug , Günter Last , Matthias Schulte

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

Functional Analysis · Mathematics 2009-12-22 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

Combinatorics · Mathematics 2018-05-09 A. V. Burkin , M. E. Zhukovskii

We present a general theoretical analysis of structured prediction with a series of new results. We give new data-dependent margin guarantees for structured prediction for a very wide family of loss functions and a general family of…

Machine Learning · Statistics 2016-12-02 Corinna Cortes , Mehryar Mohri , Vitaly Kuznetsov , Scott Yang

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…

Numerical Analysis · Mathematics 2015-06-26 Peter Buergisser , Felipe Cucker , Martin Lotz

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

Combinatorics · Mathematics 2021-02-18 Zdeněk Dvořák , Tony Huynh , Gwenaël Joret , Chun-Hung Liu , David R. Wood

This paper shows that $K_t$-minor-free (and $K_{s, t}$-minor-free) graphs $G$ are subgraphs of products of a tree-like graph $H$ (of bounded treewidth) and a complete graph $K_m$. Our results include optimal bounds on the treewidth of $H$…

Combinatorics · Mathematics 2024-11-11 Freddie Illingworth , Alex Scott , David R. Wood

Dujmovi\'{c}, Joret, Micek, Morin, Ueckerdt, and Wood [J. ACM 2020] established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically…

Combinatorics · Mathematics 2021-10-05 Robert Hickingbotham , David R. Wood

Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems…

Combinatorics · Mathematics 2021-06-16 Richard Behr , Vaidy Sivaraman , Thomas Zaslavsky

Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater…

Combinatorics · Mathematics 2012-09-04 Zdenek Dvorak

We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $\gamma^n$, requires $\Theta(n)$…

Computational Complexity · Computer Science 2025-12-10 Shalev Ben-David , Eric Blais

Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…

Group Theory · Mathematics 2025-11-18 Daniele D'Angeli , Francesco Matucci , Davide Perego , Emanuele Rodaro

We find the logarithmic $L_2$-small ball asymptotics for a class of zero mean Gaussian fields with covariances having the structure of "tensor product". The main condition imposed on marginal covariances is slow growth at the origin of…

Probability · Mathematics 2010-11-18 Andrei I. Karol' , Alexander I. Nazarov

In this paper we define the (edge-weighted) Cayley graph associated to a generalized Boolean function, introduce a notion of strong regularity and give several of its properties. We show some connections between this concept and generalized…

Information Theory · Computer Science 2018-06-21 Constanza Riera , Pantelimon Stanica , Sugata Gangopadhyay

We characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…

Functional Analysis · Mathematics 2021-06-18 Adem Limani , Bartosz Malman

We prove that if $X$ is a paracompact space, $Y$ is a metric space and $f:X\to Y$ is a functionally fragmented map, then (i) $f$ is $\sigma$-discrete and functionally $F_\sigma$-measurable; (ii) $f$ is a Baire-one function, if $Y$ is weak…

General Topology · Mathematics 2019-01-23 Olena Karlova

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie
‹ Prev 1 3 4 5 6 7 10 Next ›