Tootfinder

A Robust Method for Pitch Tracking in the Frequency Following Response using Harmonic Amplitude Summation Filterbank
Sajad Sadeghkhani, Maryam Karimi Boroujeni, Hilmi R. Dajani, Saeid R. Seydnejad, Christian Gigu\`ere
https://arxiv.org/abs/2506.19253

A Robust Method for Pitch Tracking in the Frequency Following Response using Harmonic Amplitude Summation Filterbank
The Frequency Following Response (FFR) reflects the brain's neural encoding of auditory stimuli including speech. Because the fundamental frequency (F0), a physical correlate of pitch, is one of the essential features of speech, there has been particular interest in characterizing the FFR at F0, especially when F0 varies over time. The standard method for extracting F0 in FFRs has been the Autocorrelation Function (ACF). This paper investigates harmonic-structure-based F0 estimation algorithms,…

Optimization of Flying Ad Hoc Network Topology and Collaborative Path Planning for Multiple UAVs
Ming He, Peizhao Wang, Haihua Chen, Bin Sun, Hongpeng Wang
https://arxiv.org/abs/2506.17945

Optimization of Flying Ad Hoc Network Topology and Collaborative Path Planning for Multiple UAVs
Multiple unmanned aerial vehicles (UAVs) play a vital role in monitoring and data collection in wide area environments with harsh conditions. In most scenarios, issues such as real-time data retrieval and real-time UAV positioning are often disregarded, essentially neglecting the communication constraints. In this paper, we comprehensively address both the coverage of the target area and the data transmission capabilities of the flying ad hoc network (FANET). The data throughput of the network …

Computational Complexity of Model-Checking Quantum Pushdown Systems
Deren Lin, Tianrong Lin
https://arxiv.org/abs/2506.18439 https://…

Computational Complexity of Model-Checking Quantum Pushdown Systems
In this paper, we study the problem of model-checking quantum pushdown systems from a computational complexity point of view. We arrive at the following equally important, interesting new results: We first extend the notions of the {\it probabilistic pushdown systems} and {\it Markov chains} to their quantum analogues and investigate the question of whether it is necessary to define a quantum analogue of {\it probabilistic computational tree logic} to describe the probabilistic and branching-…

On Gy\'arf\'as' Path-Colour Problem
Ben Cameron, Alexander Clow
https://arxiv.org/abs/2506.19100 https://arxiv.org/pdf/25…

On Gyárfás' Path-Colour Problem
In their 1997 paper titled ``Fruit Salad", Gyárfás posed the following conjecture: there exists a constant $k$ such that if each path of a graph spans a $3$-colourable subgraph, then the graph is $k$-colourable. It is noted that $k=4$ might suffice. Let $r(G)$ be the maximum chromatic number of any subgraph $H$ of $G$ where $H$ is spanned by a path. The only progress on this conjecture comes from Randerath and Schiermeyer in 2002, who proved that if $G$ is an $n$ vertex graph, then $χ(G) \le…

Generative Diffusion Receivers: Achieving Pilot-Efficient MIMO-OFDM Communications
Yuzhi Yang, Omar Alhussein, Atefeh Arani, Zhaoyang Zhang, M\'erouane Debbah
https://arxiv.org/abs/2506.18419

Generative Diffusion Receivers: Achieving Pilot-Efficient MIMO-OFDM Communications
This paper focuses on wireless multiple-input multiple-output (MIMO)-orthogonal frequency division multiplex (OFDM) receivers. Traditional wireless receivers have relied on mathematical modeling and Bayesian inference, achieving remarkable success in most areas but falling short in their ability to characterize channel matrices. Neural networks (NNs) have demonstrated significant potential in this aspect. Nevertheless, integrating traditional inference methods with NNs presents challenges, part…

Cost for research -- how cost data of research can be included in open metadata to be reused and evaluated
Julia Bartlewski, Christoph Broschinski, Gernot Deinzer, Cornelia Lang, Dirk Pieper, Bianca Schweighofer, Colin Sippl, Lisa-Marie Stein, Alexander Wagner, Silke Weisheit
https://arxiv.org/abs/2506.18517

Cost for research -- how cost data of research can be included in open metadata to be reused and evaluated
The openCost project aims to enhance transparency in research funding by making publication-related costs publicly accessible, following FAIR principles. It introduces a metadata schema for cost data, allowing aggregation and analysis across institutions. The project promotes open access and cost-efficient models, benefiting academic institutions, funders, and policymakers.

Fourier minimization and imputation of time series
Will Burstein, Alex Iosevich, Azita Mayeli, Hari Sarang Nathan
https://arxiv.org/abs/2506.19226 https://…

Fourier minimization and imputation of time series
One of the most common procedures in modern data analytics is filling in missing values in times series. For a variety of reasons, the data provided by clients to obtain a forecast, or other forms of data analysis, may have missing values, and those values need to be filled in before the data set can be properly analyzed. Many freely available forecasting software packages, such as the sktime library, have built-in mechanisms for filling in missing values. The purpose of this paper is to adapt …

"I forgot the formula:" How students can use coherence to reconstruct a (partially) forgotten equation
Katherine Gifford, Gabriel S. Ehrlich, Engin Bumbacher, Eric Kuo
https://arxiv.org/abs/2506.19641

"I forgot the formula:" How students can use coherence to reconstruct a (partially) forgotten equation
Introductory physics instruction emphasizes fluency with routine problem-solving procedures. However, even when applying these procedures, students frequently encounter challenges. This paper investigates how students navigate such moments when answering qualitative E&M problems in interviews. Students frequently noted they had partially forgotten a key equation on a problem involving RC circuits. We present focal cases that show how coherence-seeking approaches were employed to overcome this p…

Stability results of the Bishop-Phelps-Bollob\'as property and the generalized AHSP
Thiago Grando, Elisa R. Santos
https://arxiv.org/abs/2506.17762 htt…

Stability results of the Bishop-Phelps-Bollobás property and the generalized AHSP
In this paper, we study the Bishop-Phelps-Bollobás property for operators (BPBp for short). To this end, we investigate the generalized approximate hyperplane series property (generalized AHSP for short) for a pair $(X,Y)$ of Banach spaces, which characterizes when $(\ell_1(X),Y)$ has the BPBp. We prove the following results. For $L$ a locally compact Hausdorff space and $\mathcal{A}$ a unital uniform algebra, if either $(X, \mathcal{C}_0(L,Y))$ or $(X, \mathcal{A}^Y)$ has the BPBp, then so do…

Complexity of sparse polynomial solving 3: Infinity
Gregorio Malajovich
https://arxiv.org/abs/2506.17086 https://arxiv.org/pdf/2506.1…

Complexity of sparse polynomial solving 3: Infinity
A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed `dense', solving them over projective space or complex space may introduce spurious, degenerate roots or components.Spurious roots may be avoided by solving over toric varieties. In this paper, a homotopy algorithm is locally defined on charts of the toric variety. Its complexity…