Tootfinder

Google: KI-Bug-Bounty-Programm zahlt bis zu 30.000 US-Dollar pro Fehler
Google führt ein Bug-Bounty-Programm für KI-Anwendungen ein. Entdecker schwerwiegender Fehler in Gemini oder der KI-Suche erhalten Belohnungen.

Very cool, received a fake product ordering on walmart.com from a 3rd-party seller.
Amazon and Walmart seem to be in a race to the bottom to ruin their reputations.
I have to say that Amazon's customer support is way better when you're a victim of fraud.

RE: https://mastodon.social/@Viss/115670725187255890
Sounds like a good idea to me. :elmo_fire:

Mixed identities in linear groups -- effective version
Nir Avni, Tsachik Gelander
https://arxiv.org/abs/2510.03492 https://arxiv.org/pdf/2510.03492

Mixed identities in linear groups -- effective version
We show that MIF (mixed-identity-free) linear groups are sharply MIF and linearly MIF. Along the way we provide a self contained proof of the strong approximation theorem, and a new (probabilistic) variant of the super approximation theorem.

Christian therapist Kaley Chiles
wants the Supreme Court to rule
that
Christian therapists’ free speech rights outweigh a law that bans therapy aimed at changing a minor’s sexual identity.
The case could affect laws in nearly 30 states.
https://www.was…

Christian therapist seeks right to counsel gay teens to change feelings
The Supreme Court will consider whether therapists’ free speech rights outweigh a law that bans therapy that seeks to change sexual identity. Almost 30 states have such bans.

[2025-10-06 Mon (UTC), 3 new articles found for cs.CE Computational Engineering, Finance, and Science]
toXiv_bot_toot

A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios
Sukanya Samanta, Manohar Reddy
https://arxiv.org/abs/2510.04050 https://ar…

A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios
The interdiction of escaping adversaries in urban networks is a critical security challenge. State-of-the-art game-theoretic models, such as the Escape Interdiction Game (EIG), provide comprehensive frameworks but assume a highly dynamic interaction and entail significant computational complexity, which can be prohibitive for real-time applications. This paper investigates a crucial sub-problem: an evader's optimal pathfinding calculus when faced with a static or pre-determined defender deploym…

TIL: Offizielle Öffnungszeiten der Ruhr-Uni Bochum @… sind 6:30-18:30 Uhr. Ich kenne einige Nerds (lieb gemeint), deren Arbeitszeiten bildet das so gar nicht ab 😭
#bochum

How revenue decisions shape #technicaldebt
https://www.hyperact.co.uk/blog/how-revenue-decisions-shape-technical-debt

Trump says backpay for furloughed workers 'depends on who we're talking about' (Brett Samuels/The Hill)
https://thehill.com/homenews/administration/5543148-trump-furloughed-workers-backpay/
http://www.memeorandum.com/251007/p90#a251007p90

#Apple macht sich lieber weiterhin lächerlich als sich an Regeln zu halten #DMA #DSA
Apple kündigt an, dass Apple Watch und iPhone in Europa erstmals eine Funktion verlieren werden

Ein Denkmal für Überlebende: „Petrified Survivors“ im Wedding https://weddingweiser.de/ein-denkmal-fuer-ueberlebende-petrified-survivors-im-wedding/

My nephew asked for a computer that has an optical drive. I brought the only one that I owned to him. (It is not new.) He said that he thought that I would set it up for him. I told him to Google it, and he replied that he can't Google things that he doesn't already know. 🤨

Well, I'm glad to get to read it.
And...it's about time! Sort of. https://mastodon.social/@mcnees/115658968458071381

Nationwide protest: Stand up for Gaza
National protests on October 12 mark two years of Israel's genocide. They will demand Labor sanctions Israel, ends the two-way arms trade and expels the Israeli ambassador.
More locations added:
Saturday October 11
- Cavanbah (Byron Bay)
2pm: Railway Park
- Blue Mountains
12pm-1pm, Katoomba Steet, underneath the old library
Sunday October 12
- Albany
11am, Albany Peace Park
- Armidale

#idw #Gaza, #Israel und Deutschlands Außenpolitik: ein Meinungsbild. Prof. Dr. Thomas Richter (GIGA) und Prof. Dr. Christine Binzel (Friedrich-Alexander Universität Erlangen-Nürnberg) haben die wichtigsten Studienergebnisse j…

Gaza, Israel und Deutschlands Außenpolitik: ein Meinungsbild

Scorability, a college sports recruiting marketplace for athletes and coaches, raised $40M led by Bluestone Equity Partners, bringing its total funding to $51M (Jessica Golden/CNBC)
https://www.cnbc.com/2025/09/30/scorability…

Startup Scorability wants to revolutionize college sports recruiting as NIL takes off
Scorability now boasts 1.2 million athletes and 3,000 college sports program users.

Replaced article(s) found for math.GT. https://arxiv.org/list/math.GT/new
[1/1]:
- Nu-invariants of extra-twisted connected sums
Sebastian Goette, Johannes Nordstr\"om, Don Zagier

