Tootfinder

The Erd\H{o}s-Falconer distance problem between arbitrary sets and $k$-coordinatable sets in finite fields
Hunseok Kang, Doowon Koh, Firdavs Rakhmonov
https://arxiv.org/abs/2506.07251

The Erdős-Falconer distance problem between arbitrary sets and $k$-coordinatable sets in finite fields
In this paper, we study the cardinality of the distance set $Δ(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane up to translations and rotations, we prove that if $|A||B| > 2q^d$, then $|Δ(A, B)| > q/2$, where $|Δ(A, B)|$ denotes the number of distinct distances between elements of $A$ and $B$. In particular, we show that our resu…

This https://arxiv.org/abs/2505.00968 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Tree-Sliced Wasserstein Distance with Nonlinear Projection
Tree-Sliced methods have recently emerged as an alternative to the traditional Sliced Wasserstein (SW) distance, replacing one-dimensional lines with tree-based metric spaces and incorporating a splitting mechanism for projecting measures. This approach enhances the ability to capture the topological structures of integration domains in Sliced Optimal Transport while maintaining low computational costs. Building on this foundation, we propose a novel nonlinear projectional framework for the Tre…

Optimal bounds for the Kobayashi distance near $\mathcal C^2$-smooth boundary points
Nikolai Nikolov, Pascal J. Thomas
https://arxiv.org/abs/2506.06507 htt…

Optimal bounds for the Kobayashi distance near $\mathcal C^2$-smooth boundary points
It is shown that the optimal upper and lower bounds for the Kobayashi distance near $\mathcal C^{2,α}$-smooth strongly pseudoconvex boundary points obtained in L. Kosinski, N. Nikolov, A.Y. Okten: "Precise estimates of invariant distances on strongly pseudoconvex domains", Adv. Math. 478 (2025), 110388, remain true in the general $\mathcal C^2$ strongly pseudoconvex setting. In fact, the upper bound is extended to the general $\mathcal C^{1,1}$-smooth case. We also give upper and lower bounds …

Three months after the fires, I finally took a break from work, disaster management, and re-establishing domestic infrastructure. I flew up the Owens Valley to Lone Pine, and and spent last weekend walking in the desert, biking in the foothills, and gazing at the stars.
#aviation #California

One happy white #stork (Ciconia ciconia) family in #Bochum, Germany, photographed - often with digital zoom at the limit - from the approriate distance: one adult and four youngsters, one pretty big already. A lot of interesting behavior observed in one hour: more pictures in #BirdsOfMastodon

The error-correcting pair for several classes of NMDS linear codes
Dong He, Zhaohui Zhang, Qunying Liao
https://arxiv.org/abs/2506.07380 https://

The error-correcting pair for several classes of NMDS linear codes
The error-correcting pair is a general algebraic decoding method for linear codes. The near maximal distance separable (NMDS) linear code is a subclass of linear codes and has applications in secret sharing scheme and communication systems due to the efficient performance, thus we focus on the error-correcting pair of NMDS linear codes. In 2023, He and Liao showed that for an NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+1$ or $2\ell+2$, if $\mathcal{C}$ has an $\ell$-error-correc…

This https://arxiv.org/abs/2505.01323 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNE_…

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
Together with the NSGA-II and SMS-EMOA, the strength Pareto evolutionary algorithm 2 (SPEA2) is one of the most prominent dominance-based multi-objective evolutionary algorithms (MOEAs). Different from the NSGA-II, it does not employ the crowding distance (essentially the distance to neighboring solutions) to compare pairwise non-dominating solutions but a complex system of $σ$-distances that builds on the distances to all other solutions. In this work, we give a first mathematical proof showi…

Sonnet 044 - XLIV
If the dull substance of my flesh were thought,
Injurious distance should not stop my way;
For then despite of space I would be brought,
From limits far remote, where thou dost stay.
No matter then although my foot did stand
Upon the farthest earth remov'd from thee;
For nimble thought can jump both sea and land,
As soon as think the place where he would be.
But, ah! thought kills me that I am not thought,
To l…

Pavo: Stellar feedback in action in a low-mass dwarf galaxy
Michael G. Jones, Martin P. Rey, David J. Sand, Kristine Spekkens, Burcin Mutlu-Pakdil, Elizabeth A. K. Adams, Paul Bennet, Denija Crnojevic, Amandine Doliva-Dolinsky, Richard Donnerstein, Catherine E. Fielder, Julia Healy, Laura C. Hunter, Ananthan Karunakaran, Deepthi S. Prabhu, Dennis Zaritsky

Pavo: Stellar feedback in action in a low-mass dwarf galaxy
MeerKAT observations of the recently discovered, extremely low mass galaxy, Pavo, have revealed a neutral gas (HI) reservoir that was undetected in archival HI single dish data. Based on the latest distance measurement ($2.16^{+0.08}_{-0.07}$ Mpc), we measure Pavo's HI mass as $\log M_\mathrm{HI}/\mathrm{M_\odot} = 5.79 \pm 0.05$, making it the lowest mass HI reservoir currently known in an isolated galaxy (with a robust distance measurement). Despite Pavo's extreme isolation, with no known nei…

This https://arxiv.org/abs/2501.16092 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Log-Sobolev Inequality for Decoupled and McKean-Vlasov SDEs and Application on Exponential Ergodicity
The exponential ergodicity in the \( L^1 \)-Wasserstein distance for partially dissipative McKean-Vlasov SDEs has been extensively studied. However, the question of exponential ergodicity in the \( L^2 \)-Wasserstein distance and relative entropy has remained unresolved. This paper addresses the problem by establishing the log-Sobolev inequality for both the time-marginal distributions and the invariant probability measure, providing a positive resolution. As part of the groundwork, the log-Sob…

Canadians, please confirm this is valid
EDIT: Added in better alt text

Perfect state transfer in Grover walks on association schemes and distance-regular graphs
Koushik Bhakta, Bikash Bhattacharjya
https://arxiv.org/abs/2506.07439

Perfect state transfer in Grover walks on association schemes and distance-regular graphs
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distanc…

Stark Tuning and Charge State Control in Individual Telecom C-Band Quantum Dots
N. J. Martin, A. J. Brash, A. Tomlinson, E. M. Sala, E. O. Mills, C. L. Phillips, R. Dost, L. Hallacy, P. Millington-Hotze, D. Hallett, K. A. O'Flaherty, J. Heffernan, M. S. Skolnick, A. M Fox, L. R. Wilson
https://arxiv.org/abs/2506.07951…

Stark Tuning and Charge State Control in Individual Telecom C-Band Quantum Dots
Telecom-wavelength quantum dots (QDs) are emerging as a promising solution for generating deterministic single-photons compatible with existing fiber-optic infrastructure. Emission in the low-loss C-band minimizes transmission losses, making them ideal for long-distance quantum communication. In this work, we present the first demonstration of both Stark tuning and charge state control of individual InAs/InP QDs operating within the telecom C-band. These QDs are grown by droplet epitaxy and emb…

Launch pad.
(Not really, but that part of the Saalfelder Weg very much makes me feel like wanting to take off... Höhengefühle!)
#SilentSunday #LandscapePhotography #Photography

This https://arxiv.org/abs/2412.01012 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Optimal transport and regularity of weak Kantorovich potentials on a globally hyperbolic spacetime
We consider the optimal transportation problem on a globally hyperbolic spacetime for some cost function $c_2$, which corresponds to the optimal transportation problem on a complete Riemannian manifold where the cost function is the Riemannian distance squared. Building on insights from previous studies on the Riemannian and Lorentzian case, our main goal is to investigate the regularity of $π$-solutions (weak versions of Kantorovich potentials), from which we can conclude, in a classical way,…

This https://arxiv.org/abs/2311.12098 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

Union Through UNITY: Cosmology with 2,000 SNe Using a Unified Bayesian Framework
Type Ia supernovae (SNe Ia) were instrumental in establishing the acceleration of the universe's expansion. By virtue of their combination of distance reach, precision, and prevalence, they continue to provide key cosmological constraints, complementing other cosmological probes. Individual SN surveys cover only over about a factor of two in redshift, so compilations of multiple SN datasets are strongly beneficial. We assemble an up-to-date "Union" compilation of 2087 cosmologically useful SNe …

This https://arxiv.org/abs/2505.15992 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

On the Complexity of Finding Approximate LCS of Multiple Strings
Finding an Approximate Longest Common Substring (ALCS) within a given set $S=\{s_1,s_2,\ldots,s_m\}$ of $m \ge 2$ strings is a problem of particular importance in computational biology (e.g., identifying related mutations across multiple genetic sequences). In this paper, we study several ALCS problems that, for given integers $k$ and $t \le m$, require finding a longest string $u$ -- or a longest substring $u$ of any string in $S$ -- that lies within distance $k$ of at least one substring in $…

This https://arxiv.org/abs/2504.14819 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Abstract Continuity Theorem for the Lyapunov Exponents of linear cocycles
We prove the Hölder continuity of Lyapunov exponents for general linear cocycles when the base measures vary in Wasserstein distance, under the assumption of uniform large deviations type (LDT) estimates. This is a measure version of the abstract continuity theorem (ACT) established by Duarte-Klein [Duarte, P. and Klein, S. (2016). Lyapunov exponents of linear cocycles: Continuity via large deviations. Atlantis Studies in Dynamical Systems, 3]. The main obstacle here lies in the fact that the …

That's not orange spray paint, it's cayenne pepper powder.
Let's see if this will be any deterrent for the trash pandas. It's along one of their main travel routes and if i see them avoiding this path then I'll know it works and can try putting out more.

This https://arxiv.org/abs/2403.04725 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Discrete-to-continuum crystalline curvature flows
We consider here a fully discrete variant of the implicit variational scheme for mean curvature flow [AlmTayWan,LucStu], in a setting where the flow is governed by a crystalline surface tension defined by the limit of pairwise interactions energy on the discrete grid. The algorithm is based on a new discrete distance from the evolving sets, which prevents the occurrence of the spatial drift and pinning phenomena identified in [MisiatsYip16,BraGelNov] in a similar discrete framework. We provide …

Practically significant differences between conditional distribution functions
Holger Dette, Kathrin M\"ollenhoff, Dominik Wied
https://arxiv.org/abs/2506.06545

Practically significant differences between conditional distribution functions
In the framework of semiparametric distribution regression, we consider the problem of comparing the conditional distribution functions corresponding to two samples. In contrast to testing for exact equality, we are interested in the (null) hypothesis that the $L^2$ distance between the conditional distribution functions does not exceed a certain threshold in absolute value. The consideration of these hypotheses is motivated by the observation that in applications, it is rare, and perhaps impos…

This https://arxiv.org/abs/2506.01348 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Distributionally Robust Learning in Survival Analysis
We introduce an innovative approach that incorporates a Distributionally Robust Learning (DRL) approach into Cox regression to enhance the robustness and accuracy of survival predictions. By formulating a DRL framework with a Wasserstein distance-based ambiguity set, we develop a variant Cox model that is less sensitive to assumptions about the underlying data distribution and more resilient to model misspecification and data perturbations. By leveraging Wasserstein duality, we reformulate the …

My weekend trip to the desert included a stop at the Antelope Valley California Poppy Preserve, where the poppies were finally out, if not in superbloom mode
#naturalist

Good morning on my 1st vacation day! It is rainy & chill. Just the right for a very calm start. I feel the stress fading out but I am still very tired.
This #photo from our visit to #vienna / #wien…

Sometimes you look at a graph and think that a particular value seems a bit odd. Then you look at the other numbers and they seem off, too. At that point, you realise that the graph is not intended to clarify, but to obscure. On German #EV charging prices, Quartets and diesel.

Sometimes you look at a graph and think that a particular value seems a… | Jaap Burger
Sometimes you look at a graph and think that a particular value seems a bit odd. Then you look at the other numbers and they seem off, too. At that point, you realise that the graph is not intended to clarify, but to obscure. Thank you, Felix Hamer, for drawing attention to this recent slide from BDEW Bundesverband der Energie- und Wasserwirtschaft e.V. The title suggests that EV charging would only cost the same as filling up a diesel or petrol car for the same distance in an 'Extremszenario…

Distinguishing True Influence from Hyperprolificity with Citation Distance
Lu Li, Yun Wan, Feng Xiao
https://arxiv.org/abs/2506.03527 https://

Distinguishing True Influence from Hyperprolificity with Citation Distance
Accurately evaluating scholarly influence is essential for fair academic assessment, yet traditional bibliometric indicators - dominated by publication and citation counts - often favor hyperprolific authors over those with deeper, long-term impact. We propose the x-index, a novel citation-based metric that conceptualizes citation as a process of knowledge diffusion and incorporates citation distance to reflect the structural reach of scholarly work. By weighting citations according to the coll…

CAKE - The Distance (Official HD Video)
https://www.youtube.com/watch?v=F_HoMkkRHv8

Natura Urbana XIII 🏡
城市自然 XIII 🏡
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Improving the average dilation of a metric graph by adding edges
Sariel Har-Peled, Eliot W. Robson
https://arxiv.org/abs/2506.04246 https://

Improving the average dilation of a metric graph by adding edges
For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to augment $G$ with $k$ additional edges to reduce the maximum dilation. In this note, we consider a variant of this problem where the goal is to reduce the average dilation for pairs of points in $G$. We provide an $O(k)$ approximation algorithm for this proble…

This https://arxiv.org/abs/2502.00168 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Supervised Quadratic Feature Analysis: Information Geometry Approach for Dimensionality Reduction
Supervised dimensionality reduction aims to map labeled data to a low-dimensional feature space while maximizing class discriminability. Directly computing discriminability is often impractical, so an alternative approach is to learn features that maximize a distance or dissimilarity measure between classes. The Fisher-Rao distance is an important information geometry distance in statistical manifolds. It is induced by the Fisher information metric, a tool widely used for understanding neural r…

fullerene_structures: Fullerene molecular structures
Fifteen networks of carbon atoms and the atomic bonds that connect them within molecules of fullerenes, from 60 atoms up to 6000 atoms. A bond is defined to exist whenever the distance of two atoms is less than 1.5 angstrom.
This network has 1500 nodes and 2250 edges.
Tags: Biological, Chemical, Unweighted, Spatial

Good morning from Harlem
#Photography #GoodMorning #Sunrise #NYC

On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
N. V. Pletnev
https://arxiv.org/abs/2506.04866

On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows calculating the gradient by solving well-posed problems, which allows applying first-order methods. This article is devoted to the construction of the $m$-moment minimum error method -- an effective method that minimizes the distance to the exact solution. The con…

Uniform \v{S}olt\'es' hypergraphs and \v{S}olt\'es' weighted graphs
Stijn Cambie, Ajay Tiwari
https://arxiv.org/abs/2506.07511 https://

Uniform Šoltés' hypergraphs and Šoltés' weighted graphs
A Šoltés' hypergraph is a hypergraph for which the removal of any of its vertices does not change its total distance. We prove that every uniform Šoltés' hypergraph has order at least $10$, there exist uniform Šoltés' hypergraphs for almost every order or uniformity, and there exist a non-regular uniform Šoltés' hypergraph. By also providing infinitely many weighted Šoltés' graphs, we conclude that Šoltés' problem can be answered positively for the most natural generalisations of gr…

Exploiting Euclidean Distance Field Properties for Fast and Safe 3D planning with a modified Lazy Theta*
Jose A. Cobano, L. Merino, F. Caballero
https://arxiv.org/abs/2505.24024

Exploiting Euclidean Distance Field Properties for Fast and Safe 3D planning with a modified Lazy Theta*
Graph search planners have been widely used for 3D path planning in the literature, and Euclidean Distance Fields (EDFs) are increasingly being used as a representation of the environment. However, to the best of our knowledge, the integration of EDFs into heuristic planning has been carried out in a loosely coupled fashion, dismissing EDF properties that can be used to accelerate/improve the planning process and enhance the safety margins of the resultant trajectories. This paper presents a fa…

Good Morning ESWC2025! The last conference day is about to start. Looking forward to an interesting keynote, more presentations and interesting discussions! Most interesting to see for me this year was the presence of neurosymbolic topics almost everywhere in our community.
#eswc2025 #portoroz…

This https://arxiv.org/abs/2407.08829 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On Certain Extremal Banach-Mazur Distances and Ader's Characterization of Distance Ellipsoids
A classical consequence of the John Ellipsoid Theorem is the upper bound $\sqrt{n}$ on the Banach-Mazur distance between the Euclidean ball and any symmetric convex body in $\mathbb{R}^n$. Equality is attained for the parallelotope and the cross-polytope. While it is known that they are unique with this property for $n=2$ but not for $n \geq 4$, no proof of the characterization of the three-dimensional equality case seems to have ever been published. We fill this gap by showing that the paralle…

The DECam Field of Streams: a deep view of the Milky Way halo
Peter Ferguson, Nora Shipp
https://arxiv.org/abs/2506.05469 https://arx…

The DECam Field of Streams: a deep view of the Milky Way halo
We present a Field of Streams visualizing stellar structures in the Milky Way halo as viewed by the Dark Energy Camera (DECam). We use $g$- and $r$-band imaging from the Dark Energy Survey and the DECam Legacy Survey, covering $18{,}700 °^2$ across the sky. Using an isochrone-based matched filter in $g$ vs. $g-r$, we select old and metal-poor stars in three distance bins, and generate a false-color RGB image of the number density of selected stars. The DECam Field of Streams shows a variety of…

Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds
Rishikesh Srinivasan, Dheeraj Nagaraj
https://arxiv.org/abs/2506.07614

Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds
We study the problem of sampling from strongly log-concave distributions over $\mathbb{R}^d$ using the Poisson midpoint discretization (a variant of the randomized midpoint method) for overdamped/underdamped Langevin dynamics. We prove its convergence in the 2-Wasserstein distance ($W_2$), achieving a cubic speedup in dependence on the target accuracy ($ε$) over the Euler-Maruyama discretization, surpassing existing bounds for randomized midpoint methods. Notably, in the case of underdamped La…

#UK people! I'm planning to take a taxi from Edinburgh airport (to Stirling, so bit longer distance); any companies to avoid and/or tips? I found some websites but they all look similar so I'm just looking for some advice!

Errors in Stereo Geometry Induce Distance Misperception
Raffles Xingqi Zhu, Charlie S. Burlingham, Olivier Mercier, Phillip Guan
https://arxiv.org/abs/2505.23685

Errors in Stereo Geometry Induce Distance Misperception
Stereoscopic head-mounted displays (HMDs) render and present binocular images to create an egocentric, 3D percept to the HMD user. Within this render and presentation pipeline there are potential rendering camera and viewing position errors that can induce deviations in the depth and distance that a user perceives compared to the underlying intended geometry. For example, rendering errors can arise when HMD render cameras are incorrectly positioned relative to the assumed centers of projections…

An isometry theorem for persistent homology of circle-valued functions
Nathan Broomhead, Mariam Pirashvili
https://arxiv.org/abs/2506.02999 https://…

An isometry theorem for persistent homology of circle-valued functions
This paper explores persistence modules for circle-valued functions, presenting a new extension of the interleaving and bottleneck distances in this setting. We propose a natural generalisation of barcodes in terms of arcs on a geometric model associated to the derived category of quiver representations. The main result is an isometry theorem that establishes an equivalence between the interleaving distance and the bottleneck distance for circle-valued persistence modules.

Back home from the U.K.
As I walked through the Boston airport for the 3rd or 4th time yesterday, I realized how many times I've been there thinking "The next trip won't come soon enough". I can make it until September. Long-distance is hard, but I wouldn't want to be with anyone else but my fiance.

Farlington Marshes, near #Portsmsouth UK. #silentsunday #photography #weather

Transverse Distance Estimation with Higher-Order Hermite-Gauss modes
Dilip Paneru, Alessio D'Errico, Ebrahim Karimi
https://arxiv.org/abs/2506.02926 ht…

Transverse Distance Estimation with Higher-Order Hermite-Gauss modes
We explore the use of higher-order Hermite-Gauss modes for sensing optically induced transverse displacements. In the small-displacement regime, we show that projective measurements onto the two neighboring spatial modes yield optimal Fisher information, linearly scaling with the mode order $m$. We further extend the analysis to arbitrary displacement values and derive general expressions for the Fisher information, demonstrating that higher-order modes continue to outperform the fundamental Ga…

Concentration profiles of OH and H$_2$O$_2$ in plasma-treated water: influence of power, gas mixture and treatment distance
Anna Lena Sch\"one, Steffen Sch\"uttler, Talisha Mro{\ss}, Niklas Eichstaedt, Judith Golda, Lars Sch\"ucke, Andrew R. Gibson
https://arxiv.org/abs/2506.03886

Concentration profiles of OH and H$_2$O$_2$ in plasma-treated water: influence of power, gas mixture and treatment distance
Plasma liquid interactions are important for a range of applications. For these, H$_2$O$_2$ and OH represent two key reactive species, whose concentrations in liquids need to be controlled for effective application outcomes. Here, a combination of gas and liquid simulations is used to study the concentration profiles of H$_2$O$_2$ and OH in water treated by a radio-frequency-driven plasma jet, with a glass capillary between the electrodes, operated in He with admixtures of water vapour. Simulat…

Surrogate models for lightcurves and photosphere properties of Type II supernovae
Nikhil Sarin, Takashi J. Moriya, Avinash Singh, Anjasha Gangopadhyay, K-Ryan Hinds, Steve Schulze, Conor M. B. Omand, Kaustav K. Das
https://arxiv.org/abs/2506.02107

Surrogate models for lightcurves and photosphere properties of Type II supernovae
Inferences on the properties Type II supernovae (SNe) can provide significant insights into the lives and deaths of the astrophysical population of massive stars and potentially provide measurements of luminosity distance, independent of the distance ladder. Here, we introduce surrogate models for the photospheric properties and lightcurves of Type II SNe trained on a large grid of simulations from the radiation hydrodynamics code, {\sc stella}. The trained model can accurately and efficiently …

Geodesic transitive graphs of small valency
Jun-Jie Huang
https://arxiv.org/abs/2506.04670 https://arxiv.org/pdf/2506.04670

Geodesic transitive graphs of small valency
For a graph $Γ$, the {\em distance} $d_Γ(u,v)$ between two distinct vertices $u$ and $v$ in $Γ$ is defined as the length of the shortest path from $u$ to $v$, and the {\em diameter} $\mathrm{diam}(Γ)$ of $Γ$ is the maximum distance between $u$ and $v$ for all vertices $u$ and $v$ in the vertex set of $Γ$. For a positive integer $s$, a path $(u_0,u_1,\ldots,u_{s})$ is called an {\em $s$-geodesic} if the distance of $u_0$ and $u_s$ is $s$. The graph $Γ$ is said to be {\em distance transiti…

Generalized nearest-neighbor distance and Hawkes point process modeling applied to mining induced seismicity
Mohammadamin Sedghizadeh, Robert Shcherbakov, Matthew van den Berghe
https://arxiv.org/abs/2506.00768

Generalized nearest-neighbor distance and Hawkes point process modeling applied to mining induced seismicity
Modeling seismic activity rates and clustering plays an important role in studies of induced seismicity associated with mining and other resource extraction operations. This is critical for understanding the physical and statistical characteristics of seismicity and assessing the associated hazard. In this work, we introduce the generalization of the Nearest-Neighbor Distance (NND) method by incorporating an arbitrary distribution function for the frequency-magnitude statistics of seismic event…

This https://arxiv.org/abs/2411.13728 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Distributed Distance Sensitivity Oracles
We present results for the distance sensitivity oracle (DSO) problem, where one needs to preprocess a given directed weighted graph $G=(V,E)$ in order to answer queries about the shortest path distance from $s$ to $t$ in $G$ that avoids edge $e$, for any $s,t \in V, e \in E$. No non-trivial results are known for DSO in the distributed CONGEST model even though it is of importance to maintain efficient communication under an edge failure. We present DSO algorithms with different tradeoffs betwee…

from my link log —
Gradients are the new intervals for signed distance function evaluation.
https://www.mattkeeter.com/blog/2025-05-14-gradients/
saved 2025-05-22

Gordian split links in the Gehring ropelength problem
Friedrich Bauermeister
https://arxiv.org/abs/2506.04644 https://arxiv.org/pdf/2…

Gordian split links in the Gehring ropelength problem
A thick link is a link in Euclidean three-space such that each component of the link lies at distance at least 1 from every other component. Strengthening the notion of thickness, we define a thickly embedded link to be a thick link whose open radius-1/2 normal disk bundles of all components are embedded. The Gehring ropelength problem asks how large the sum of the lengths of the components of a thick (respectively thickly embedded) link must be, given the link homotopy (respectively isotopy) c…

Puzzling radial gradients of K-band absorption features in the giant elliptical galaxy M87
F. La Barbera, A. Vazdekis, A. Pasquali, J. Heidt, E. Eftekhari, M. A. Beasley, A. Gargiulo, S. Bisogni, C. Spiniello, L. P. Cassar\`a, M. Sarzi
https://arxiv.org/abs/2506.05986

Puzzling radial gradients of K-band absorption features in the giant elliptical galaxy M87
We present new K-band spectroscopy for the giant elliptical galaxy M87 in the Virgo cluster, taken with the LUCI spectrograph at the Large Binocular Telescope (LBT). The new data are used to study line-strengths of K-band absorption features from different chemical species, namely Fe, Mg, Ca, Na, and CO, as a function of galactocentric distance, out to 40arcsec from the center (about half of the galaxy effective radius). The radial trends of spectral indices are compared to those for the bulge …

Today’s highlight- see swimming at Chapmans Pool. Water is still quite cold despite the sunshine!
#panorama #Dorset

This https://arxiv.org/abs/2404.19564 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Time, Travel, and Energy in the Uniform Dispersion Problem
We investigate the algorithmic problem of uniformly dispersing a swarm of robots in an unknown, gridlike environment. In this setting, our goal is to study the relationships between performance metrics and robot capabilities. We introduce a formal model comparing dispersion algorithms based on makespan, traveled distance, energy consumption, sensing, communication, and memory. Using this framework, we classify uniform dispersion algorithms according to their capability requirements and performa…

Stability of Mean-Field Variational Inference
Shunan Sheng, Bohan Wu, Alberto Gonz\'alez-Sanz, Marcel Nutz
https://arxiv.org/abs/2506.07856 https://

Stability of Mean-Field Variational Inference
Mean-field variational inference (MFVI) is a widely used method for approximating high-dimensional probability distributions by product measures. This paper studies the stability properties of the mean-field approximation when the target distribution varies within the class of strongly log-concave measures. We establish dimension-free Lipschitz continuity of the MFVI optimizer with respect to the target distribution, measured in the 2-Wasserstein distance, with Lipschitz constant inversely prop…

This https://arxiv.org/abs/2505.24380 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

SASP: Strip-Aware Spatial Perception for Fine-Grained Bird Image Classification
Fine-grained bird image classification (FBIC) is not only of great significance for ecological monitoring and species identification, but also holds broad research value in the fields of image recognition and fine-grained visual modeling. Compared with general image classification tasks, FBIC poses more formidable challenges: 1) the differences in species size and imaging distance result in the varying sizes of birds presented in the images; 2) complex natural habitats often introduce strong ba…

This https://arxiv.org/abs/2407.01101 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Packing Density of Sets With Only Two Nonmixed Gaps
For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the corresponding optimal density, conjecture its tightness, and prove it in case one of the gap lengths, $a$ or $b$, appears only once. This is equivalent to a Motzkin problem on the independence ratio of certain integer distance graphs.

This https://arxiv.org/abs/2410.11968 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Codes on Weighted Projective Planes
We comprehensively study weighted projective Reed-Muller (WPRM) codes on weighted projective planes $\mathbb{P}(1,a,b)$. We provide the universal Gröbner basis for the vanishing ideal of the set $Y$ of $\mathbb{F}_q$--rational points of $\mathbb{P}(1,a,b)$ to get the dimension of the code. We determine the regularity set of $Y$ using a novel combinatorial approach. We employ footprint techniques to compute the minimum distance.

Centaur Nuclei: Sizes, Shapes, Spins, and Structure
Y. R. Fernandez, M. W. Buie, P. Lacerda, R. Marschall
https://arxiv.org/abs/2506.04483 https://

Centaur Nuclei: Sizes, Shapes, Spins, and Structure
We present a wide-ranging but in-depth analysis of Centaurs, focusing on their physical and structural aspects. Centaurs, originating from the Scattered Disk and Kuiper Belt, play a crucial role in our understanding of Solar System evolution. We first examine how biases in discovery and measurement affect our understanding of the Centaur size distribution. In particular we address the strong dependence of the census on perihelion distance and the broad distribution of Centaur geometric albedos.…

Good morning from Harlem
#Photography #GoodMorning #Sunrise #NYC

Mitigation of the Flexing-Filtering Effect in Time-Delay Interferometry
Shivani Harer, Martin Staab, Hubert Halloin
https://arxiv.org/abs/2506.04316 https:…

Mitigation of the Flexing-Filtering Effect in Time-Delay Interferometry
In early 2024, ESA formally adopted the Laser Interferometer Space Antenna (LISA) space mission with the aim of measuring gravitational waves emitted in the millihertz range. The constellation employs three spacecraft that exchange laser beams to form interferometric measurements over a distance of 2.5 million kilometers. The measurements will then be telemetered down to Earth at a lower sampling frequency. Anti-aliasing filters will be used on board to limit spectral folding of out-of-band las…

TSA Working on Haptic Tech To 'Feel' Your Body in Virtual Reality https://www.404media.co/tsa-working-on-haptic-tech-to-feel-your-body-in-virtual-reality/

Donald Trump recently said Canada could freely participate in his Golden Dome in exchange for annexation. The US president’s post came on the heels of Mark Carney expressing interest in the missile ‘defense’ initiative, betraying his election promise to distance Canada from the US.
Take a minute to email Carney and defence minister David McGuinty to reject Canadian participation in Trump’s Golden Dome.

On families of Finsler metrics
Ismail Saglam (IRMA), Ken'Ichi Ohshika (IRMA), Athanase Papadopoulos (IRMA)
https://arxiv.org/abs/2506.03749 https://

On families of Finsler metrics
In this paper, we answer some natural questions on symmetrisation and more general combinations of Finsler metrics, with a view towards applications to Funk and Hilbert geometries and to metrics on Teichm{ü}ller spaces. For a general non-symmetric Finsler metric on a smooth manifold, we introduce two different families of metrics, containing as special cases the arithmetic and the max symmetrisations respectively of the distance functions associated with these Finsler metrics. We are intereste…

woo! #FuckAndrewCuomo

This https://arxiv.org/abs/2501.09622 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning
Hypergraph products are quantum low-density parity-check (LDPC) codes constructed from two classical LDPC codes. Although their dimension and distance depend only on the parameters of the underlying classical codes, optimizing their performance against various noise channels remains challenging. This difficulty partly stems from the complexity of decoding in the quantum setting. The standard, ad hoc approach typically involves selecting classical LDPC codes with large girth. In this work, we fo…

Natura Urbana VIII 🏡
城市自然 VIII 🏡
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

This https://arxiv.org/abs/2504.08472 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Simultaneous Rational Number Codes: Decoding Beyond Half the Minimum Distance with Multiplicities and Bad Primes
In this paper, we extend the work of (Abbondati et al., 2024) on decoding simultaneous rational number codes by addressing two important scenarios: multiplicities and the presence of bad primes (divisors of denominators). First, we generalize previous results to multiplicity rational codes by considering modular reductions with respect to prime power moduli. Then, using hybrid analysis techniques, we extend our approach to vectors of fractions that may present bad primes. Our contributions incl…

On the Gromov-Hausdorff distance between the cloud of bounded metric spaces and a cloud with nontrivial stabilizer
B. A. Nesterov
https://arxiv.org/abs/2505.23563

On the Gromov-Hausdorff distance between the cloud of bounded metric spaces and a cloud with nontrivial stabilizer
The paper studies the class of all metric spaces considered up to zero Gromov-Hausdorff distance between them. In this class, we examine clouds - classes of spaces situated at finite Gromov-Hausdorff distances from a reference space. We prove that all clouds are proper classes. The Gromov-Hausdorff distance is defined for clouds similarly with the case of that for metric spaces. A multiplicative group of transformations of clouds is defined which is called stabilizer. We show that under certain…

This https://arxiv.org/abs/2310.00940 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

1-planar unit distance graphs
A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n - 3}\rfloor$ edges. Recently, his conjecture was settled by Lavollée and Swanepoel. In this paper we consider $1$-planar unit distance graphs. We say that a graph is a $1$-planar unit distance graph if it can be drawn in the plane such that all edges are drawn as unit…

Analysis of Jet Dynamics and Collimation Characteristics of 0241 622 on Parsec Scales
Haitian Shang, Wei Zhao, Xiaoyu Hong, Xu-zhi Hu
https://arxiv.org/abs/2506.04661

Analysis of Jet Dynamics and Collimation Characteristics of 0241+622 on Parsec Scales
We conducted a detailed analysis of the jet structure and dynamics of the source 0241+622 on milliarcsecond (mas) scales. We stacked images from multiple epochs to better recover the crosssection of the jet. By analyzing the relationship between jet width and distance, we observed that the jet exhibits a parabolic shape from the core, spanning a region from 0.12 to 6.1 mas. This structure suggests the acceleration and collimation processes of the jet. Beyond 18 mas from the core, the jet adopts…

This https://arxiv.org/abs/2505.08467 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

The matter with(in) CPL
We introduce a two-parameter phenomenological extension of the $Λ$CDM model in which the equation of state parameter of the ``dust'' fluid becomes different from zero for redshifts below a transition value $z_t$. Using data from DESI DR2 BAO, DESY5 Sn~Ia and CMB distance priors ($R,l_A,ω_b$) data, we compare our model with the standard CPL parameterization $w_0-w_a$ for dynamical dark energy. Using the Deviance Information Criteria (DIC), we find that the two models are essentially indistingu…

fullerene_structures: Fullerene molecular structures
Fifteen networks of carbon atoms and the atomic bonds that connect them within molecules of fullerenes, from 60 atoms up to 6000 atoms. A bond is defined to exist whenever the distance of two atoms is less than 1.5 angstrom.
This network has 960 nodes and 1440 edges.
Tags: Biological, Chemical, Unweighted, Spatial

This https://arxiv.org/abs/2310.13245 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

MultiDLO: Simultaneous Shape Tracking of Multiple Deformable Linear Objects with Global-Local Topology Preservation
MultiDLO is a real-time algorithm for estimating the shapes of multiple, intertwining deformable linear objects (DLOs) from RGB-D image sequences. Unlike prior methods that track only a single DLO, MultiDLO simultaneously handles several objects. It uses the geodesic distance in the Global-Local Topology Preservation algorithm to define both inter-object identity and intra-object topology, ensuring entangled DLOs remain distinct with accurate local geometry. The MultiDLO algorithm is demonstrat…

Hi friends!
I set my alarm to 5am and headed out for a nice walk. It was getting warm, so I started early. - and it was just so good to do so!
A nice 6h walk with lots of views, lots of photos and just enjoying being out. End the #summit just for me 😍
On the way up I noted all places where I could refuel later using my water filter. Seriously: why didn't I buy that waaays ear…

This https://arxiv.org/abs/2505.12240 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Dynamics and leapfrogging phenomena of multiple helical vortices for 3D incompressible Euler equations
In this paper, we investigate the time evolution of multiple interacted helical vortices without swirl for the incompressible Euler equations in $\mathbb R^3$. Assuming that the initial helical symmetric vorticity is concentrated within an $\ep$ neighborhood of $N$ distinct helices with vanishing mutual distance of order $O(\frac{1}{|\ln \ep|})$, and each vortex core possesses a vorticity mass of order $O(\frac{1}{|\ln \ep|^2})$, we show that as $\ep\to 0$, the motion of the…

Virtual Polarization Elements for Spatially Varying Jones Matrix Transformations on a Free-Space Plane
Mingyue Wang (Department of Physics, Xiamen University, Xiamen, China), Jiayuan Wang (Department of Physics, Xiamen University, Xiamen, China, Shenzhen Research Institute of Xiamen University, Shenzhen, China)
https://arxiv.org…

Virtual Polarization Elements for Spatially Varying Jones Matrix Transformations on a Free-Space Plane
Precise control over the spatial and polarization properties of light is foundational for advanced photonic systems, yet most conventional approaches are constrained to local, contact-based manipulation at physical interfaces. To overcome these constraints, here we introduce a fundamentally new framework for action-at-a-distance polarization control using virtual polarization elements (VPEs). VPEs apply prescribed local Jones matrix transformations between an input field at the modulation plane…

Extending near-axis equilibria in DESC
Dario Panici, Eduardo Rodriguez, Rory Conlin, Daniel Dudt, Egemen Kolemen
https://arxiv.org/abs/2506.05170 https://

Extending near-axis equilibria in DESC
The near-axis description of optimised stellarator fields has proven to be a powerful tool both for design and understanding of this magnetic confinement concept. The description consists of an asymptotic model of the equilibrium in the distance from its centermost axis, and is thus only approximate. Any practical application therefore requires the eventual construction of a global equilibrium. This paper presents a novel way of constructing global equilibria using the \texttt{DESC} code that g…

2-Homogeneous bipartite distance-regular graphs and the quantum group $U^\prime_q(\mathfrak{so}_6)$
Paul Terwilliger
https://arxiv.org/abs/2506.02190 https…

2-Homogeneous bipartite distance-regular graphs and the quantum group $U^\prime_q(\mathfrak{so}_6)$
We consider a 2-homogeneous bipartite distance-regular graph $Γ$ with diameter $D \geq 3$. We assume that $Γ$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $Γ$. This $Q$-polynomial ordering is described using a nonzero parameter $q \in \mathbb C$ that is not a root of unity. We investigate $Γ$ using an $S_3$-symmetric approach. In this approach one considers $V^{\otimes 3} = V \otimes V \otimes V$ where $V$ is the standard module of $Γ$. W…

Chicago-Carnegie Hubble Program (CCHP) A Multi-Wavelength Search for the Effects of Metallicity on the Cepheid Distance Scale. Part II: Theoretical Models and Synthetic Spectra
Barry F. Madore, Wendy L. Freedman, Kayla Owens
https://arxiv.org/abs/2506.01188

Chicago-Carnegie Hubble Program (CCHP) A Multi-Wavelength Search for the Effects of Metallicity on the Cepheid Distance Scale. Part II: Theoretical Models and Synthetic Spectra
This is the second of two papers exploring the effects of metallicity on the multi-wavelength properties of Cepheids in terms of their multi-wavelength period-luminosity (PL) relations, impacting their use as extragalactic distance indicators, underpinning one of the most popular paths to estimating of the expansion rate of the Universe, Ho. In Paper I (Madore & Freedman 2024) we presented five tests for the influence of metallicity on galactic and extragalactic Cepheid PL relations, spanning n…

Not every graph can be reconstructed from its boundary distance matrix
Jos\'e C\'aceres, Ignacio M. Pelayo
https://arxiv.org/abs/2506.02652 https:/…

Not every graph can be reconstructed from its boundary distance matrix
A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$, no neighbor of $v$ is further away from $u$ than $v$. The boundary $\partial(G)$ of $G$ is the set of all of its boundary vertices. The boundary distance matrix $\hat{D}_G$ of a graph $G=([n],E)$ is the square matrix of order $κ$, being $κ$ the order of $\partial(G)$, such that for every $i,j\in \partial(G)$, $[\hat{D}_G]_{ij}=d_G(i,j)$. In a recent paper [doi.org/10.7151/dmgt…

This https://arxiv.org/abs/2411.04846 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

On the Complexity of 2-club Cluster Editing with Vertex Splitting
Editing a graph to obtain a disjoint union of s-clubs is one of the models for correlation clustering, which seeks a partition of the vertex set of a graph so that elements of each resulting set are close enough according to some given criterion. For example, in the case of editing into s-clubs, the criterion is proximity since any pair of vertices (in an s-club) are within a distance of s from each other. In this work we consider the vertex splitting operation, which allows a vertex to belong …

This https://arxiv.org/abs/2411.09740 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

Type Ia supernovae
Type Ia supernovae (SNe Ia) correspond to the thermonuclear explosion of a carbon-oxygen white dwarf (C-O WD) star in a binary system, triggered by the accretion of material from another star, or the merger/collision with a secondary WD. Their phenomenal luminosity -- several billion times that of the sun -- has motivated their use as cosmological distance indicators and led to the discovery of the accelerated expansion of the universe. SNe Ia are also the main producers of iron and hence play …

fullerene_structures: Fullerene molecular structures
Fifteen networks of carbon atoms and the atomic bonds that connect them within molecules of fullerenes, from 60 atoms up to 6000 atoms. A bond is defined to exist whenever the distance of two atoms is less than 1.5 angstrom.
This network has 960 nodes and 1440 edges.
Tags: Biological, Chemical, Unweighted, Spatial

Additive codes from linear codes
Simeon Ball, Tabriz Popatia
https://arxiv.org/abs/2506.03805 https://arxiv.org/pdf/2506.03805…

Additive codes from linear codes
We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good.

Good morning from Harlem
#Photography #GoodMorning #Sunrise #NYC

This https://arxiv.org/abs/2505.17370 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

FRIREN: Beyond Trajectories -- A Spectral Lens on Time
Long-term time-series forecasting (LTSF) models are often presented as general-purpose solutions that can be applied across domains, implicitly assuming that all data is pointwise predictable. Using chaotic systems such as Lorenz-63 as a case study, we argue that geometric structure - not pointwise prediction - is the right abstraction for a dynamic-agnostic foundational model. Minimizing the Wasserstein-2 distance (W2), which captures geometric changes, and providing a spectral view of dynamic…

This https://arxiv.org/abs/2505.19945 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Signed Angle Rigid Graphs for Network Localization and Formation Control
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation control. In recent years, the traditional rigidity theory has been extended by considering new types of local constraints such as bearing, angle, ratio of distance, etc. Among them, the signed angle constraint received extensive attention since it is practic…

This https://arxiv.org/abs/2407.09206 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Cooperative Indoor Exploration Leveraging a Mixed-Size UAV Team with Heterogeneous Sensors
Heterogeneous teams of Unmanned Aerial Vehicles (UAVs) can enhance the exploration capabilities of aerial robots by exploiting different strengths and abilities of varying UAVs. This paper presents a novel method for exploring unknown indoor spaces with a team of UAVs of different sizes and sensory equipment. We propose a frontier-based exploration with two task allocation strategies: a greedy strategy that assigns Points of Interest (POIs) based on Euclidean distance and UAV priority and an op…

Hi friends!
I set my alarm to 5am and headed out for a nice walk. It was getting warm, so I started early. - and it was just so good to do so!
A nice 6h walk with lots of views, lots of photos and just enjoying being out. End the #summit just for me 😍
On the way up I noted all places where I could refuel later using my water filter. Seriously: why didn't I buy that waaays ear…

Distance to the Galactic centre 7$^\prime$ halo from HI absorption
Debangan Maji, Subhashis Roy
https://arxiv.org/abs/2506.02799 https://

Distance to the Galactic centre 7$^\prime$ halo from HI absorption
Using archival data, we have made an HI absorption study of the 7$^\prime$ halo surrounding the Sgr A complex, observed towards the Galactic centre (GC) region. We find strong HI absorption near velocities of $-$53 km s$^{-1}$, which is due to the 3-kpc arm, placing it beyond 5 kpc from us. We further examined the HI absorption properties towards 5 different parts of the 7$^\prime$ halo. Absorption by +50 km s$^{-1}$ GC cloud is seen towards only 3 parts of the halo, but not towards the other 2…

Rigorous theory of coupled resonators
E. A. Muljarov
https://arxiv.org/abs/2506.04413 https://arxiv.org/pdf/2506.04413

Rigorous theory of coupled resonators
We demonstrate the general failure of the famous concept of tight binding and mode hybridization underlying modern theories of coupled open resonators. In spite of sophisticated examples in the literature, successfully illustrating these theories, the latter fail to describe any planar systems. This includes the simplest possible case of two dielectric slabs placed next to each other or separated by a distance, which is straightforward for verification, due to its analytical solvability. We pre…

An independent estimate of H(z) at z = 0.5 from the stellar ages of brightest cluster galaxies
S. Ilani Loubser, Adebusola B. Alabi, Matt Hilton, Yin-Zhe Ma, Xin Tang, Narges Hatamkhani, Catherine Cress, Rosalind E. Skelton, S. Andile Nkosi
https://arxiv.org/abs/2506.03836

An independent estimate of H(z) at z = 0.5 from the stellar ages of brightest cluster galaxies
Several cosmological observations (e.g., Cosmic Microwave Background (CMB), Supernovae Type Ia, and local distance ladder measurements such as Cepheids) have been used to measure the global expansion rate of the Universe, i.e., the Hubble constant, $H_{0}$. However, these precision measurements have revealed tensions between different probes that are proving difficult to solve. Independent, robust techniques must be exploited to validate results or mitigate systematic effects. We use the Cosmic…

This https://arxiv.org/abs/2505.23378 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLG_…

Meta-Learning Approaches for Speaker-Dependent Voice Fatigue Models
Speaker-dependent modelling can substantially improve performance in speech-based health monitoring applications. While mixed-effect models are commonly used for such speaker adaptation, they require computationally expensive retraining for each new observation, making them impractical in a production environment. We reformulate this task as a meta-learning problem and explore three approaches of increasing complexity: ensemble-based distance models, prototypical networks, and transformer-based…

Good morning from Harlem
#Photography #GoodMorning #Sunrise #NYC

This https://arxiv.org/abs/2411.06177 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The number of trees in distance-hereditary graphs and their friends
Counting the number of spanning trees in specific classes of graphs has attracted increasing attention in recent years. In this note, we present unified proofs and generalizations of several results obtained in the 2020s. The main method is to study the behavior of the vertex (degree) enumerator of a distance-hereditary graph under the operations of copying vertices. Ehrenborg conjecture says that a Ferrer--Young graph maximizes the number of spanning trees among bipartite graphs with the sam…

The structural and kinematical properties of NGC 5634, a globular cluster associated with the Sagittarius dwarf galaxy?
Shouzhi Wang, Jundan Nie, Biwei Jiang, Hao Tian, Chao Liu, Ying-Hua Zhang
https://arxiv.org/abs/2506.04806

The structural and kinematical properties of NGC 5634, a globular cluster associated with the Sagittarius dwarf galaxy?
We investigate the origin of NGC 5634 through a comprehensive analysis of its morphology, kinematics and dynamics. Utilizing data from the DESI Legacy Survey, we refined its fundamental parameters (age t = 12.8 +/- 0.3 Gyr, metallicity [Fe/H] = -1.8 +/- 0.1 dex, distance modulus dm = 17.0 +/- 0.1 mag) and constructed matched-filter template based on the combination of these parameters to search for extra-tidal structures. However, no significant features were detected above a 3 sigma signal-to-…

This https://arxiv.org/abs/2407.01227 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Non-intersecting paths and the determinant of the distance matrix of a tree
We present the first combinatorial proof of the Graham-Pollak Formula for the determinant of the distance matrix of a tree, via sign-reversing involutions and the Lindström-Gessel-Viennot Lemma. Our approach provides a cohesive and unified framework for the understanding of the existing generalizations and $q$-analogues of the Graham-Pollak Formula, and facilitates the derivation of a natural simultaneous generalizations for them.