Tootfinder

Eventual, which develops Daft, a Python-native open-source data processing engine, raised a $7.5M seed led by CRV and a $20M Series A led by Felicis (Rebecca Szkutak/TechCrunch)
https://techcrunch.com/2025/06/24/how-a-data-pro…

How a data processing problem at Lyft became the basis for Eventual | TechCrunch
Eventual's data processing engine Daft was inspried by the founders' experience working on Lyft's autonomous vehicle project.

Pavement parking.
Desperately bad in South Manchester too.
The serious problem affecting every corner of a Greater Manchester borough - [Oldham] Manchester Evening News

The serious problem affecting every corner of a Greater Manchester borough
A Greater Manchester MP has spoken out about the 'frustrating' issue.

'Not my problem anymore': Baker Mayfield doesn't seem very interested in talking about the Browns

https://www.cbssports.com/nfl/news/not-my-

Trump's South Park Problem (Calder McHugh/Politico)
https://www.politico.com/news/magazine/2025/07/24/trumps-epstein-problem-hits-pop-culture-00475611
http://www.memeorandum.com/250724/p145#a250724p145

The hidden subgroup problem for infinite groups
Greg Kuperberg (UC Davis)
https://arxiv.org/abs/2507.18499 https://arxiv.org/pdf/2507.18499

The hidden subgroup problem for infinite groups
Following the example of Shor's algorithm for period-finding in the integers, we explore the hidden subgroup problem (HSP) for discrete infinite groups. On the hardness side, we show that HSP is NP-hard for the additive group of rational numbers, and for normal subgroups of non-abelian free groups. We also indirectly reduce a version of the short vector problem to HSP in $\mathbb{Z}^k$ with pseudo-polynomial query cost. On the algorithm side, we generalize the Shor-Kitaev algorithm for HSP in $…

Instance Space Analysis for the Quadratic Assignment Problem
Jeffrey Christiansen (ARC Training Centre in Optimisation Technologies, Integrated Methodologies and Applications), Kate Smith-Miles (ARC Training Centre in Optimisation Technologies, Integrated Methodologies and Applications)
https://arxiv.org/abs/2506.20172

Instance Space Analysis for the Quadratic Assignment Problem
For any optimisation problem where diverse algorithmic approaches are available, the task of predicting algorithm performance and selecting the algorithm most likely to perform well on a given instance holds great practical interest. However, if our test instances do not adequately represent the potential problem space, we may be misled about the strengths and weaknesses of an algorithm. In this paper we consider algorithm prediction and selection for the Quadratic Assignment Problem (QAP). We …

Exploring Communication Strategies for Collaborative LLM Agents in Mathematical Problem-Solving
Liang Zhang, Xiaoming Zhai, Jionghao Lin, Jionghao Lin, Jennifer Kleiman, Diego Zapata-Rivera, Carol Forsyth, Yang Jiang, Xiangen Hu, Arthur C. Graesser
https://arxiv.org/abs/2507.17753

Exploring Communication Strategies for Collaborative LLM Agents in Mathematical Problem-Solving
Large Language Model (LLM) agents are increasingly utilized in AI-aided education to support tutoring and learning. Effective communication strategies among LLM agents improve collaborative problem-solving efficiency and facilitate cost-effective adoption in education. However, little research has systematically evaluated the impact of different communication strategies on agents' problem-solving. Our study examines four communication modes, \textit{teacher-student interaction}, \textit{peer-to…

Enhancing Engagement and Learning in Computing Education: Automated Moodle-Based Problem-Solving Assessments
Charith Jayasekara, Carlo Kopp, Vincent Lee, Chetan Arora
https://arxiv.org/abs/2508.17191

Enhancing Engagement and Learning in Computing Education: Automated Moodle-Based Problem-Solving Assessments
This paper presents the design and refinement of automated Moodle-based Problem-Solving Assessments (PSAs) deployed across large-scale computing units. Developed to replace traditional exams, PSAs assess applied problem-solving skills through parameterised, real-world tasks delivered via Moodle's quiz engine. Integrated with interactive workshops, this approach supports authentic learning, mitigates academic integrity risks, and reduces inconsistencies in marking. Iterative improvements have en…

iOS 26: Schnell mal verschnarcht – Ärger mit neuem Wecker
Wer sich von einem iPhone mit iOS 26 wecken lässt, bekommt womöglich ein Problem: Das Button-Design ist eher unklug.
https://www.

Some people apparently have a problem with me being gender-fluid. That’s your problem, not mine.
I’m autistic. I’m not neurotypical, so honestly, I can’t relate to your issue with who I am. Sorry, not sorry!
#GenderFluid #ActuallyAutistic

Daydream, which raised a $50M seed in June 2024 to build a generative AI shopping agent for fashion, launches in beta, with an app expected later this summer (Hilary Milnes/Vogue Business)
https://www.voguebusiness.com/story/techno

Is Daydream’s AI platform the answer to fashion’s discovery problem?
Founder Julie Bornstein raised $50 million last year to create the ultimate AI shopping experience. Today, it launches in beta.

Synthesizing DSLs for Few-Shot Learning
Paul Krogmeier, P. Madhusudan
https://arxiv.org/abs/2508.16063 https://arxiv.org/pdf/2508.16063

Synthesizing DSLs for Few-Shot Learning
We study the problem of synthesizing domain-specific languages (DSLs) for few-shot learning in symbolic domains. Given a base language and instances of few-shot learning problems, where each instance is split into training and testing samples, the DSL synthesis problem asks for a grammar over the base language that guarantees that small expressions solving training samples also solve corresponding testing samples. We prove that the problem is decidable for a class of languages whose semantics o…

Bei „Each time the slider moved, it would take a full 15 seconds to get a response from the ML model“ bin ich lachend vom Stuhl gefallen.

https://medium.com/@jithinsankar.nk/how-i-solved-a-7-day-calculation-problem-in-a…

On the homogeneity problem of the Kazhdan-Lusztig ideals
Adhip Ganguly, Shyamashree Upadhyay
https://arxiv.org/abs/2506.20153 https://

On the homogeneity problem of the Kazhdan-Lusztig ideals
In this paper, we identify some sufficient conditions for a Kazhdan-Lusztig ideal to be inhomogeneous. Also, we attempt to approach the problem of giving some necessary and sufficient conditions for a Kazhdan-Lusztig ideal to be "standard homogeneous".

Krylov and core transformation algorithms for an inverse eigenvalue problem to compute recurrences of multiple orthogonal polynomials
Amin Faghih, Michele Rinelli, Marc Van Barel, Raf Vandebril, Robbe Vermeiren
https://arxiv.org/abs/2506.19796