Denmark, train, snow, suit, work trip?
Maybe I should cut my melatonin down a bit

🔊 #NowPlaying on #BBCRadio3:
#Breakfast
- Rise and shine with classical music
Hannah French presents Radio 3's Breakfast show. To get in touch, email 3breakfast@bbc.co.uk.
Relisten now 👇
https://www.bbc.co.uk/programmes/m002mw2g

Kann irgendjemand erläutern, ob hinter dem Motics-Standard irgendein legitimes Bedürfnis steht, das ich nicht erkenne? Oder ist das tatsächlich einfach Bullshit?

In Baden-Württemberg könnten laut Forschenden der Uni Frankfurt jährlich rund 30 Tonnen des extrem klimaschädlichen Gases #SF6 entweichen.
Das Gas wird zur Isolierung in #Transformatoren genutzt. Trotz auffälliger Messwerte bezweifeln

Baden-Württemberg: Forscher finden Hinweis auf Treibhausgas-Leck
In Baden-Württemberg entweichen offenbar Dutzende Tonnen eines klimaschädlichen Gases - Forschende warnen, Behörden und der mutmaßliche Verursacher wiegeln derweil ab.

I am liking London a lot. But it sure is hard getting around. Everything I want to see in central London is a 20-30 minute walk: great! But if you don't want to walk, it's also a 20-30 minute cab ride (traffic) or 20-30 minute bus/underground. Bicycles are probably the answer.

The office on Friday

Characteristic Subgroup Growth
Liam Hanany, Alexander Lubotzky
https://arxiv.org/abs/2510.04150 https://arxiv.org/pdf/2510.04150

Characteristic Subgroup Growth
Let $s_n^\mathrm{ch}(Γ)$ denote the number of characteristic subgroups of index at most $n$ in a finitely generated group $Γ$. In response to a question of I. Rivin we show that if $Γ= F_r$ is the free group on $r \geq 2$ generators then the growth type of $s_n^{\mathrm{ch}}(F_r)$ is $n^{\mathrm{log}(n)}$. This is in contrast with the expectation of W. Thurston who predicted that there should be a difference between $r = 2$ and $r > 2$. Along the way we answer a question of arXiv:1703.07866 …

You Want Microservices, But Do You Really Need Them?
https://www.docker.com/blog/do-you-really-need-microservices/

Blühender Mittelstreifen auf der Togostraße

Replaced article(s) found for cs.CE. https://arxiv.org/list/cs.CE/new
[1/1]:
- Elasto-acoustic wave propagation in geophysical media using hybrid high-order methods on general ...
Romain Mottier, Alexandre Ern, Laurent Guillot

Crosslisted article(s) found for math.GT. https://arxiv.org/list/math.GT/new
[1/1]:
- The geometry of subgroups of mapping tori of free groups
Marco Linton
http…

Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
Herman, Ozgul, Apte, Kim, Prakash, Shen, Chakrabarti

🔊 #NowPlaying on #BBCRadio3:
#EssentialClassics
- The ideal mix of classical music
Georgia Mann plays the best in classical music, with discoveries and surprises rubbing shoulders with familiar favourites.
Relisten now 👇
https://www.bbc.co.uk/programmes/m002ldsr

Der #VDIK rechnet für 2026 mit bis zu 740.000 neuen #Elektroautos, fast 30 Prozent mehr als 2025.
Voraussetzung sei eine rückwirkende #Förderung ab Jahresbeginn sowie wettbewerbsfähige

Förderung ab Januar könnte laut VDIK den E-Autoverkauf um ein Drittel steigern
Knapp ein Drittel mehr E-Autoverkäufe erwartet der VDIK für 2026, falls die Förderung ab Beginn des Jahres gezahlt wird. Auch eine Strompreissenkung sei nötig.

Bericht: Musks SpaceX spricht von Börsengang 2026
SpaceX von Elon Musk ist unverzichtbar für das US-Weltraumprogramm. Medienberichten zufolge ist ein Börsengang geplant.
https://www.heise.de/…

A supercharacter analog of vanishing-off subgroups and generalized Camina pair
Fahim Sayed
https://arxiv.org/abs/2510.03945 https://arxiv.org/pdf/2510.0394…

A supercharacter analog of vanishing-off subgroups and generalized Camina pair
Vanishing-off subgroups, generalized Camina pair and other related subgroups have played a significant role in the study of group structure. The primary goal of this paper is to study their analogs in the setting of supercharacter theory. We establish several properties of these subgroups which includes connections with supercharacter theory products.

Crosslisted article(s) found for cs.CE. https://arxiv.org/list/cs.CE/new
[1/1]:
- Fully automated inverse co-optimization of templates and block copolymer blending recipes for DSA...
Yuhao Zhou, Huangyan Shen, Qingliang Song, Qingshu Dong, Jianfeng Li, Weihua Li

A note on the topology of Lefschetz fibrations
Sierra Knavel
https://arxiv.org/abs/2510.03173 https://arxiv.org/pdf/2510.03173

