English
Related papers

Related papers: How much can heavy lines cover?

200 papers

Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em…

Combinatorics · Mathematics 2020-02-25 Sergey Bereg , Mohammadreza Haghpanah

$\newcommand{\eps}{\varepsilon}\newcommand{\tldO}{\widetilde{O}}$Consider the problem of constructing weak $\eps$-nets where the stabbing elements are lines or $k$-flats instead of points. We study this problem in the simplest setting where…

Computational Geometry · Computer Science 2022-05-05 Sariel Har-Peled , Mitchell Jones

For complex connected, reductive, affine, algebraic groups $G$, we give a Lie-theoretic characterization of the semistability of principal $G$-co-Higgs bundles on the complex projective line $\mathbb{P}^1$ in terms of the simple roots of a…

Algebraic Geometry · Mathematics 2020-10-23 Indranil Biswas , Oscar García-Prada , Jacques Hurtubise , Steven Rayan

In this paper we investigate the intersection problem for $1$-surfaces immersed in a complete Riemannian three-manifold $P$ with Ricci curvature bounded from below by $-2$. We first prove a Frankel's type theorem for $1$-surfaces with…

Differential Geometry · Mathematics 2022-02-10 G. Pacelli Bessa , Tiarlos Cruz , Leandro F. Pessoa

Let $\partial \,\mathcal{C}$ be the boundary of a compact convex body $\mathcal{C}$ in $\mathbb{R}^n,\, n\geq 2$, and $O$ be an interior point of $\mathcal C$. Every straight line $l$ containing $O$ cuts from $\mathcal{C}$ a segment $[AB]$…

Metric Geometry · Mathematics 2025-06-10 Petar Kenderov , Oleg Mushkarov , Nikolai Nikolov

Bonini, Borello and Byrne started the study of saturating linear sets in Desarguesian projective spaces, in connection with the covering problem in the rank metric. In this paper we study \emph{$1$-saturating} linear sets in PG$(2,q^4)$,…

Combinatorics · Mathematics 2024-02-23 Ferdinando Zullo

We study covering numbers and local covering numbers with respect to difference graphs and complete bipartite graphs. In particular we show that in every cover of a Young diagram with $\binom{2k}{k}$ steps with generalized rectangles there…

We consider mappings satisfying a certain estimate of the distortion of the modulus of families of paths, similar to the geometric definition of quasiconformal mappings. Under appropriate restrictions, we show that the class of such…

Complex Variables · Mathematics 2026-04-30 D. Romash , E. Sevost'yanov

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

Dynamical Systems · Mathematics 2024-04-22 Ioannis Kousek , Tristán Radić

We present a sample of 17 type 2 Seyfert galaxies which have an X-ray column density lower than 10^{22} cm^{-2}. The Compton thin nature of these sources is strongly suggested by isotropic indicators. We estimate the fraction of these…

Astrophysics · Physics 2009-11-07 Francesca Panessa , Loredana Bassani

We provide several new answers on the question: how do radial projections distort the dimension of planar sets? Let $X,Y \subset \mathbb{R}^{2}$ be non-empty Borel sets. If $X$ is not contained on any line, we prove that \[ \sup_{x \in X}…

Classical Analysis and ODEs · Mathematics 2024-08-19 Tuomas Orponen , Pablo Shmerkin , Hong Wang

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

Combinatorics · Mathematics 2023-11-10 Steven Simon , Tobias Timofeyev

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…

Combinatorics · Mathematics 2019-08-30 Yen-chi Roger Lin , Wei-Hsuan Yu

Symbol-pair codes were proposed for the application in high density storage systems, where it is not possible to read individual symbols. Yaakobi, Bruck and Siegel proved that the minimum pair-distance of binary linear cyclic codes…

Information Theory · Computer Science 2023-03-27 Hao Chen

We consider unions of $SL(2)$ lines in $\mathbb{R}^{3}$. These are lines of the form $$L = (a,b,0) + \mathrm{span}(c,d,1),$$ where $ad - bc = 1$. We show that if $\mathcal{L}$ is a Kakeya set of $SL(2)$ lines, then the union $\cup…

Classical Analysis and ODEs · Mathematics 2022-10-19 Katrin Fässler , Tuomas Orponen

We consider the effect of a partial coverage of quasar broad-line regions (QSO BLRs) by intervening H$_2$-bearing clouds when a part of quasar (QSO) radiation passes by a cloud not taking part in formation of an absorption-line system in…

Astrophysics of Galaxies · Physics 2015-08-20 Dmitrii Ofengeim , Sergei Balashev , Aleksandr Ivanchik , Aleksandr Kaminker , Vyacheslav Klimenko

Consider a discrete-time martingale $\{X_t\}$ taking values in a Hilbert space $\mathcal H$. We show that if for some $L \geq 1$, the bounds $\mathbb{E} \left[\|X_{t+1}-X_t\|_{\mathcal H}^2 \mid X_t\right]=1$ and $\|X_{t+1}-X_t\|_{\mathcal…

Probability · Mathematics 2015-09-10 James R. Lee , Yuval Peres , Charles K. Smart

A regular partition $\mathcal{P}$ for a $3$-uniform hypergraph $H=(V,E)$ consists of a partition $V=V_1\cup \ldots \cup V_t$ and for each $ij\in {[t]\choose 2}$, a partition $K_2[V_i,V_j]=P_{ij}^1\cup \ldots \cup P_{ij}^{\ell}$, such that…

Combinatorics · Mathematics 2023-11-08 C. Terry

Suppose that Y is a cyclic cover of projective space branched over a hyperplane arrangement D, and that U is the complement of the ramification locus in Y. The first theorem implies that the Beilinson-Hodge conjecture holds for U if certain…

Algebraic Geometry · Mathematics 2019-08-15 Donu Arapura

Given a metric space $(X,d_X)$, a $(\beta,s,\Delta)$-sparse cover is a collection of clusters $\mathcal{C}\subseteq P(X)$ with diameter at most $\Delta$, such that for every point $x\in X$, the ball $B_X(x,\frac\Delta\beta)$ is fully…

Data Structures and Algorithms · Computer Science 2024-10-30 Arnold Filtser
‹ Prev 1 8 9 10 Next ›