Krylov and core transformation algorithms for an inverse eigenvalue problem to compute recurrences of multiple orthogonal polynomials
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using numerical linear algebra techniques. We consider two approaches: the first is based on the link with block Krylov subspaces and results in a biorthogonal Lanczos process with multiple starting vectors; the second consists of applying a sequence of Gaussian eliminati…

Resolving the joint ergodicity problem for Hardy sequences
Sebasti\'an Donoso, Andreas Koutsogiannis, Borys Kuca, Wenbo Sun, Konstantinos Tsinas
https://arxiv.org/abs/2506.20459

Resolving the joint ergodicity problem for Hardy sequences
The joint ergodicity classification problem aims to characterize those sequences which are jointly ergodic along an arbitrary dynamical system if and only if they satisfy two natural, simpler-to-verify conditions on this system. These two conditions, dubbed the difference and product ergodicity conditions, naturally arise from Berend and Bergelson's pioneering work on joint ergodicity. Elaborating on our earlier work, we investigate this problem for Hardy sequences of polynomial growth, this ti…

Subtooting since people in the original thread wanted it to be over, but selfishly tagging @… and @… whose opinions I value...
I think that saying "we are not a supply chain" is exactly what open-source maintainers should be doing right now in response to "open source supply chain security" threads.
I can't claim to be an expert and don't maintain any important FOSS stuff, but I do release almost all of my code under open licenses, and I do use many open source libraries, and I have felt the pain of needing to replace an unmaintained library.
There's a certain small-to-mid-scale class of program, including many open-source libraries, which can be built/maintained by a single person, and which to my mind best operate on a "snake growth" model: incremental changes/fixes, punctuated by periodic "skin-shedding" phases where make rewrites or version updates happen. These projects aren't immortal either: as the whole tech landscape around them changes, they become unnecessary and/or people lose interest, so they go unmaintained and eventually break. Each time one of their dependencies breaks (or has a skin-shedding moment) there's a higher probability that they break or shed too, as maintenance needs shoot up at these junctures. Unless you're a company trying to make money from a single long-lived app, it's actually okay that software churns like this, and if you're a company trying to make money, your priorities absolutely should not factor into any decisions people making FOSS software make: we're trying (and to a huge extent succeeding) to make a better world (and/or just have fun with our own hobbies share that fun with others) that leaves behind the corrosive & planet-destroying plague which is capitalism, and you're trying to personally enrich yourself by embracing that plague. The fact that capitalism is *evil* is not an incidental thing in this discussion.
To make an imperfect analogy, imagine that the peasants of some domain have set up a really-free-market, where they provide each other with free stuff to help each other survive, sometimes doing some barter perhaps but mostly just everyone bringing their surplus. Now imagine the lord of the domain, who is the source of these peasants' immiseration, goes to this market secretly & takes some berries, which he uses as one ingredient in delicious tarts that he then sells for profit. But then the berry-bringer stops showing up to the free market, or starts bringing a different kind of fruit, or even ends up bringing rotten berries by accident. And the lord complains "I have a supply chain problem!" Like, fuck off dude! Your problem is that you *didn't* want to build a supply chain and instead thought you would build your profit-focused business in other people's free stuff. If you were paying the berry-picker, you'd have a supply chain problem, but you weren't, so you really have an "I want more free stuff" problem when you can't be arsed to give away your own stuff for free.
There can be all sorts of problems in the really-free-market, like maybe not enough people bring socks, so the peasants who can't afford socks are going barefoot, and having foot problems, and the peasants put their heads together and see if they can convince someone to start bringing socks, and maybe they can't and things are a bit sad, but the really-free-market was never supposed to solve everyone's problems 100% when they're all still being squeezed dry by their taxes: until they are able to get free of the lord & start building a lovely anarchist society, the really-free-market is a best-effort kind of deal that aims to make things better, and sometimes will fall short. When it becomes the main way goods in society are distributed, and when the people who contribute aren't constantly drained by the feudal yoke, at that point the availability of particular goods is a real problem that needs to be solved, but at that point, it's also much easier to solve. And at *no* point does someone coming into the market to take stuff only to turn around and sell it deserve anything from the market or those contributing to it. They are not a supply chain. They're trying to help each other out, but even then they're doing so freely and without obligation. They might discuss amongst themselves how to better coordinate their mutual aid, but they're not going to end up forcing anyone to bring anything or even expecting that a certain person contribute a certain amount, since the whole point is that the thing is voluntary & free, and they've all got changing life circumstances that affect their contributions. Celebrate whatever shows up at the market, express your desire for things that would be useful, but don't impose a burden on anyone else to bring a specific thing, because otherwise it's fair for them to oppose such a burden on you, and now you two are doing your own barter thing that's outside the parameters of the really-free-market.

Building multi-BTZ black holes through Riemann-Hilbert problem
Jun-ichi Sakamoto, Shinya Tomizawa
https://arxiv.org/abs/2506.19310 https://

Building multi-BTZ black holes through Riemann-Hilbert problem
We construct a recently found class of non-BPS black hole solutions with asymptotically $AdS_3\times S^3\times T^4$ in type IIB supergravity, consisting of multiple BTZ black holes localized on an $S^3$, within the group theoretical framework of Breitenlohner and Maison (BM). Starting with the multi-neutral black string solution as a seed, we solve the associated Riemann-Hilbert problem for the BM linear system. First, we determine the monodromy matrix corresponding to this seed solution by gen…

Serrin-type problem in divergence form on Riemannian manifolds
M\'arcio Batista, M\'arcio Santos, Ant\^onio da Silva, Joyce Sindeaux
https://arxiv.org/abs/2507.17838 htt…

Serrin-type problem in divergence form on Riemannian manifolds
In this paper, we investigate an overdetermined boundary value problem of divergence type on bounded domains in Riemannian manifolds with non-negative Ricci curvature. Using integral identities and the $P$-function method, we derive geometric inequalities and rigidity results. Under natural conditions on the nonlinearity, we prove that equality implies the domain is isometric to a Euclidean ball, thereby extending classical symmetry results to the Riemannian setting.

Noch einige der zuletzt hier besonders häufig geteilten #News:
Starlink weltweit ausgefallen
https://www.heise.de/new…

Hermitian hull of some GRS codes and new EAQMDS codes
Oisin Campion, Rodrigo San-Jos\'e
https://arxiv.org/abs/2507.18361 https://arxiv.org/pdf/2507.183…