A note on the topology of Lefschetz fibrations
We prove an upper bound for the first Betti number of a nontrivial genus-$g$ Lefschetz fibration. We also show that if the monodromy of a Lefschetz fibration is transitive with respect to the mapping class group, the Lefschetz fibration is simply connected. Lastly, we discuss a potential family of indecomposable genus-2 Lefschetz fibrations with maximally non-trivial first homology which would be candidates for large fundamental group computations, if they exist.

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten
https://arxiv.org/abs/2510.04918 https://

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
We study the space complexity of estimating the diameter of a subset of points in an arbitrary metric space in the dynamic (turnstile) streaming model. The input is given as a stream of updates to a frequency vector $x \in \mathbb{Z}_{\geq 0}^n$, where the support of $x$ defines a multiset of points in a fixed metric space $M = ([n], \mathsf{d})$. The goal is to estimate the diameter of this multiset, defined as $\max\{\mathsf{d}(i,j) : x_i, x_j > 0\}$, to a specified approximation factor while…

HNN extensions of free groups with equal associated subgroups of finite index: polynomial time word problem
Hanwen Shen, Alexander Ushakov
https://arxiv.org/abs/2510.03801 https…

HNN extensions of free groups with equal associated subgroups of finite index: polynomial time word problem
Let $G=F\ast_φt$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case where the subgroups $H_1=H_2$ are not normal, provided that the isomorphism $φ:H_1\to H_2$ satisfies an additional condition described in Section 5.

Noch einige der zuletzt hier besonders häufig geteilten #News:
Zu Nikolaus: NIS2-Umsetzungsgesetz tritt in Kraft
https://www.

Coprime commutators in profinite groups
Cristina Acciarri, Pavel Shumyatsky
https://arxiv.org/abs/2510.03754 https://arxiv.org/pdf/2510.03754

Coprime commutators in profinite groups
By a coprime commutator in a profinite group $G$ we mean any element of the form $[x, y]$, where $x,y\in G$ and $(|x|,|y|)=1$. It is well-known that the subgroup generated by the coprime commutators of $G$ is precisely the pronilpotent residual $γ_\infty(G)$. There are several recent works showing that finiteness conditions on the set of coprime commutators have strong impact on the properties of $γ_\infty(G)$ and, more generally, on the structure of $G$. In this paper we …

Can LLMs Hit Moving Targets? Tracking Evolving Signals in Corporate Disclosures
Chanyeol Choi, Jihoon Kwon, Minjae Kim
https://arxiv.org/abs/2510.03195 https://

Can LLMs Hit Moving Targets? Tracking Evolving Signals in Corporate Disclosures
Moving targets -- managers' strategic shifting of key performance metrics when the original targets become difficult to achieve -- have been shown to predict subsequent stock underperformance. However, our work reveals that the method employed in that study exhibits two key limitations that hinder the accuracy -- noise in the extracted targets and loss of contextual information -- both of which stem primarily from the use of a named entity recognition (NER). To address these two limitations, we…

Non-Simple knots in Contact 3-Manifolds
Ipsita Datta, Tanushree Shah
https://arxiv.org/abs/2510.02932 https://arxiv.org/pdf/2510.02932

Non-Simple knots in Contact 3-Manifolds
We present new families of examples of non-simple prime Legendrian and transversal knots in tight Lens spaces, which demonstrate that the botany of Legendrians in Lens space is rich. In fact, there are more non-isotopic Legendrians that are topologically isotopic to the $n$-twist knot in a Lens space $L(α, β)$ than in $S^3$. We also include connect sum formulas for rational variants of classical invariants, $\mathrm{tb}_\mathbb{Q}$, $\mathrm{rot}_\mathbb{Q}$, and $\mathrm{sl}_\mathbb{Q}$, whi…

Online Multiple Resource Allocation Problems with Departures via the Primal-Dual Approach
Yusuf Amidu, Khaled Elbassioni, Adriana F. Gabor
https://arxiv.org/abs/2510.04737 https…

Online Multiple Resource Allocation Problems with Departures via the Primal-Dual Approach
In this paper we propose primal-dual algorithms for different variants of the online resource allocation problem with departures. In the basic variant, requests (items) arrive over time to a set of resources (knapsacks) and upon arrival, the duration of time a request may occupy a resource, the demand and reward if the request can be granted, become known. %We assume that the duration of stay of a request may depend on the resource. %and that resources may have different capacity sizes. The goa…

Einige der zuletzt hier besonders häufig geteilten #News:
Berlin: Polizei darf Wohnungen zur Staatstrojaner-Installation heimlich betreten

Conformal dimension bounds, Pontryagin sphere boundaries, and algebraic fibering of right-angled Coxeter groups
Christopher H. Cashen, Pallavi Dani, Kevin Schreve, Emily Stark
https://arxiv.org/abs/2510.03430

