Results 21 to 30 of about 112 (86)
The fundamental group of the complement of a generic fiber‐type curve
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract In this paper, we describe and characterize the fundamental group of the complement of generic fiber‐type curves, that is, unions of (the closure of) finitely many generic fibers of a component‐free pencil F=[f:g]:CP2⤍CP1$F=[f:g]:\mathbb {C}\mathbb {P}^2\dashrightarrow \mathbb {C}\mathbb {P}^1$.
José I. Cogolludo‐Agustín +1 more
wiley +1 more source
Presentations of the braid group of the complex reflection group G(d,d,n)$G(d,d,n)$
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We show that the braid group associated to the complex reflection group G(d,d,n)$G(d,d,n)$ is an index d$d$ subgroup of the braid group of the orbifold quotient of the complex numbers by a cyclic group of order d$d$. We also give a compatible presentation of G(d,d,n)$G(d,d,n)$ and its braid group for each tagged triangulation of the disk with ...
Francesca Fedele, Bethany Rose Marsh
wiley +1 more source
IET Radar, Sonar & Navigation, 2017 The authors investigate the problem of two‐dimensional (2D) direction of arrival (DOA) estimation of multiple signals for coprime planar arrays (CPAs) in this study and they propose a computationally efficient 1D partial spectral search approach based on multiple signal classification (MUSIC) algorithm.
Zheng Wang, Zhang Xiaofei, Shi Zhan
openaire +1 more source
Simplification of exponential factors of irregular connections on P1${\mathbb {P}}^1$
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract We give an explicit algorithm to reduce the ramification order of any exponential factor of an irregular connection on P1$\mathbb {P}^1$, using the same types of basic operations as in the Katz–Deligne–Arinkin algorithm for rigid irregular connections.
Jean Douçot
wiley +1 more source
Research on Three‐Dimensional Autonomous Obstacle Avoidance Path Planning Methods for UAVs
Transactions on Emerging Telecommunications Technologies, Volume 37, Issue 2, February 2026.This study presents a three‐dimensional autonomous obstacle‐avoidance path planning method for unmanned aerial vehicles (UAVs) based on a deep reinforcement learning (DRL)‐enhanced Mayfly Algorithm. The traditional Mayfly Algorithm suffers from issues such as random initial population generation and slow convergence.
Chong Wu, Hao Cheng, Hua Wang
wiley +1 more source
An asymptotic local–global theorem on heights of some Kleinian group orbits
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract We prove an asymptotic local–global theorem on the heights of point orbits of thin subgroups of Bianchi groups in H3$\mathbb {H}^3$.
Xuanxuan Xiao, Xin Zhang
wiley +1 more source
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT We study a random walk on the Lie algebra sl2(Fp)$$ {\mathfrak{sl}}_2\left({\mathbf{F}}_p\right) $$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we analyze the limiting distribution of the random walk and the speed at which it
Urban Jezernik, Matevž Miščič
wiley +1 more source
IET Radar, Sonar &Navigation, Volume 20, Issue 1, January/December 2026.This paper proposes a multitarget direct position determination (DPD) method for mobile single observation stations based on the second‐order difference coprime array (SODCA), which expands the virtual array aperture via redundant data averaging and adopts a three‐level covariance matrix reconstruction framework (zero‐interpolation, spatial smoothing ...
Hongzhen Wang +3 more
wiley +1 more source
IET Signal Processing, Volume 2026, Issue 1, 2026.To address the issue that the traditional direct position determination (DPD) method for coprime arrays (CAs) has limited performance in scenarios with low signal‐to‐noise ratio (SNR) and small quantity of observation data, a progressive optimization method based on the averaging of redundant data from virtual array elements is proposed. This method is
Hongzhen Wang +4 more
wiley +1 more source
The dimension of well approximable numbers
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In this survey article, we explore a central theme in Diophantine approximation inspired by a celebrated result of Besicovitch on the Hausdorff dimension of well approximable real numbers. We outline some of the key developments stemming from Besicovitch's result, with a focus on the mass transference principle, ubiquity and Diophantine ...
Victor Beresnevich, Sanju Velani
wiley +1 more source