Hermitian hull of some GRS codes and new EAQMDS codes
We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas for the dimension of the hull, which determines the minimum number required of maximally entangled pairs for the associated entanglement-assisted quantum error-correcting codes. This flexible construction allows to obtain a wide range of entanglement-assiste…

Quantum Optimization for the Steiner Traveling Salesman Problem with Time Windows and Pickup and Delivery
Alessia Ciacco, Francesca Guerriero, Eneko Osaba
https://arxiv.org/abs/2508.17896

Quantum Optimization for the Steiner Traveling Salesman Problem with Time Windows and Pickup and Delivery
We present the Steiner Traveling Salesman Problem with Time Windows and Pickup and Delivery, an advanced and practical extension of classical routing models. This variant integrates the characteristics of the Steiner Traveling Salesman Problem with time-window constraints, pickup and delivery operations and vehicle capacity limitations. These features closely mirror the complexities of contemporary logistics challenges, including last-mile distribution, reverse logistics and on-demand service s…

Grading every NFL team's preseason: Chiefs, Giants earn high marks, while Bengals have dire problem

https://www.cbssports.com/nfl/news/grading

That's the other problem with academic publishing, it takes soooooo long. I genuinely believe preprint servers are where the exciting stuff is now, but it can be hard to find and keeping up with published literature alone is almost impossible. But when it takes maybe 2 years to come through the process...
(And I'm an editor for the Cryosphere - I realise I'm often the road block- but it also has to be squeezed in around the day job).

All-Pairs Shortest Paths with Few Weights per Node
Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi
https://arxiv.org/abs/2506.20017