Conformal dimension bounds, Pontryagin sphere boundaries, and algebraic fibering of right-angled Coxeter groups
We introduce a graph-theoretic condition, called $(n,m)$--branching, that ensures a combinatorial round tree with controlled branching parameters can be quasi-isometrically embedded in the Davis complex of the right-angled Coxeter group defined by the graph. This construction yields a lower bound on the conformal dimension of the boundary of such a hyperbolic group. We exhibit numerous families of graphs with this property, including many 1-dimensional spherical buildings. We prove an embeddi…

VisitHGNN: Heterogeneous Graph Neural Networks for Modeling Point-of-Interest Visit Patterns
Lin Pang, Jidong J. Yang
https://arxiv.org/abs/2510.02702 https://

VisitHGNN: Heterogeneous Graph Neural Networks for Modeling Point-of-Interest Visit Patterns
Understanding how urban residents travel between neighborhoods and destinations is critical for transportation planning, mobility management, and public health. By mining historical origin-to-destination flow patterns with spatial, temporal, and functional relations among urban places, we estimate probabilities of visits from neighborhoods to specific destinations. These probabilities capture neighborhood-level contributions to citywide vehicular and foot traffic, supporting demand estimation, …

Generalised Kauffman Clock Theorems
Nguyen Thanh Tung Le, Daniel V. Mathews
https://arxiv.org/abs/2510.02911 https://arxiv.org/pdf/2510.02911

Generalised Kauffman Clock Theorems
Kauffman's clock theorem provides a distributive lattice structure on the set of states of a four-valent graph in the plane. We prove two distinct generalisations of this theorem, for four-valent graphs embedded in more general compact oriented surfaces. The proofs use results of Propp providing distributive lattice structures on matchings on bipartite plane graphs, and orientations of graphs with fixed circulation.

Streaming Max-Cut in General Metrics
Shaofeng H. -C. Jiang, Pan Peng, Haoze Wang
https://arxiv.org/abs/2510.04435 https://arxiv.org/pdf/2510.04435

Streaming Max-Cut in General Metrics
Max-Cut is a fundamental combinatorial optimization problem that has been studied in various computational settings. In this work, we initiate the study of its streaming complexity in general metric spaces with access to distance oracles. We give a $(1 + ε)$-approximation algorithm for estimating the Max-Cut value sliding-window streams using only poly-logarithmic space. This is the first sliding-window algorithm for Max-Cut even in Euclidean spaces, and it achieves a similar error-space trade…

[2025-10-07 Tue (UTC), 6 new articles found for math.GR Group Theory]
toXiv_bot_toot

Studie: Bundesverwaltung soll bei generativer KI auf Eigenentwicklungen setzen
Bundesbehörden können laut einer Fraunhofer-Analyse bei großen Sprachmodellen viele austauschbare, Open-Source-basierte Lösungen jenseits von ChatGPT nutzen.

Heterogeneous Graph Representation of Stiffened Panels with Non-Uniform Boundary Conditions and Loads
Yuecheng Cai, Jasmin Jelovica
https://arxiv.org/abs/2510.02472 https://

Heterogeneous Graph Representation of Stiffened Panels with Non-Uniform Boundary Conditions and Loads
Surrogate models are essential in structural analysis and optimization. We propose a heterogeneous graph representation of stiffened panels that accounts for geometrical variability, non-uniform boundary conditions, and diverse loading scenarios, using heterogeneous graph neural networks (HGNNs). The structure is partitioned into multiple structural units, such as stiffeners and the plates between them, with each unit represented by three distinct node types: geometry, boundary, and loading nod…

[2025-10-06 Mon (UTC), 3 new articles found for math.GT Geometric Topology]
toXiv_bot_toot

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
Hossein Gholizadeh, Yonggang Jiang
https://arxiv.org/abs/2510.03427 https://arxiv.org…

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
In this paper, we discuss the maximum flow problem in the two-party communication model, where two parties, each holding a subset of edges on a common vertex set, aim to compute the maximum flow of the union graph with minimal communication. We show that this can be solved with $\tilde{O}(n^{1.5})$ bits of communication, improving upon the trivial $\tilde{O}(n^2)$ bound. To achieve this, we derive two additional, more general results: 1. We present a randomized algorithm for linear programs…

Crosslisted article(s) found for math.GR. https://arxiv.org/list/math.GR/new
[1/1]:
- Schur multiplier of $\mathrm{SL}_2$ over finite commutative rings
Behrooz Mirzaii, Abraham Rojas Vega

Missing Link: Hubble Deep Field – ein Foto und seine Geschichte
Wegen der Kosten und der Dauer des Hubble-Projekts stand die NASA unter Druck. Ende 1995 veröffentlichte sie ein Foto, das die Kritiker verstummen ließ.

Replaced article(s) found for math.GT. https://arxiv.org/list/math.GT/new
[1/1]:
- Classifying links and spatial graphs with finite $N$-quandles
Blake Mellor
ht…

Replaced article(s) found for cs.CE. https://arxiv.org/list/cs.CE/new
[1/1]:
- Benchmarking Time Series Foundation Models for Short-Term Household Electricity Load Forecasting
Marcel Meyer, David Zapata, Sascha Kaltenpoth, Oliver M\"uller

