相关论文: Structure of sets with nearly maximal Favard lengt…

The Favard length of a Borel set $E\subset\mathbb{R}^2$ is the average length of its orthogonal projections. We prove that if $E$ is Ahlfors 1-regular and it has large Favard length, then it contains a big piece of a Lipschitz graph. This…

It is hereby established that the set of Lipschitz functions $f:\mathcal{U}\rightarrow \mathbb{R}$ ($\mathcal{U}$ nonempty open subset of $\ell_{d}^{1}$) with maximal Clarke subdifferential contains a linear subspace of uncountable…

The classical Besicovitch projection theorem states that if a planar set $E$ with finite length is purely unrectifiable, then almost all orthogonal projections of $E$ have zero length. We prove a quantitative version of this result: if…

Johnson and Lov\'asz and Stein proved independently that any hypergraph satisfies $\tau\leq (1+\ln \Delta)\tau^{\ast}$, where $\tau$ is the transversal number, $\tau^{\ast}$ is its fractional version, and $\Delta$ denotes the maximum…

Let $ v$ be a smooth vector field on the plane, that is a map from the plane to the unit circle. We study sufficient conditions for the boundedness of the Hilbert transform \operatorname H_{v, \epsilon}f(x) := \text{p.v.}\int_{-\epsilon}^…

Let $r,k,\ell$ be integers such that $0\le\ell\le\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\ell$ edges. If $\ell$ is 0 or $\binom{k}{r}$, this fraction can be…

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in $\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert x-y \rVert :x,y\in E\}$, where $\lVert \alpha \rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich,…

The Besicovitch projection theorem states that if a subset $E$ of the plane has finite length in the sense of Hausdorff measure and is purely unrectifiable (so its intersection with any Lipschitz graph has zero length), then almost every…

Federer's characterization states that a set $E\subset \mathbb{R}^n$ is of finite perimeter if and only if $\mathcal H^{n-1}(\partial^*E)<\infty$. Here the measure-theoretic boundary $\partial^*E$ consists of those points where both $E$ and…

The diametral dimension, $\Delta(E)$, and the approximate diametral dimension, $\delta(E)$ of an element $E$ of a large class of nuclear Fr\'echet spaces are set theoretically between the corresponding invariant of power series spaces…

In this paper we get an estimate of Favard length of an arbitrary neighbourhood of an arbitrary self-similar Cantor set. Consider $L$ closed disjoint discs of radius $1/L$ inside the unit disc. By using linear maps of smaller disc onto the…

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line…

We show that for a large class of planar $1$-dimensional random fractals $S$, the Favard length $\operatorname{Fav}(S(r))$ of the neighborhood $S(r)$ is comparable to $\log^{-1}(1/r)$, matching a universal lower bound; up to now, this was…

We show that for almost any vector $v$ in $\mathbb{R}^n$, for any $\epsilon>0$ there exists $\delta>0$ such that the dimension of the set of vectors $w$ satisfying $\liminf_{k\to\infty} k^{1/n}<kv-w> \ge \epsilon$ (where $<\cdot>$ denotes…

Given integers $n > k > 0$, and a set of integers $L \subset [0, k-1]$, an \emph{$L$-system} is a family of sets $\mathcal{F} \subset \binom{[n]}{k}$ such that $|F \cap F'| \in L$ for distinct $F, F'\in \mathcal{F}$. $L$-systems correspond…

We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…

Given a graph $H$, a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any graph $H$, a linear-in-$e(H)$ bound on average degree…

A natural quantity that measures how well a map $f:\mathbb{R}^{d}\rightarrow \mathbb{R}^{D}$ is approximated by an affine transformation is…

Let $\Omega \subset \mathbb{R}^2$ be a convex set. We study the problem of distributing a one-dimensional set $S$ with total length $L$ so that for any line $\ell$ in $\mathbb{R}^2$ the number of intersections $\#(\ell \cap S)$ is…