All-Pairs Shortest Paths with Few Weights per Node
We study the central All-Pairs Shortest Paths (APSP) problem under the restriction that there are at most $d$ distinct weights on the outgoing edges from every node. For $d=n$ this is the classical (unrestricted) APSP problem that is hypothesized to require cubic time $n^{3-o(1)}$, and at the other extreme, for $d=1$, it is equivalent to the Node-Weighted APSP problem. We present new algorithms that achieve the following results: 1. Node-Weighted APSP can be solved in time $\tilde{O}(n^{(3+ω…

What a nightmare.
This is the problem with every form of mass online age and identity verification: the only kind of data that is completely secure is data that does not exist. Once you upload that driver’s license photo, you’re playing a game of Russian roulette.
https://infosec.exchange/@josephcox/114914547899818144

Zero-shot OCR Accuracy of Low-Resourced Languages: A Comparative Analysis on Sinhala and Tamil
Nevidu Jayatilleke, Nisansa de Silva
https://arxiv.org/abs/2507.18264 https://

Zero-shot OCR Accuracy of Low-Resourced Languages: A Comparative Analysis on Sinhala and Tamil
Solving the problem of Optical Character Recognition (OCR) on printed text for Latin and its derivative scripts can now be considered settled due to the volumes of research done on English and other High-Resourced Languages (HRL). However, for Low-Resourced Languages (LRL) that use unique scripts, it remains an open problem. This study presents a comparative analysis of the zero-shot performance of six distinct OCR engines on two LRLs: Sinhala and Tamil. The selected engines include both commer…

On inverse problem for generalized Kerr-type nonlinearities
Pu-Zhao Kow, Rulin Kuan
https://arxiv.org/abs/2506.19447 https://arxiv.or…

On inverse problem for generalized Kerr-type nonlinearities
We study the inverse problem of reconstructing the shape of unknown inclusions in semilinear elliptic equations with nonanalytic nonlinearities, by extending Ikehata's enclosure method to accommodate such nonlinear effects. To address the analytical challenges, we construct an approximate solution based on the linearized equation, enabling the enclosure method to operate in this setting. The proposed method applies to a broad class of semilinear elliptic equations with non-analytic nonlineariti…

Synthesis of timeline-based planning strategies avoiding determinization
Dario Della Monica, Angelo Montanari, Pietro Sala
https://arxiv.org/abs/2507.17988 https://

Synthesis of timeline-based planning strategies avoiding determinization
Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative temporal constraints (ordering relations), called synchronization rules. Its plan-existence problem has been shown to be PSPACE-complete; in particular, PSPACE-membership has been proved via reduction to the nonemptiness problem for nondeterministic finite automata. However, nondeterministic automata ca…

@… the takeaway I’m reading is that it’s a common problem for WordPress sites to need that ol’ Windows-machine-style reformat (for whatever reason)

Is there any known problem with the Internet Archives "Print Disabled" access? Looks like all the downloadable files have been vanished?
(Access isn't very "print disabled" if it can't be loaded into a TTS, tbh.)

Developing Artificial Mechanics Intuitions from Extremely Small Data
Jingruo Peng, Shuze Zhu
https://arxiv.org/abs/2506.20148 https://

Developing Artificial Mechanics Intuitions from Extremely Small Data
Humans can possess good mechanics intuitions by learning from a few examples, which leads to the question of how to develop artificial mechanics intuitions that can be learned from small data, as we are eagerly entering the era of artificial intelligence. We propose in this Letter the sample-switchable training method, which successfully develops highly-accurate artificial mechanics intuitions that can master brachistochrone problem, catenary problem, and large nonlinear deformation problem of …

"To grasp the full significance of life is the actor’s duty, to interpret it is his problem, and to express it his dedication."
-Marlon Brando
#acting #coaching #inspiration …

The latest poll shows that we can flip CA's 3rd Congressional District 📊!
It's Heidi Hall's team here.
This poll shows that this race is DEAD EVEN, and after voters hear positive messages for both Kiley and Heidi, we 💥take 💥the 💥lead❗
Our district is in desperate need of change,
and Heidi is running to end the toxic D.C. politics that encourages far-right extremism
and puts corporations over people
—like Kevin Kiley's two votes in favor of …

Heidi Hall for Congress
Join Heidi Hall's campaign for Congress in CA-03. Learn how her problem-solving approach can stand up for Californians and bring people-centered solutions to Washington.

Funny commentary on https://oilprice.com. No problem with disproving their own statement in the very next sentence.

Crude Oil Prices Today | OilPrice.com
Crude oil prices & gas price charts. Oil price charts for Brent Crude, WTI & oil futures. Energy news covering oil, petroleum, natural gas and investment advice

A new approach to the Monge-Amp\`ere eigenvalue problem
Chinh H. Lu, Ahmed Zeriahi
https://arxiv.org/abs/2507.18409 https://arxiv.org/pdf/2507.18409…

A new approach to the Monge-Ampère eigenvalue problem
We study the eigenvalue problem for the complex Monge-Ampère operator in bounded hyperconvex domains in $\C^n$, where the right-hand side is a non-pluripolar positive Borel measure. We establish the uniqueness of eigenfunctions in the finite energy class introduced by Cegrell, up to positive multiplicative constants, and provide a Rayleigh quotient type formula for computing the eigenvalue. Under a natural continuity assumption on the measure, we further show that both the eigenvalue and eig…

This is such a good summary of "the problem with 'data science'", as it tries to replace any domain expertise with the misguided notion that some form of statistics.
And so you end up with (maybe even well-meaning) researchers that are so far in over their head that they don't even know what they don't know.
Case in point: the authors of the preprint come from mathematics, computer science, physics, and 'future studies' (lol)…
@…

There's magic trick that can make any #AI project successful. When the LLM's success rate is too low, just say "it's OK, we will have a human in the loop" and ship it anyway.
There's just one problem with this magic trick: most #LLM implementations don't have the thoughtfu…

"Human in the loop" is a thought-terminating cliche
Without thoughtful guard rails, asking people to clean up after machines doesn't make machines better — it makes people worse.

A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing
Joshua Agterberg, Ren\'e Vidal
https://arxiv.org/abs/2506.20659 https://

A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing
The problem of matrix sensing, or trace regression, is a problem wherein one wishes to estimate a low-rank matrix from linear measurements perturbed with noise. A number of existing works have studied both convex and nonconvex approaches to this problem, establishing minimax error rates when the number of measurements is sufficiently large relative to the rank and dimension of the low-rank matrix, though a precise comparison of these procedures still remains unexplored. In this work we provide …

If you're looking for a more complete solution to the "visual diff for KiCad" problem, and you have a working Node Typescript setup, try out "typecad-gitdiff". It's not for me, but it might be for you! https://www.npmjs.com/package/@typecad/typecad-gitdiff…

A matrix criterion and algorithmic approach for the Peterson hit problem: Part I
Dang Vo Phuc
https://arxiv.org/abs/2506.18392 https://

A matrix criterion and algorithmic approach for the Peterson hit problem: Part I
The Peterson hit problem in algebraic topology is to explicitly determine the dimension of the quotient space $Q\mathcal P_k = \mathbb F_2\otimes_{\mathcal A}\mathcal P_k$ in positive degrees, where $\mathcal{P}_k$ denotes the polynomial algebra in $k$ variables over the field $\mathbb{F}_2$, considered as an unstable module over the Steenrod algebra $\mathcal{A}$. Current approaches to this problem still rely heavily on manual computations, which are highly prone to errors due to the intricate…

The Chern character of the Laughlin vector bundle in the Fractional Quantum Hall Effect
Semyon Klevtsov, Dimitri Zvonkine
https://arxiv.org/abs/2506.20363 …

The Chern character of the Laughlin vector bundle in the Fractional Quantum Hall Effect
We begin by explaining how a physical problem of studying the quantum Hall effect on a closed surface $C$ leads, via Laughlin's approach, to a mathematical question of describing the rank and the first Chern class of a particular vector bundle on the Picard group ${\rm Pic}^g(C)$. Then we formulate and solve the problem mathematically, proving several important conjectures made by physicists, in particular the Wen-Niu topological degeneracy conjecture and the Wen-Zee shift formula. Let $C$ be…

"Hi Andy, Faceb**k is looking for a Content Design Manager"
Yeah, well that's Faceb**k's problem. There's no way I would work for them!
#Work

A Meeting to discuss Heathrow's low pay problem: https://hounslowtradescouncil.org/heathrows-low-pay-problem/

Heathrow’s Low Pay Problem
An Open Meeting Hounslow Trades Union Council Thursday 26th June 7.30pm, . Hounslow United Reformed Church, 114 Hanworth Road, Hounslow, TW3 1UF Eight years ago, Heathrow Airport became a Living Wa…

A post from the archive 📫:
Invalid Access to memory location in KUDU App Services
https://www.poppastring.com/blog/invalid-access-to-memory-location-in-kudu-app-services

"It's "#ORCID and…," not "ORCID or…": How researcher identifiers work together to help researchers, build a better picture of research, and streamline administrative tasks": White Paper by MoreBrains › https://

Horn's problem in PU$(n,1)$
Arielle Marc-Zwecker (IF)
https://arxiv.org/abs/2507.17362 https://arxiv.org/pdf/2507.17362

Horn's problem in PU$(n,1)$
The multiplicative Horn problem is the following question: given three conjugacy classes $\mathcal{C}_1, \mathcal{C}_2, \mathcal{C}_3$ in a Lie group $G$, do there exist elements $(A,B,C)\in\mathcal{C}_1\times\mathcal{C}_2\times\mathcal{C}_3$ such that $ABC=\operatorname{Id}$? In this paper, we study the multiplicative Horn problem restricted to the elliptic classes of the group $G={\rm PU}(n,1)$ for $n\geq 1$, which is the isometry group of the $n$-dimensional complex hyperbolic space. We show…

Clustering of quantum correlations at low temperature
Arka Adhikari, Joscha Henheik, Marius Lemm, Tom Wessel
https://arxiv.org/abs/2508.15907 https://arxiv…

Clustering of quantum correlations at low temperature
Identifying conditions for the clustering of correlations in thermal states is a central problem in quantum many-body physics. In the low temperature regime, the problem is subtle, because it is intimately connected to phase transitions. Here we investigate quantum lattice Hamiltonians that are sums of on-site terms and relatively bounded perturbations. We present a direct proof that the thermal state satisfies exponential decay of correlations at low temperature, with a correlation length that…

While skipping through the opening credits of this anime episode, l thought, wait, I don’t remember that shot…
Sure enough, this series has (mildly) evolving credits.
I only noticed because I happen to be on an airplane watching a downloaded episode, which for some reason disables the Crunchyroll app’s “skip credits” button, so I had to skip manually.
That’s the problem with evolving credits: if you’re not paying attention you won’t notice they’ve changed!

The problem of finding three numbers such that the sum or difference of any two of them is a square number
Seiji Tomita
https://arxiv.org/abs/2508.15781 https://

The problem of finding three numbers such that the sum or difference of any two of them is a square number
Euler explored the problem of finding three numbers such that the sum or difference of any two of them is a perfect square. He discovered a parametric solution represented by polynomials of degree 18 and identified the smallest of these solutions. Additionally, we derive two parametric solutions using the elliptic curve method and find all solutions within the range of $10^8$.

Spotify Publishes AI-Generated Songs From Dead Artists Without Permission
https://www.404media.co/spotify-publishes-ai-generated-songs-from-dead-artists-without…

Spotify Publishes AI-Generated Songs From Dead Artists Without Permission
"They could fix this problem. One of their talented software engineers could stop this fraudulent practice in its tracks, if they had the will to do so."

Found an app called “Octave Coffee”. It’s an opinionated timer for pourover coffee. Tells you how much to pour, then how much to wait, and so on. And it has a cute pixel art kitty.
The problem is… it negs you while doing it, and your reward at the end for following the instructions is the message, “You actually listened. Shocking.”
I did it twice. It doesn’t vary.
So… I’m deleting it, even though I found it useful, because I don’t want to be insulted first thing in the morn…

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
Jan Bok, Avinandan Das, Anna Gujgiczer, Nikola Jedli\v{c}kov\'a
https://arxiv.org/abs/2508.16308

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such that it must have at least $\min\{k, °(v)\}$ neighbors colored differently. Das, Fraigniaud, and Ros{é}n~[OPODIS 2023] showed that the problem of $k$-partial $(k+1)$-coloring admits efficient centralized and distributed algorithms and posed an open problem …

The variables they introduce for 'playing' are really thought provoking... and yes, the video explains the answer.
▶️ This game theory problem will change the way you see the world - Veritasium
https://youtube.com/watch?v=mScpHTIi-kM&si=r2pxhpSLnnkbQ5Dp

A primer on the closure of algebraic complexity classes under factoring
C. S. Bhargav, Prateek Dwivedi, Nitin Saxena
https://arxiv.org/abs/2506.19604 https…

A primer on the closure of algebraic complexity classes under factoring
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity theory classifies polynomials into complexity classes based on their perceived `hardness'. This raises a natural question: Do these classes afford efficient factorization? In this survey, we revisit two pivotal techniques in polynomial factorization: Hensel…

😓 The Problem With Israel Is So Much Bigger Than Netanyahu
#israel

The Problem With Israel Is So Much Bigger Than Netanyahu
Increasingly, mainstream Democrats have sought to carve out a space for “acceptable” Zionism by saying that they support Israel but oppose Bibi Netanyahu. But the horrors of Gaza are a result of processes far more vast than one right-wing leader.

Absolutely insane that farm machinery is allowed on Irish motorways, but a resolution of the problem depends on the relative political heft of the Irish Road Haulage Association and the Irish Farmers Association
https://www.rte.ie/news/ireland/2025/0526/1514987-…

Estimating the growth rate of a birth and death process using data from a small sample
Carola Sophia Heinzel, Jason Schweinsberg
https://arxiv.org/abs/2508.16110 https://…

Estimating the growth rate of a birth and death process using data from a small sample
The problem of estimating the growth rate of a birth and death processes based on the coalescence times of a sample of $n$ individuals has been considered by several authors (\cite{stadler2009incomplete, williams2022life, mitchell2022clonal, Johnson2023}). This problem has applications, for example, to cancer research, when one is interested in determining the growth rate of a clone. Recently, \cite{Johnson2023} proposed an analytical method for estimating the growth rate using the theory of …

Ich hätte noch #Urlaubstage übrig für dieses Jahr, aber das Problem ist, ich bin mir nicht so ganz sicher, was ich damit machen soll.
#radreise?

I'm confronted with a very similar problem, has anything changed about the situation. (I.e. is it possible to start a process manually and then manually mark the systemd unit that would normally start it as running and have it behave like the service was started by systemd?) https://

An Explicit Solution for the Problem of Optimal Investment with Random Endowment
Michael Donisch, Christoph Knochenhauer
https://arxiv.org/abs/2506.20506 h…

An Explicit Solution for the Problem of Optimal Investment with Random Endowment
We consider the problem of optimal investment with random endowment in a Black--Scholes market for an agent with constant relative risk aversion. Using duality arguments, we derive an explicit expression for the optimal trading strategy, which can be decomposed into the optimal strategy in the absence of a random endowment and an additive shift term whose magnitude depends linearly on the endowment-to-wealth ratio and exponentially on time to maturity.

Maneuvering-based Dynamic Thrust Allocation for Fully-Actuated Vessels
Emir Cem Gezer, Roger Skjetne
https://arxiv.org/abs/2507.18309 https://arxiv.org/pdf…

Maneuvering-based Dynamic Thrust Allocation for Fully-Actuated Vessels
This paper introduces a new approach to solving the thrust allocation problem using the maneuvering problem in the maritime domain for fully actuated vessels. The method uses a control Lyapunov function to create a nonlinear reference filter for the thruster forces. The filter ensures dynamic tracking of the optimal thrust allocation solution with rate limitation in the output thruster references. It further uses control barrier functions to ensure that the thruster force saturation limits are …

@… gibt es support Foren oder sonstige Communities (Discord, Slack etc... ) wo man Fragen stellen kann? Habe ein Problem mit der Object Stories das ich mit anderen Usern diskutieren würde wollen.

Residual finiteness properties of some of Halls groups
Lukas Vandeputte
https://arxiv.org/abs/2508.16452 https://arxiv.org/pdf/2508.16452

Residual finiteness properties of some of Halls groups
In this article we study a class of central extensions of $\mathbb{Z}\wr\mathbb{Z}$, as first described by Hall. On the one hand, we construct a group in this class that is conjugacy separable with solvable word problem but unsolvable conjugacy problem. On the other hand we construct the first example of a group where the residual finiteness growth is faster than any polynomial but slower than any exponential.

HAHAHAHAHA!
Marvellous! 😂
https://noc.social/@todayilearned/114908945676154083

Today I learned (@todayilearned@noc.social)
Attached: 1 image TIL in 1816, the United States built a fort to protect itself from invasion by Canada. There was only one small problem: due to a surveying error, it was built in Canada. It was later known as "Fort Blunder" https://en.wikipedia.org/wiki/Fort_Montgomery_%28Lake_Champlain%29 #til #todayilearned https://www.reddit.com/r/todayilearned/comments/1m87dq9/til_in_1816_the_united_states_built_a_fort_to/

On the Erd\H{o}s-Ko-Rado problem of flags with type $\{1, n-3 \}$ of finite sets
Philipp Heering
https://arxiv.org/abs/2506.20556 https://

On the Erdős-Ko-Rado problem of flags with type $\{1, n-3 \}$ of finite sets
A flag of a finite set $S$ is a set $f$ of non-empty, proper subsets of $S$, such that $X\subseteq Y$ or $Y\subseteq X$ for all $X,Y\in f$. Two flags $f_1$ and $f_2$ of $S$ are opposite if $X_1\cap X_2=\emptyset$, or $X_1\cup X_2=S$ for all $X_1\in f_1$ and $X_2\in f_2$. The set $\{|X| \mid X\in f \}$ is the type of a flag $f$. A set of pairwise non-opposite flags is an Erdős-Ko-Rado set. In 2022 Metsch posed the problem of determining the maximum size of all Erdős-Ko-Rado sets of f…

Variable Neighborhood Descent Methods for Large-scale Single-assignment Multi-level Facility Location Problem
Haibo Wang, Bahram Alidaee
https://arxiv.org/abs/2508.15954 https:/…

Variable Neighborhood Descent Methods for Large-scale Single-assignment Multi-level Facility Location Problem
This paper addresses the single--assignment uncapacitated multi-level facility location (MFL) problem, which has numerous applications, including tactical and strategic supply chain management. We consider four-level and five-level facilities (4-LFL and 5-LFL). Although the MFL has been addressed in the literature in various settings, solutions to large-scale, realistic problems are still lacking. This paper considers several variants of the variable neighborhood descent (VND) method, including…

A parametric tensor ROM for the shallow water dam break problem
Md Rezwan Bin Mizan, Maxim Olshanskii, Ilya Timofeyev
https://arxiv.org/abs/2506.20007 http…

A parametric tensor ROM for the shallow water dam break problem
We develop a variant of a tensor reduced-order model (tROM) for the parameterized shallow-water dam-break problem. This hyperbolic system presents multiple challenges for model reduction, including a slow decay of the Kolmogorov $N$-width of the solution manifold, shock formation, and the loss of smooth solution dependence on parameters. These issues limit the performance of traditional Proper Orthogonal Decomposition based ROMs. Our tROM approach, based on a low-rank tensor decomposition, buil…

Regularity of the free boundary in an unstable parabolic problem
Mark Allen, Gilles Bokolo-Tamba
https://arxiv.org/abs/2508.15997 https://arxiv.org/pdf/250…

Regularity of the free boundary in an unstable parabolic problem
We study the free boundary in an unstable parabolic problem arising from a model in combustion. We consider the physical situation in which the heat advances and prove that the free boundary is a $C^{1,α/2}$ hypersurface.

I2I-STRADA -- Information to Insights via Structured Reasoning Agent for Data Analysis
SaiBarath Sundar, Pranav Satheesan, Udayaadithya Avadhanam
https://arxiv.org/abs/2507.17874

I2I-STRADA -- Information to Insights via Structured Reasoning Agent for Data Analysis
Recent advances in agentic systems for data analysis have emphasized automation of insight generation through multi-agent frameworks, and orchestration layers. While these systems effectively manage tasks like query translation, data transformation, and visualization, they often overlook the structured reasoning process underlying analytical thinking. Reasoning large language models (LLMs) used for multi-step problem solving are trained as general-purpose problem solvers. As a result, their rea…

@… @… hah! I have the exact same problem with mine 😅

I guess I should add that Firebase’s security model is still broken in the sense of being dangerously easy to mess up (despite its maintainers’ heroic efforts), that this is a problem that’s fundamentally baked into it the product’s whole value proposition of eliminating huge swaths of server-side development and is thus not readily solvable, and that these ongoing Firebase breaches are a classic case study in how far and how stubbornly the effects of abstraction choices can reach.

The Quantum Ensemble Variational Optimization Algorithm: Applications to Molecular Inverse Design
Francesco Calcagno, Delmar G. A. Cabral, Ivan Rivalta, Victor S. Batista
https://arxiv.org/abs/2508.15896

The Quantum Ensemble Variational Optimization Algorithm: Applications to Molecular Inverse Design
Designing molecules with optimized properties remains a fundamental challenge due to the intricate relationship between molecular structure and properties. Traditional computational approaches that address the combinatorial number of possible molecular designs become unfeasible as the molecular size increases, suffering from the so-called `curse of dimensionality' problem. Recent advances in quantum computing hardware present new opportunities to address this problem. Here, we introduce the Qua…

AirPlay-Lautsprecher in tvOS 26: Dauerbetrieb endlich erlaubt
Bislang muss man den Kontakt zwischen Apple-TV-Geräten und externen Drahtloslautsprechern stets neu herstellen. Das nächste tvOS behebt das Problem.

Russland: Schon 56.000 Internetseiten gesperrt, Suche nach Kreml-Kritik strafbar
Vor allem seit dem Angriffskrieg gegen die Ukraine schränkt Russland das freie Internet weiter ein. Der Digitalminister sieht darin aber kein Problem.

Why Jaire Alexander, newcomers give Baltimore Ravens 'great problem' as they rebuild struggling secondary

https://www.cbssports.com/nfl/new…

Approximating Submodular Matroid-Constrained Partitioning
Krist\'of B\'erczi, Karthekeyan Chandrasekaran, Tam\'as Kir\'aly, Daniel P. Szabo
https://arxiv.org/abs/2506.19507

Approximating Submodular Matroid-Constrained Partitioning
The submodular partitioning problem asks to minimize, over all partitions P of a ground set V, the sum of a given submodular function f over the parts of P. The problem has seen considerable work in approximability, as it encompasses multiterminal cuts on graphs, k-cuts on hypergraphs, and elementary linear algebra problems such as matrix multiway partitioning. This research has been divided between the fixed terminal setting, where we are given a set of terminals that must be separated by P, a…

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control I: Penalty Approach
Lechen Feng, Xun Li, Yuan-Hua Ni
https://arxiv.org/abs/2507.18114

Nonconvex Optimization Framework for Group-Sparse Feedback Linear-Quadratic Optimal Control I: Penalty Approach
This paper develops a unified nonconvex optimization framework for the design of group-sparse feedback controllers in infinite-horizon linear-quadratic (LQ) problems. We address two prominent extensions of the classical LQ problem: the distributed LQ problem with fixed communication topology (DFT-LQ) and the sparse feedback LQ problem (SF-LQ), both of which are motivated by the need for scalable and structure-aware control in large-scale systems. Unlike existing approaches that rely on convex r…

Quantum k-SAT Related Hypergraph Problems
Simon-Luca Kremer, Dorian Rudolph, Sevag Gharibian
https://arxiv.org/abs/2506.17066 https://

Quantum k-SAT Related Hypergraph Problems
The Quantum k-SAT problem is the quantum generalization of the k-SAT problem. It is the problem whether a given local Hamiltonian is frustration-free. Frustration-free means that the ground state of the k-local Hamiltonian minimizes the energy of every local interaction term simultaneously. This is a central question in quantum physics and a canonical QMA_1-complete problem. The Quantum k-SAT problem is not as well studied as the classical k-SAT problem in terms of special tractable cases, appr…

Exceptional points and defective resonances in an acoustic scattering system with sound-hard obstacles
Kei Matsushima, Takayuki Yamada
https://arxiv.org/abs/2506.19229

Exceptional points and defective resonances in an acoustic scattering system with sound-hard obstacles
This paper is concerned with non-Hermitian degeneracy and exceptional points associated with resonances in an acoustic scattering problem with sound-hard obstacles. The aim is to find non-Hermitian degenerate (defective) resonances using numerical methods. To this end, we characterize resonances of the scattering problem as eigenvalues of a holomorphic integral operator-valued function. This allows us to define defective resonances and associated exceptional points based on the geometric and al…

Infinite Ideal Polyhedra in Hyperbolic 3-Space: Existence and Rigidity
Huabin Ge, Hao Yu, Puchun Zhou
https://arxiv.org/abs/2506.19528 https://

Infinite Ideal Polyhedra in Hyperbolic 3-Space: Existence and Rigidity
In the seminal work [27], Rivin obtained a complete characterization of finite ideal polyhedra in hyperbolic 3-space by the exterior dihedral angles. Since then,the characterization of infinite hyperbolic polyhedra has become an extremely challenging open problem. To resolve this problem, we study ideal circle patterns (ICPs) and use them to characterize infinite ideal polyhedra (IIPs). Specifically, we establish the existence and rigidity of embedded ICPs on the plane. We further prove the uni…

A Hybrid High-Order Method for the Gross--Pitaevskii Eigenvalue Problem
Moritz Hauck, Yizhou Liang
https://arxiv.org/abs/2506.19944 https://

A Hybrid High-Order Method for the Gross--Pitaevskii Eigenvalue Problem
We introduce a hybrid high-order method for approximating the ground state of the nonlinear Gross--Pitaevskii eigenvalue problem. Optimal convergence rates are proved for the ground state approximation, as well as for the associated eigenvalue and energy approximations. Unlike classical conforming methods, which inherently provide upper bounds on the ground state energy, the proposed approach gives rise to guaranteed and asymptotically exact lower energy bounds. Importantly, and in contrast to …

A surge in AI-generated résumés is overwhelming employers, who are turning to AI screening and interviewing tools to assess responses and rank candidates (Sarah Kessler/New York Times)
https://www.nytimes.com/2025/06/21/business/dealbook/ai-job-applic…

Employers Are Buried in A.I.-Generated Résumés
Candidates are frustrated. Employers are overwhelmed. The problem? An untenable pile of applications — many of them generated with the help of A.I. tools.

Solution to a problem on isolation of $3$-vertex paths
Karl Bartolo, Peter Borg, Dayle Scicluna
https://arxiv.org/abs/2506.19149 https://

Solution to a problem on isolation of $3$-vertex paths
The $3$-path isolation number of a connected $n$-vertex graph $G$, denoted by $ι(G,P_3)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$ intersects each $3$-vertex path of $G$, meaning that no two edges of $G-N[D]$ intersect. Zhang and Wu proved that $ι(G,P_3) \leq 2n/7$ unless $G$ is a $3$-path or a $3$-cycle or a $6$-cycle. The bound is attained by infinitely many graphs having induced $6$-cycles. Huang, Zhang and Jin pr…

A Nonlinear Nonlocal Problem for the Caputo Fractional Subdiffusion Equation
Ravshan Ashurov, Rajapboy Saparboyev, Navbahor Nuraliyeva
https://arxiv.org/abs/2506.19516

A Nonlinear Nonlocal Problem for the Caputo Fractional Subdiffusion Equation
In this paper, we study a time-fractional subdiffusion equation with a nonlinear nonlocal initial condition involving the unknown solution at the final time. The considered problem is formulated using the Caputo fractional derivative of order \(0 < α< 1\), along with homogeneous Dirichlet boundary conditions. The nonlocal initial condition is of the form \( u(x,0) = g(x, u(x,T)) \), where \(g\) is a nonlinear function satisfying a Lipschitz condition. The main challenge arises from the implici…

The Generalized Matrix Separation Problem: Algorithms
Xuemei Chen, Owen Deen
https://arxiv.org/abs/2507.17069 https://arxiv.org/pdf/2507.17069

The Generalized Matrix Separation Problem: Algorithms
When given a generalized matrix separation problem, which aims to recover a low rank matrix $L_0$ and a sparse matrix $S_0$ from $M_0=L_0+HS_0$, the work \cite{CW25} proposes a novel convex optimization problem whose objective function is the sum of the $\ell_1$-norm and nuclear norm. In this paper we detail the iterative algorithms and its associated computations for solving this convex optimization problem. We present various efficient implementation strategies, with attention to practical ca…

On $NP \cap coNP$ proof complexity generators
Jan Krajicek
https://arxiv.org/abs/2506.20221 https://arxiv.org/pdf/2506.20221

On $NP \cap coNP$ proof complexity generators
Motivated by the theory of proof complexity generators we consider the following $Σ^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $π$ of a disjunction $\bigvee_i α_i$, no two $α_i$ having an atom in common, find $i$ such that $α_i \in \mbox{TAUT}$. We formulate a hypothesis (ST) that for some strong proof system $P$ the problem $\mbox{DD}_P$ is not solvable in the student-teacher model with a p-time student and a constant number of ro…

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

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

Multiplicity results for mixed local-nonlocal variable exponent problem involving singular and superlinear term
Shammi Malhotra, Ambesh Kumar Pandey, K. Sreenadh
https://arxiv.org/abs/2506.19793

Multiplicity results for mixed local-nonlocal variable exponent problem involving singular and superlinear term
In this paper, we study a class of quasilinear elliptic equations involving both local and nonlocal operators with variable exponents. The problem exhibits singular nonlinearities along with a subcritical superlinear growth term and a parameter $λ$. We study the existence of multiple solutions with the help of variational methods by restricting the associated energy functional on appropriate subsets of the Nehari manifold. Using the topological index and the structure of the fibering maps, we …

Fundamental Solutions of the Logarithmic Laplacian: An Approach via the Division Problem
David Lee
https://arxiv.org/abs/2506.20121 https://

Fundamental Solutions of the Logarithmic Laplacian: An Approach via the Division Problem
Existence of the fundamental solution of the logarithmic Laplacian (in dimensions $d \geq 3$) was established by Huyuan Chen and Laurent Véron (2024). In this note, we present an alternative approach, based on a modification on the classical division problem. This is inspired by the theory of fundamental solutions by Malgrange and Ehrenpreis. Moreover, we give a variant of the Liouville theorem for the logarithmic Laplacian and give some further clarification regarding a conjecture posed by Ch…

Undecidability of Translational Tiling of the Plane with Four Tiles
Chao Yang, Zhujun Zhang
https://arxiv.org/abs/2506.19295 https://…

Undecidability of Translational Tiling of the Plane with Four Tiles
The translational tiling problem, dated back to Wang's domino problem in the 1960s, is one of the most representative undecidable problems in the field of discrete geometry and combinatorics. Ollinger initiated the study of the undecidability of translational tiling with a fixed number of tiles in 2009, and proved that translational tiling of the plane with a set of $11$ polyominoes is undecidable. The number of polyominoes needed to obtain undecidability was reduced from $11$ to $7$ by Yang an…

A Taylor-Hood finite element method for the surface Stokes problem without penalization
Alan Demlow, Michael Neilan
https://arxiv.org/abs/2506.20419 https:…

A Taylor-Hood finite element method for the surface Stokes problem without penalization
Finite element approximation of the velocity-pressure formulation of the surfaces Stokes equations is challenging because it is typically not possible to enforce both tangentiality and $H^1$ conformity of the velocity field. Most previous works concerning finite element methods (FEMs) for these equations thus have weakly enforced one of these two constraints by penalization or a Lagrange multiplier formulation. Recently in [A tangential and penalty-free finite element method for the surface Sto…

A Compact Cycle Formulation for the Multiperiodic Event Scheduling Problem
Rolf Nelson van Lieshout, Niels Lindner
https://arxiv.org/abs/2507.17566 https://

A Compact Cycle Formulation for the Multiperiodic Event Scheduling Problem
The Periodic Event Scheduling Problem (PESP) is a fundamental model in periodic timetabling for public transport systems, assuming a common period across all events. However, real-world networks often feature heterogeneous service frequencies. This paper studies the Multiperiodic Event Scheduling Problem (MPESP), a generalization of PESP that allows each event to recur at its own individual period. While more expressive, MPESP presents new modeling challenges due to the loss of a global period.…

Pattern formation and film rupture in a two-dimensional thermocapillary thin-film model of the B\'enard-Marangoni problem
Stefano B\"ohmer, Bastian Hilder, Jonas Jansen
https://arxiv.org/abs/2506.19795

Pattern formation and film rupture in a two-dimensional thermocapillary thin-film model of the Bénard-Marangoni problem
We study two-dimensional, stationary square and hexagonal patterns in the thermocapillary deformational thin-film model for the fluid height $h$\begin{equation*} \partial_t h+\nabla\cdot\left(h^3\left(\nablaΔh-g\nabla h\right)+M\frac{h^2}{(1+h)^2}\nabla h\right)=0,\quad t>0,\quad x\in\mathbb{R}^2, \end{equation*} that can be formally derived from the Bénard-Marangoni problem via a long-wave approximation. Using a linear stability analysis, we show that the flat surface profile correspondi…

Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
Huye Chen, Jingjian Li, Hao Yu
https://arxiv.org/abs/2506.19888 https://arxi…

Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
After a long term efforts, the Hamiltonian problem of connected vertex-transitive graphs of order $pq$ (where $p$ and $q$ are primes) was finally finshed in 2021, see [10]. Fifteen years ago, mathematicians began to challenge this problem for graphs of order $2pq$. Among of them, it was proved in 2012 (see [21]) that every connected vertex-transitive graph of order $10p$ (where $p\neq7$ is a prime) contains a Hamilton path, with the exception of a family of graphs which was recently confirmed i…

Low-order finite element complex with application to a fourth-order elliptic singular perturbation problem
Xuewei Cui, Xuehai Huang
https://arxiv.org/abs/2506.20240

Low-order finite element complex with application to a fourth-order elliptic singular perturbation problem
A low-order nonconforming finite element discretization of a smooth de Rham complex starting from the $H^2$ space in three dimensions is proposed, involving an $H^2$-nonconforming finite element space, a new tangentially continuous $H^1$-nonconforming vector-valued finite element space, the lowest-order Raviart-Thomas space, and piecewise constant functions. While nonconforming for the smooth complex, the discretization conforms to the classical de Rham complex. It is applied to develop a decou…

Dispatching and Pricing in Two-Sided Spatial Queues
Ang Xu, Chiwei Yan
https://arxiv.org/abs/2507.17983 https://arxiv.org/pdf/2507.17983

Dispatching and Pricing in Two-Sided Spatial Queues
We study a dispatching and pricing problem in two-sided spatial queues with fixed supply, motivated by ride-hailing and robotaxi platforms. Idle drivers queue on one side, waiting to pick up riders, while riders queue on the other, waiting to be matched with available drivers. The platform seeks to maximize net profit, penalized by rider waiting penalties, by jointly optimizing state-dependent dispatching and pricing decisions. We formulate this problem as a Markov decision process with state-d…

Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments
Boris Baros, Samuel N. Cohen, Christoph Reisinger
https://arxiv.org/abs/2508.16001 https://

Mean-Field Generalisation Bounds for Learning Controls in Stochastic Environments
We consider a data-driven formulation of the classical discrete-time stochastic control problem. Our approach exploits the natural structure of many such problems, in which significant portions of the system are uncontrolled. Employing the dynamic programming principle and the mean-field interpretation of single-hidden layer neural networks, we formulate the control problem as a series of infinite-dimensional minimisation problems. When regularised carefully, we provide practically verifiable a…

Inverse problem for fractional Schr\"{o}dinger equations with drift on closed Riemannian manifolds
Tianyu Cai, Xi Chen
https://arxiv.org/abs/2508.16879 https://

Inverse problem for fractional Schrödinger equations with drift on closed Riemannian manifolds
This paper is concerned about the inverse coefficient problems of variable-coefficient fractional Schrödinger equations with drift on connected closed Riemannian manifolds. We prove that the knowledge of the underlying equation on any non-empty open subset of the underlying manifold determines the Riemannian metric, the drift and the potential, simultaneously and uniquely, up to a gauge transformation. This paper extends the result in \cite{feizmohammadi2021fractionalanisotropiccalderonproblem…