[2025-10-07 Tue (UTC), 5 new articles found for cs.DS Data Structures and Algorithms]
toXiv_bot_toot

Frankfurt als digitales Kraftwerk: Rechenzentren kurbeln Wirtschaftswachstum an
Eine Studie für den eco-Verband belegt die hohe Wertschöpfung der Rechenzentrumsbranche in der Region Rhein-Main. Doch der Boom hat deutliche Schattenseiten.

Quasi-alternating surgeries on asymmetric L-space knots in the census
Masakazu Teragaito
https://arxiv.org/abs/2510.04403 https://arxiv.org/pdf/2510.04403

Quasi-alternating surgeries on asymmetric L-space knots in the census
In the SnapPy census, there are 9 asymmetric L-space knots. It is known that each of them admits exactly two quasi-alternating surgeries with the aid of a computer. The purpose of this article is to confirm these surgeries by the Montesinos trick.

Crosslisted article(s) found for cs.CE. https://arxiv.org/list/cs.CE/new
[1/1]:
- Neural Network Surrogates for Free Energy Computation of Complex Chemical Systems
Wasut Pornpatcharapong

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- When Location Shapes Choice: Placement Optimization of Substitutable Products
Omar El Housni, Rajan Udwani
…

Palla kündigt Untersuchung zu Stuttgart-21-Verzögerungen an
Evelyn Palla will eine "lückenlose Aufklärung" der Probleme bei Stuttgarts neuem Hauptbahnhof einleiten – auch bei der Software.
https://ww…

Replaced article(s) found for math.GR. https://arxiv.org/list/math.GR/new
[1/1]:
- A notion of quasiconvex subgroups in acylindrically hyperbolic groups
Ping Wan

How large is the braid monodromy of low-genus Lefschetz fibrations?
Faye Jackson
https://arxiv.org/abs/2510.04389 https://arxiv.org/pdf/2510.04389

