相关论文: Angular Resolution of Closely-Spaced Targets with …
Dense arrays can facilitate the integration of multiple antennas into finite volumes. In addition to the compact size, sub-wavelength spacing enables superdirectivity for endfire operation, a phenomenon that has been mainly studied for…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…
This work studies an ultra-reliable and low-latency communications (uRLLC) downlink system using pinching antennas which are realized by activating small dielectric particles along a dielectric waveguide. Our goal is to maximize the data…
In this paper we consider the inverse scattering problem for high-contrast targets. We mathematically analyze the experimentally-observed phenomenon of super-resolution in imaging the target shape. This is the first time that a mathematical…
This paper establishes an upper bound on the capacity of line-of-sight multiantenna channels over all possible antenna arrangements and shows that uniform linear arrays (ULAs) with an SNR-dependent rotation of transmitter or receiver can…
Relatively supercuspidal representations are analogue of supercuspidal representations in the relative Langlands program. This work studies relatively supercuspidal representations using top degree Ext-groups via the Schneider-Stuhler…
In this paper we offer a review and bibliography of work on Hankel low-rank approximation and completion, with particular emphasis on how this methodology can be used for time series analysis and forecasting. We begin by describing possible…
Ultra-reliability and low latency communication has long been an important but challenging task in the fifth and sixth generation wireless communication systems. Scheduling as many users as possible to serve on the limited time-frequency…
We address the problem of clustering a set of points in $\mathbb{R}^d$ with axis-parallel clusters. Previous exact approaches to this problem are mostly based on integer programming formulations and can only solve to optimality instances of…
This is an English translation of Werner's 1987 dissertation "Kleine Aufl\"osungen spezieller dreidimensionaler Variet\"aten," originally published as Bonner Mathematische Schriften No. 186.
This PhD dissertation covers a range of topics in Finsler geometry and Finsler gravity, most notably: (i) the characterization of Berwald spaces, (ii) pseudo-Riemann (non-)metrizability of Berwald spaces, (iii) $(\alpha,\beta)$-metrics,…
The goal of this PhD thesis is to study a diophantine approximation problem stated by Schmidt in 1967. The problem aim to study the approximation of a subspace of $\mathbb{R}^n$ by rational subspaces, not necessarily of the same dimension,…
In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with…
This paper deals with Lavrentiev regularization for solving linear ill-posed problems, mostly with respect to accretive operators on Hilbert spaces. We present converse and saturation results which are an important part in regularization…
Limited angular resolution is one of the main obstacles for practical applications of light fields. Although numerous approaches have been proposed to enhance angular resolution, view selection strategies have not been well explored in this…
This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…
Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
We introduce a new division formula on projective space which provides explicit solutions to various polynomial division problems with sharp degree estimates. We consider simple examples as the classical Macaulay theorem as well as a quite…