English
Related papers

Related papers: A Frostman type lemma for sets with large intersec…

200 papers

We study class-imbalanced linear classification in a high-dimensional Gaussian mixture model. We develop a tight, closed form approximation for the test error of several practical learning methods, including logit adjustment and class…

Machine Learning · Computer Science 2025-03-10 Eliav Mor , Yair Carmon

We investigate the size and large intersection properties of $$E_{t}=\{x\in\R^d \:|\: \|x-k-x_{i}\|<{r_{i}}^t\text{for infinitely many}(i,k)\in I^{\mu,\alpha}\times\Z^d\},$$ where $d\in\N$, $t\geq 1$, $I$ is a denumerable set,…

Metric Geometry · Mathematics 2007-09-25 Arnaud Durand

Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, the generating distributions are unknown and only a set of…

Machine Learning · Statistics 2021-02-11 Mahdi Haghifam , Vincent Y. F. Tan , Ashish Khisti

Koksma's equidistribution theorem from 1935 states that for Lebesgue almost every $\alpha>1$, the fractional parts of the geometric progression $(\alpha^{n})_{n\geq1}$ are equidistributed modulo one. In the present paper we sharpen this…

Number Theory · Mathematics 2020-10-21 Christoph Aistleitner , Simon Baker , Niclas Technau , Nadav Yesha

Ewens sampling formula (ESF) is a one-parameter family of probability distributions with a number of intriguing combinatorial connections. This elegant closed-form formula first arose in biology as the stationary probability distribution of…

Probability · Mathematics 2010-10-18 Paul A. Jenkins , Yun S. Song

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

Combinatorics · Mathematics 2017-04-25 Abigail Raz

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss

Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is…

Combinatorics · Mathematics 2012-05-04 Dhruv Mubayi , Vojtech Rodl

Given a finite transitive group $G\leq \operatorname{Sym}(\Omega)$, a subset $\mathcal{F}$ of $G$ is \emph{intersecting} if any two elements of $\mathcal{F}$ agree on some element of $\Omega$. The \emph{intersection density} of $G$, denoted…

We consider the intersection map on the family of non-empty $\omega$-Scott-open sets of the lattice of opens of a topological space. We prove that in a certain class of topological spaces the intersection map forms a continuous retraction…

Logic · Mathematics 2015-01-27 Matthias Schröder

A set $S$ of vertices of a graph $G$ is \emph{distinguishing} if the sets of neighbors in $S$ for every pair of vertices not in $S$ are distinct. A \emph{locating-dominating set} of $G$ is a dominating distinguishing set. The…

Combinatorics · Mathematics 2018-07-19 Carmen Hernando , Mercè Mora , Ignacio M. Pelayo

It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…

Combinatorics · Mathematics 2022-11-24 Luke Pebody

We give conditions on a general family $P_{\lambda}:\R^n\to\R^m, \lambda \in \Lambda,$ of orthogonal projections which guarantee that the Hausdorff dimension formula $\dim A\cap P_{\lambda}^{-1}\{u\}=s-m$ holds generically for measurable…

Classical Analysis and ODEs · Mathematics 2020-06-09 Pertti Mattila

We study the multifractal analysis of self-similar measures arising from random homogeneous iterated function systems. Under the assumption of the uniform strong separation condition, we see that this analysis parallels that of the…

Dynamical Systems · Mathematics 2019-12-23 Kathryn E. Hare , Kevin G. Hare , Sascha Troscheit

We consider the problem of estimating a function $s$ on $[-1,1]^{k}$ for large values of $k$ by looking for some best approximation by composite functions of the form $g\circ u$. Our solution is based on model selection and leads to a very…

Statistics Theory · Mathematics 2013-01-29 Yannick Baraud , Lucien Birgé

We provide a proof of the union-closed sets conjecture, by means of a suitable refinement of the breakthrough entropy-approach introduced by Gilmer. The novelty here is to consider a convex combination of $A$ and $A\cup B$, where $A,B$ are…

Combinatorics · Mathematics 2023-02-09 Raffaele Scandone

Let $(X, d)$ be a compact metric space, and let $Q \subset X$ be countable. Given functions $R: Q \to \mathbb{R}^+$ and $\phi: \mathbb{R}^+ \to \mathbb{R}^+$, we consider the set $E(Q, R, \phi)$ of points $x \in X$ that ``hit'' the…

Number Theory · Mathematics 2026-02-26 Bo Tan , Chen Tian , Baowei Wang , Jun Wu

A set family ${\cal F}$ is called intersecting if every two members of ${\cal F}$ intersect, and it is called uniform if all members of ${\cal F}$ share a common size. A uniform family ${\cal F} \subseteq \binom{[n]}{k}$ of $k$-subsets of…

Data Structures and Algorithms · Computer Science 2024-07-19 Ishay Haviv , Michal Parnas

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

Combinatorics · Mathematics 2020-05-18 Xizhi Liu
‹ Prev 1 3 4 5 6 7 10 Next ›