How large is the braid monodromy of low-genus Lefschetz fibrations?
Given a genus $g$ smooth Lefschetz fibration $π: M \to S^2$ with singular locus $Δ\subseteq S^2$, we describe the subgroup $\operatorname{Br}(π)$ of the spherical braid group $\operatorname{Mod}(S^2,Δ)$ consisting of braids admitting a lift to a fiber-preserving diffeomorphism of $M$. We develop general methods for showing that the index $[\operatorname{Mod}(S^2,Δ) : \operatorname{Br}(π)]$ is infinite. As an application of our methods, we prove that $[\operatorname{Mod}(S^2,Δ) : \operato…

Deep vs. Shallow: Benchmarking Physics-Informed Neural Architectures on the Biharmonic Equation
Akshay Govind Srinivasan, Vikas Dwivedi, Balaji Srinivasan
https://arxiv.org/abs/2510.04490

Deep vs. Shallow: Benchmarking Physics-Informed Neural Architectures on the Biharmonic Equation
Partial differential equation (PDE) solvers are fundamental to engineering simulation. Classical mesh-based approaches (finite difference/volume/element) are fast and accurate on high-quality meshes but struggle with higher-order operators and complex, hard-to-mesh geometries. Recently developed physics-informed neural networks (PINNs) and their variants are mesh-free and flexible, yet compute-intensive and often less accurate. This paper systematically benchmarks RBF-PIELM, a rapid PINN varian…

Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
Pravesh K. Kothari, Jeff Xu
https://arxiv.org/abs/2510.03061 https://arxiv.org/pdf/25…

Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
In this work, we revisit algorithms for Tensor PCA: given an order-$r$ tensor of the form $T = G+λ\cdot v^{\otimes r}$ where $G$ is a random symmetric Gaussian tensor with unit variance entries and $v$ is an unknown boolean vector in $\{\pm 1\}^n$, what's the minimum $λ$ at which one can distinguish $T$ from a random Gaussian tensor and more generally, recover $v$? As a result of a long line of work, we know that for any $\ell \in \N$, there is a $n^{O(\ell)}$ time algorithm that succeeds whe…

Crosslisted article(s) found for math.GR. https://arxiv.org/list/math.GR/new
[1/1]:
- Feit's conjecture, the canonical Brauer induction formula, and Adams operations
Robert Boltje, Gabriel Navarro

A representation of Milnor's triple linking number by chord diagrams and doodle invariants
Ryosuke Hirata
https://arxiv.org/abs/2510.04362 https://arxi…

A representation of Milnor's triple linking number by chord diagrams and doodle invariants
From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for Milnor's triple linking number - likewise of degree two - showing that it can be represented in terms of counts of certain chord diagrams together with doodle invariants.

Towards Fast Option Pricing PDE Solvers Powered by PIELM
Akshay Govind Srinivasan, Anuj Jagannath Said, Sathwik Pentela, Vikas Dwivedi, Balaji Srinivasan
https://arxiv.org/abs/2510.04322

Towards Fast Option Pricing PDE Solvers Powered by PIELM
Partial differential equation (PDE) solvers underpin modern quantitative finance, governing option pricing and risk evaluation. Physics-Informed Neural Networks (PINNs) have emerged as a promising approach for solving the forward and inverse problems of partial differential equations (PDEs) using deep learning. However they remain computationally expensive due to their iterative gradient descent based optimization and scale poorly with increasing model size. This paper introduces Physics-Inform…

Oracle-based Uniform Sampling from Convex Bodies
Thanh Dang, Jiaming Liang
https://arxiv.org/abs/2510.02983 https://arxiv.org/pdf/2510.02983

Oracle-based Uniform Sampling from Convex Bodies
We propose new Markov chain Monte Carlo algorithms to sample a uniform distribution on a convex body $K$. Our algorithms are based on the Alternating Sampling Framework/proximal sampler, which uses Gibbs sampling on an augmented distribution and assumes access to the so-called restricted Gaussian oracle (RGO). The key contribution of this work is the efficient implementation of RGO for uniform sampling on $K$ via rejection sampling and access to either a projection oracle or a separation oracle…

Noch einige der zuletzt hier besonders häufig geteilten #News:
Projekt Lionheart soll mit Tiefenwärme auch deutsches Lithium fördern

The Yang-Baxter Equation and Characteristic Finite Simple Quotients of the Free Group of Rank $2$
Liam Hanany
https://arxiv.org/abs/2510.03210 https://arxi…

The Yang-Baxter Equation and Characteristic Finite Simple Quotients of the Free Group of Rank $2$
We show that infinitely many alternating groups arise as quotients of the free group of rank 2, with kernel a characteristic subgroup. We also show that such simple quotients exist of arbitrarily large Lie rank. This resolves two questions posed by arXiv:2308.14302

Singularity of Cannon-Thurston maps
Vaibhav Gadre, Joseph Maher, Catherine Pfaff, Caglar Uyanik
https://arxiv.org/abs/2510.04350 https://arxiv.org/pdf/2510…

Singularity of Cannon-Thurston maps
In a closed fibered hyperbolic 3-manifold M, the inclusion of a fiber S, with S and M lifted to the universal covers gives an exponentially distorted embedding of the hyperbolic plane into hyperbolic 3-space. Nevertheless, Cannon and Thurston showed that there is a map from the circle at infinity of the hyperbolic plane to the 2-sphere at infinity of hyperbolic 3-space. The Cannon-Thurston map is surjective, finite-to-one, and gives a space-filling curve. Here we prove that many natural measure…

Open-source FDTD solvers: The applicability of Elecode, gprMax and MEEP for simulations of lightning EM fields
Hannes Kohlmann, Dmitry Kuklin, Farhad Rachidi, Wolfgang Schulz
https://arxiv.org/abs/2510.04262

Open-source FDTD solvers: The applicability of Elecode, gprMax and MEEP for simulations of lightning EM fields
In this study, the open-source finite-difference time-domain (FDTD) solvers gprMax, Elecode and MEEP are investigated for their suitability to compute lightning electromagnetic field propagation. Several simulations are performed to reproduce the results of typical field propagation scenarios that can be found in the literature. The results of the presented solvers are validated through comparison with reference field results corresponding to propagation over perfectly conducting and lossy grou…

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
Ethan Torres, Ramavarapu Sreenivas, Richard Sowers
https://arxiv.org/abs/2510.02727 https://

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$ trajectories, making exhaustive enumeration infeasible. Under time-homogeneous dynamics, however, the graph exhibits two exploitable symmetries: (i) translational invariance of nodes and (ii) a canonical bijection between admissible paths and ordered tuples enc…

Einige der zuletzt hier besonders häufig geteilten #News:
Adieu Microsoft: Schleswig-Holstein setzt auf Open Source und spart Millionen

The geometry of subgroups of mapping tori of free groups
Marco Linton
https://arxiv.org/abs/2510.03145 https://arxiv.org/pdf/2510.03145

The geometry of subgroups of mapping tori of free groups
We show that finitely generated mapping tori of free groups have a canonical collection of maximal sub-mapping tori of finitely generated free groups with respect to which they are relatively hyperbolic and locally relatively quasi-convex. As a consequence, we characterise locally quasi-convex hyperbolic groups amongst free-by-cyclic and one-relator groups. We also upgrade several known results for mapping tori of finitely generated free groups to the general case, such as the computations of D…

Trisected Rainbows and Braids
Rom\'an Aranda, Scott Carter, Julia Courtney, Puttipong Pongtanapaisan
https://arxiv.org/abs/2510.04248 https://arxiv.org…

Trisected Rainbows and Braids
New explicit procedures for passing among triplane diagrams, braid movies, and braid charts for knotted surfaces in $\mathbb{R}^4$ are presented. To this end, rainbow diagrams, which lie between braid charts and triplanes, are introduced. Inequalities relating the braid index and the bridge index of 2-knots are obtained via these procedures. Another consequence is a 4-dimensional version of the classical result that ``the minimal number of Seifert circles equals the braid index of a link'' due …

A Complement to Neural Networks for Anisotropic Inelasticity at Finite Strains
Hagen Holthusen, Ellen Kuhl
https://arxiv.org/abs/2510.04187 https://arxiv.o…

A Complement to Neural Networks for Anisotropic Inelasticity at Finite Strains
We propose a complement to constitutive modeling that augments neural networks with material principles to capture anisotropy and inelasticity at finite strains. The key element is a dual potential that governs dissipation, consistently incorporates anisotropy, and-unlike conventional convex formulations-satisfies the dissipation inequality without requiring convexity. Our neural network architecture employs invariant-based input representations in terms of mixed elastic, inelastic and struct…

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Approximation schemes for capacity vehicle routing problems: A survey
Yongyu Chen
h…

Vodafone zieht den Stecker bei öffentlichen Internetknoten.
Das bedeutet, dass der Netzbetreiber nicht mehr direkt mit anderen Providern an neutralen Standorten wie dem DE-CIX zusammengeschaltet sein wird.
Zum Artikel: https://heise.de/-11068819?wt_mc=sm.…

Combining relatively hyperbolic groups over a complex of groups
Darius Alizadeh
https://arxiv.org/abs/2510.02602 https://arxiv.org/pdf/2510.02602

Combining relatively hyperbolic groups over a complex of groups
Given a complex of groups $G(\mathcal{Y}) = (G_σ, ψ_a, g_{a,b})$ where all $G_σ$ are relatively hyperbolic, the $ψ_a$ are inclusions of full relatively quasiconvex subgroups, and the universal cover $X$ is CAT$(0)$ and $δ$--hyperbolic, we show $π_1(G(\mathcal{Y}))$ is relatively hyperbolic. The proof extends the work of Dahmani and Martin by constructing a model for the Bowditch boundary of $π_1(G(\mathcal{Y}))$. We prove the model is a compact metrizable space on which $G$ acts as a geo…

Disintegrating the curve complex
Mladen Bestvina, Kenneth Bromberg, Alexander J. Rasmussen
https://arxiv.org/abs/2510.03980 https://arxiv.org/pdf/2510.0398…

Disintegrating the curve complex
We study a finite sequence of graphs, beginning with the curve graph and ending with a graph quasi-isometric to a tree. There is a Lipschitz map from one graph in the sequence to the next. This sequence was first introduced by Hamenstädt. We prove (as conjectured by Hamenstädt) that the graphs in this sequence are hyperbolic and that the coarse fibers of the maps in the sequence are quasi-trees. This gives an upper bound on the asymptotic dimension of each graph in the sequence and as a resul…

Nystr\"om-Accelerated Primal LS-SVMs: Breaking the $O(an^3)$ Complexity Bottleneck for Scalable ODEs Learning
Weikuo Wang, Yue Liao, Huan Luo
https://arxiv.org/abs/2510.04094

Nyström-Accelerated Primal LS-SVMs: Breaking the $O(an^3)$ Complexity Bottleneck for Scalable ODEs Learning
A major problem of kernel-based methods (e.g., least squares support vector machines, LS-SVMs) for solving linear/nonlinear ordinary differential equations (ODEs) is the prohibitive $O(an^3)$ ($a=1$ for linear ODEs and 27 for nonlinear ODEs) part of their computational complexity with increasing temporal discretization points $n$. We propose a novel Nyström-accelerated LS-SVMs framework that breaks this bottleneck by reformulating ODEs as primal-space constraints. Specifically, we derive for t…

Crosslisted article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
Ruhan Habib
https:…

Cyber-Freibeuter: US-Abgeordnete wollen mit Kaperbriefen im Netz zurückschlagen
Der US-Kongress erwägt, mit Kaperbriefen ein Relikt aus der Piratenzeit wiederzubeleben. Cyber-Freibeuter sollen ausländische Internetgegner bekämpfen dürfen.

[2025-10-06 Mon (UTC), 3 new articles found for math.GR Group Theory]
toXiv_bot_toot

The equivalence between two real Seiberg-Witten homologies
Yonghan Xiao
https://arxiv.org/abs/2510.03709 https://arxiv.org/pdf/2510.03709

The equivalence between two real Seiberg-Witten homologies
We show that for a real rational homology sphere $Y$ equipped with a real $\mathrm{spin^c}$ structure $\s$, the real monopole Floer homology defined by Li and the real Seiberg-Witten Floer homology defined by Konno, Miyazawa and Taniguchi are isomorphic. As corollaries, we identify some Frøyshov-type invariants and prove two Smith-type inequalities.

Lightweight and Data-Efficient MultivariateTime Series Forecasting using Residual-Stacked Gaussian (RS-GLinear) Architecture
Abukar Ali
https://arxiv.org/abs/2510.03788 https://…

Lightweight and Data-Efficient MultivariateTime Series Forecasting using Residual-Stacked Gaussian (RS-GLinear) Architecture
Following the success of Transformer architectures in language modeling, particularly their ability to capture long-range dependencies, researchers have explored how these architectures can be adapted for time-series forecasting. Transformer-based models have been proposed to handle both short- and long-term dependencies when predicting future values from historical data. However, studies such as those by Zeng et al. (2022) and Rizvi et al. (2025) have reported mixed results in long-term foreca…

Low Recourse Arborescence Forests Under Uniformly Random Arcs
J Niklas Dahlmeier, D Ellis Hershkowitz
https://arxiv.org/abs/2510.02950 https://arxiv.org/pd…

Low Recourse Arborescence Forests Under Uniformly Random Arcs
In this work, we study how to maintain a forest of arborescences of maximum arc cardinality under arc insertions while minimizing recourse -- the total number of arcs changed in the maintained solution. This problem is the "arborescence version'' of max cardinality matching. On the impossibility side, we observe that even in this insertion-only model, it is possible for $m$ adversarial arc arrivals to necessarily incur $Ω(m \cdot n)$ recourse, matching a trivial upper bound of $O(m \cdot n)$…

Replaced article(s) found for math.GR. https://arxiv.org/list/math.GR/new
[1/1]:
- Discrete Linear Groups containing Arithmetic Groups
Indira Chatterji, T. N. Venkataramana

[2025-10-07 Tue (UTC), 7 new articles found for math.GT Geometric Topology]
toXiv_bot_toot

Report of the 2025 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science
L. C. McInnes, D. Arnold, P. Balaprakash, M. Bernhardt, B. Cerny, A. Dubey, R. Giles, D. W. Hood, M. A. Leung, V. Lopez-Marrero, P. Messina, O. B. Newton, C. Oehmen, S. M. Wild, J. Willenbring, L. Woodley, T. Baylis, D. E. Bernholdt, C. Camano, J. Cohoon, C. Ferenbaugh, S. M. Fiore, S. Gesing, D. Gomez-Zara, J. Howison, T. Islam,…

Report of the 2025 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science
This report summarizes insights from the 2025 Workshop on Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science, which convened more than 40 experts from national laboratories, academia, industry, and community organizations to chart a path toward more powerful, sustainable, and collaborative scientific software ecosystems. To address urgent challenges at the intersection of high-performance computing (HPC), AI, and scien…

Pareto-optimal Non-uniform Language Generation
Moses Charikar, Chirag Pabbaraju
https://arxiv.org/abs/2510.02795 https://arxiv.org/pdf/2510.02795

Pareto-optimal Non-uniform Language Generation
Kleinberg and Mullainathan (2024) recently proposed an interesting model for language generation in the limit: Given a countable collection of languages, and an adversary enumerating the strings of some language $L$ from the collection, the objective is to generate new strings from the target language, such that all strings generated beyond some finite time are valid. Li, Raman and Tewari (2024) and Charikar and Pabbaraju (2024) showed strong non-uniform generation guarantees in this model, giv…

[2025-10-07 Tue (UTC), 7 new articles found for cs.CE Computational Engineering, Finance, and Science]
toXiv_bot_toot

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Sayan Mukherjee, Shinichiro Akiyama
https://arxiv.org/abs/2510.02725

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Embedding the vertices of arbitrary graphs into trees while minimizing some measure of overlap is an important problem with applications in computer science and physics. In this work, we consider the problem of bijectively embedding the vertices of an $n$-vertex graph $G$ into the leaves of an $n$-leaf rooted binary tree $\mathcal{B}$. The congestion of such an embedding is given by the largest size of the cut induced by the two components obtained by deleting any vertex of $\mathcal{B}$. The c…

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang
https://arxiv.org/abs/2510.02562 https://arx…

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
A $k$-fault-tolerant connectivity preserver of a directed $n$-vertex graph $G$ is a subgraph $H$ such that, for any edge set $F \subseteq E(G)$ of size $|F| \le k$, the strongly connected components of $G - F$ and $H - F$ are the same. While some graphs require a preserver with $Ω(2^{k}n)$ edges [BCR18], the best-known upper bound is $\tilde{O}(k2^{k}n^{2-1/k})$ edges [CC20], leaving a significant gap of $Ω(n^{1-1/k})$. In contrast, there is no gap in undirected graphs; the optimal …

Even Faster Kernel Matrix Linear Algebra via Density Estimation
Rikhav Shah, Sandeep Silwal, Haike Xu
https://arxiv.org/abs/2510.02540 https://arxiv.org/pd…

Even Faster Kernel Matrix Linear Algebra via Density Estimation
This paper studies the use of kernel density estimation (KDE) for linear algebraic tasks involving the kernel matrix of a collection of $n$ data points in $\mathbb R^d$. In particular, we improve upon existing algorithms for computing the following up to $(1+\varepsilon)$ relative error: matrix-vector products, matrix-matrix products, the spectral norm, and sum of all entries. The runtimes of our algorithms depend on the dimension $d$, the number of points $n$, and the target error $\varepsilon…

[2025-10-06 Mon (UTC), 8 new articles found for cs.DS Data Structures and Algorithms]
toXiv_bot_toot