相关论文: On Visibility Problems with an Infinite Discrete, …

The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a…

In this paper, we address the problem of detecting small, dense, and overlapping objects, a major challenge in computer vision. Our focus is on reviewing proposed methods based on deep learning supervised approaches. We provide a detailed…

For a given graph $G$, the mutual-visibility problem asks for the largest set of vertices $M \subseteq V(G)$ with the property that for any pair of vertices $u,v \in M$ there exists a shortest $u,v$-path of $G$ that does not pass through…

We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…

It is proved that one can choose a control function on an arbitrary small open subset of the boundary of an obstacle so that the total radiation from this obstacle for a fixed direction of the incident plane wave and for a fixed wave number…

Models in which the dark matter is very weakly coupled to the observable sector may explain the observed dark matter density, either as a "superWIMP" or as "asymmetric dark matter." Both types of models predict displaced vertices at…

For a connected graph $G$ and $X\subseteq V(G)$, we say that two vertices $u$, $v$ are $X$-visible if there is a shortest $u,v$-path $P$ with $V(P)\cap X \subseteq \{u,v\}$. If every two vertices from $X$ are $X$-visible, then $X$ is a…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

A previous work found that a nonminimally coupled theory of gravity can, under appropriate conditions, give rise to an additional contribution to the field equations interpreted as dark matter [1]: in particular, the density of this dark…

In some recent papers the classical `splitting necklace theorem' is linked in an interesting way with a geometric `pattern avoidance problem'. We explore the topological constraints on the existence of a (relaxed) measurable coloring of R^d…

Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge…

The "visibility" of a planar set $S$ from a point $a$ is defined as the normalized size of the radial projection of $S$ from $a$ to the unit circle centered at $a$. Simon and Solomyak (Real Anal. Exchange 2006/07) proved that unrectifiable…

Apparent magnitudes are important for high precision cosmology. It is generally accepted that weak gravitational lensing does not affect the relationship between apparent magnitude and redshift. By considering metric perturbations it is…

A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called a…

We construct a subset $A$ of the unit disc with the following properties. (i) The set $A$ is the finite union of disjoint line segments. (ii) The shadow of $A$ is arbitrarily close to the shadow of the unit disc in "most" directions. (iii)…

The mutual-visibility problem in a graph $G$ asks for the cardinality of a largest set of vertices $S\subseteq V(G)$ so that for any two vertices $x,y\in S$ there is a shortest $x,y$-path $P$ so that all internal vertices of $P$ are not in…

Let $V$ be a variety in $\mathbb{F}_q^d$ and $E\subset V$. It is known that if any line passing through the origin contains a bounded number of points from $E$, then $|\prod(E)|=|\{x\cdot y\colon x, y\in E\}|\gg q$ whenever $|E|\gg…

The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of…

The similar cosmological abundances observed for visible and dark matter suggest a common origin for both. By viewing the dark matter density as a dark-sector asymmetry, mirroring the situation in the visible sector, we show that the…

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…