Tootfinder

They told the poor white man:
"You may be starving,
you may be broke,
but at least you aren't one of Them."
It worked.
The poor whites stopped fighting the rich.
They started guarding the rich.
They accepted their poverty -- because they had been given a false sense of superiority.
The "Divide and Rule" algorithm was born.
350 years later, the campaign is still running.
The Elite are still terrified of Unity…

MikeDunnAuthor (@MikeDunnAuthor@kolektiva.social)
Attached: 1 image Andre Gonsalves The most effective marketing campaign in history was launched in 1676. The product was Racism. Before that year, the Elites in America had a massive problem. In the colony of Virginia, poor white indentured servants and black slaves were friends. They worked the same fields. They lived in the same shacks. They even married each other. They realized they had the same enemy: The rich plantation owners. So, they united. Led by a man named Nathaniel Bacon, this…

#linux #openwrt
Q: I am starting with open wrt. My problem is that I want to reach it over my LAN. The default ip is 192.168.1 but I have 192.168.0 as a default and I can not change it (ISP restriction). I have googled and youtubed it but I still can't get it to work. I can log in to t…

#GiftLink Because 'security', although that wasn't a problem last year...
F.C.C. Changes Course on the Price of Prisoners’ Phone Calls - The New York Times
https://www.nytimes.com/2025/10/28/upshot/prisoners-phone-calls-prices.html?unlocked_article_code=1.xE8.QeaW.ouGcUDXmgdpp&smid=url-share

Chasing some other interesting bugs in the STM32MP2 setup.
1) I don't know if the clock dividers were the problem or not, but I'm seeing weird behavior with the QSPI flash randomly not working properly sometimes.
2) Possibly related: power consumption of the board seems to vary /- 20% from one reset to another. This is an enormous variation, no I do not currently have an explanation.

With growing interest in social housing in SF, maybe it’s a good time to re-up this Q&A I hosted last month. In addition to lessons from Seattle, @… goes over SF efforts so far, so it’s a great way to get up to speed!

Municipal Social Housing: What can California learn from Seattle’s win? — California DSA
By now, San Francisco is famous not just for unaffordable rent, but also for its acrimonious debates about how to solve the problem. One well-funded contingent asserts it’s all about making it easier and cheaper to build privately owned homes, but as even the corporate media is now noting, we’ve don

1 geek points if you spot the problem with this form

@… That is honestly their problem, they might not know it yet tho.
Also, I was doing rough mathguestimations after a couple of beers based on a RabbitMQ TTL in probably microseconds to see if messages would expire after 10 hours. Which it probably does.
I'm just disappointed

Ich mag schon immer Papercraft-Kram für den Spieltisch, aber das Problem, das Papercraft nicht löst ist der Platzbedarf beim Lagern. Bisher! Ich hab am Wochenende zufällig den FoldScapes Patreon entdeckt und gleich angefangen zu schneiden, zu kleben und zu falten...
Alle #FoldScapes Modelle lassen sich flach zusammen legen und das Dorf aus Bild 1 passt komplett in den Hefter von B…

🇨🇭 🇨🇭 🇨🇭 🇨🇭 🇨🇭
Mir sind 50 Millionen zuwenig.
Millionäre sind nicht das Problem.
Es sind die Milliardäre, die wir uns schlicht nicht leisten können.
Aber wenn die Juso-Initiative wirklich so abschifft, finde ich das als Signal voll schlecht.
https://www.srf.ch/n…

Abstimmungen vom 30.11.2025: 1. SRG-Umfrage zur Erbschaftssteuer
Wäre im Oktober über die Erbschaftssteuer-Initiative abgestimmt worden, wäre sie deutlich bachab geschickt worden.

Came across this 2010 blog post about mindfulness in computing and so much of these behaviors have only intensified to new extremes with LLM usage. So much so that not only is the process of software creation being quickly supplanted by prompts and (stochastic) "search" assemblies, but more generally the kind of mindfulness talked about in the post (here meaning thinking through & solving a problem yourself[1]) is now being openly discouraged by industry and forcefully delegate…

Zur Eignung von LLMs in non-kybernetischen Kontexten:
#FediLZ
@… https://mastodon.s…

“The case for upzoning is relatively solid but deeply underwhelming as a standalone position. The upshot is that everyone is at least partly right: Upzoning can address the shortfall in supply. But it won’t come close to solving the housing crisis alone. Re-enter: public housing.”
https://

The Solution to the Affordable Housing Problem That No One Wants to Discuss
There are new ideas for fixing this. And one very old one.

My solution to the problem @… mentions:
1. Make password the •only• login field. No username/email! Just password, and you’re in!
2. Because they now identify users, passwords must to be unique across all users in a system.
3. For security reasons, require passwords to be unique across all sites on the entire Internet. A password can be used at most once in human history.
4. This renders account recovery impossible in many cases.
5. Over time, users are thus able to use fewer and fewer sites, eventually being forced offline altogether.
6. Success!
https://mastodon.social/@jwz/115776511391611416

1. Plan going to Opole, via Kościan.
2. When you enter the train to Kościan, you discover that the change to Opole is delayed 15 minutes already. Consider changing in Leszno instead; if the delay increases, you'd have more options there.
3. Discover that there aren't any more options in Leszno today. Your change is delayed 30 minutes already. Return the reservations, and take one the other way, to Poznań instead.
4. Train station in Kościan. The displays aren't showing any delays, trains are announced normally. Tell people about the delays, so they won't stand in the -10°C waiting for the train to arrive.
5. Take the train to Poznań, and try to figure out what to do next.
6. Discover that the only reasonable choice going forward is Inowrocław: no delays and good return connection. It's the same train, so take another reservation. Your current seat is already taken there, so move elsewhere.
7. Your train should be followed by another one in the same direction, that departs from Poznań 6 minutes later. However, your train ends up waiting for another delayed train, so the other train goes first. The delay further increases as your train needs to slow down after the other train.
8. Reach Inowrocław 10 minutes later. That's not a problem, since you didn't have enough to see for all the time there anyway.
9. Discover that the town is more interesting than you thought, and you'd use more time.
10. When you almost get to the station, discover that your train is 10 minutes late. Not that you have any use for that time at this point.
11. When you're at the station, the train keeps increasing delay while waiting at the previous station, in Bydgoszcz. The station displays are completely useless, as they show only a random subset of regional trains, for no apparent reason. The announcements include all trains, but are rarely given.
12. The delay keeps increasing. Start thinking about getting a reservation for the next train to Poznań, in case it arrived first. You can't return the reservation after the planned departure time, and you can't have two reservations simultaneously, so reserve the seat from Mogilno, the next station.
13. The next train arrives first. While on board, you discover that you're not going to have any train home for 1.5 hr. Take another seat reservation to Leszno, where you can change into a suburban train and get home 15 minutes earlier than from Poznań. This time, your seat is still free.
14. The train departs 15 minutes delayed from Poznań. After all, you're changing trains in Kościan.
So I was going to go south, to Opole, via Kościan. Instead, I've ended up slingshotting north to Inowrocław, and getting back home via the same train as if I were in Opole.
#rail

Hallo @… !
Aktuell gibt es ein Problem mit Vorschaubildern, oder?
Im Web sieht es so aus und erst ein Klick zeigt das Bild. In Ivory stürzt sogar der Client ab, wenn man da drauf klickt.
@… hatte das Problem glaube ich auch in IceCubes.
Edit: Bei manchen Tröts geht's aber - z.B. bei diesem Tröt selbst wird mir das Bild angezeigt... mysteriös.

Ya wanna know what is a bad idea? “AI-directed experimentation and manufacturing” is.
potus should have just called it a hand out for Oracle.
It is a solution searching for a problem. It literally gives 90 days for them to identify 20 problems it might solve.
It uses public funds for private research.

Launching the Genesis Mission
By the authority vested in me as President by the Constitution and the laws of the United States of America, it is hereby ordered: Section 1.  Purpose.

by accident i stumbled on this review by the #NSA on Bruce Schneiers "Applied Crypto" book from long ago.

Meanwhile, in Hell…
#USA #capitalism https://neopaquita.es/@Shine_McShine/11546982730643344…

Crypto casinos have become online gambling havens for teens and problem gamblers, propped up by operators who turn social media influencers into recruiters (New York Times)
https://www.nytimes.com/interactive/2025/1

How Online Crypto Casinos Use Celebrities and Livestreamers to Recruit Gamblers
Using exploitative marketing strategies, the illicit gambling websites have profited and lured in a young generation of gamblers.

«The fundamental problem is this: that most of the means of communication are owned or influenced by the very rich. If democracy is the problem capital is always trying to solve, propaganda is part of the solution.»
On the epistemic crisis we're all in, thanks to most ways of knowing and disseminating knowledge being in the hands of a couple of billionaires.
https://www.theguardian.com/commentisfree/2025/nov/14/climate-crisis-communication-super-rich

On the ternary Estermann problem with almost proportional summands
Firuz Rakhmonov
https://arxiv.org/abs/2510.05602 https://arxiv.org/pdf/2510.05602…

On the ternary Estermann problem with almost proportional summands
For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the conditions $$ \left|p_k-μ_kN\right|\le H, \quad k=1,2,\qquad \left|m^n-μ_3N\right|\le H,\qquad H \ge N^{1-\frac1{n(n-1)}} {\mathscr{L}}^{\frac{2^{n+1}}{n-1}+n-1},$$ for $μ_1+μ_2+μ_3=1, \ \ μ_i >0, \mathscr{L} = \ln{N}. $ Keywords: Estermann…

Omg, patently wrong. To begin with, I am the one using the GTX 1650, and my video shows that it's working great even with DLSS, as opposed to the viewer with the AMD problem. And that parrotting nincompoop of an AI wants me to - what? - save time, give technical advice, make some small talk? What a big, smoking hot, pointless pile of b this technology turns out to be.
And I guess Google lets the same fucking stupid LM to determine how to recommend my video to other viewers? Great!<…

2038 wird zur Rechtsfrage: Ein Pariser Gericht macht Alstom für den Y2K38-Bug haftbar. Acht Metro-Linien und die RER A könnten sonst ab 19.1.2038 ausfallen. Das Urteil ist ein Weckruf für die ganze Branche.
#y2k38 #y2038 #y2038bug

KI soll 600.000 fehlende Beamte ersetzen? Klingt wie der Plan eines Startups, das gerade seine erste Fördermillion verbrannt hat.
Problem 1: KI ist kein Zauberstab.
Problem 2: Selbst wenn – die Infrastruktur dahinter gleicht oft noch einem Flickenteppich aus den 90ern.
Problem 3: Bürger wollen keine Algorithmen. Sie wollen funktionierende Behördengänge. Wie bei Amazon. Nur ohne Prime-Mitgliedschaft.

Trying to read a paper related to my research. I have access to it through my university's arrangements with the publisher, meaning that the uni pays (several £100k per year) for the access.
Publisher website (#Elsevier): error "there was a problem providing the content you requested"
#Scihub

I was just thinking about what you should do when you have a problem with an organisation you are part of, and so far (I've only just woken up) I think the steps are:
1. Wait - maybe it will pass
2. Act yourself to fix it - at the very least you will gain a better undertaking of the
3. Complain - perhaps the boss doesn't know theres a problem
4. Organise - what you can't fix alone you can fix together
5. Leave - if all else fails
And it feels lik…

Goodbye #Microservices: From 100s of problem children to 1 superstar
https://www.twilio.com/en-us/blog/developers/best-practices/goodbye-microservices…

I’ve worked over the past year to reduce the amount of noise in my consciousness on a daily basis.
By that I mean - information noise, not literal sounds “noise”. (That problem was solved long ago by some good earplugs and noise canceling earphones.)
I’ve gotten used to spending less time on social media, regularly blocking most apps on my devices (anything with a feed news, most work communication apps, etc.), putting my phone and other devices aside for extended periods of time. Often go to work places with my iPad explicitly having its WiFi turned off and selecting cafes that don’t offer WiFi at all.
Negotiated better boundaries at work and in personal life where I exchange messages with people less often but try to make those interactions more meaningful, and people rarely expect me to respond to requests in less than 24 hours. Spent a lot of time setting up custom notification settings on all apps that would allow it, so I get fewer pings. With software, choosing fewer cloud-based options and using tools that are simple and require as few interruptions as possible.
Accustomed myself to lower-tech versions of doing things I like to do: reading on paper, writing by hand, drawing in physical sketchbooks, got a typewriter for typing without a screen. Choosing to call people on audio more, trying to make more of an effort to see people in person. Going to museums to look at art instead of browsing Pinterest. Defaulting to the library when looking for information.
I’m commenting on this now for two reasons:
1. I am pretty proud of myself for how much I’ve actually managed to reduce the constant stream of modern life esp. as a remote worker in tech!
2. Now that I’ve reached a breaking point of reducing enough noise that it’s NOTICEABLE - I am struck by the silence. I don’t know what to do with it. I don’t know how to navigate it and fill it. I made this space to be able to read and write and think more deeply - for now I feel stuck in limbo where I’m just reacquainting myself with the concept of having any space in my mind at all.

É comum que os alunos de Cšlculo 1 apresentem deficiências graves, escrever (a b)^2 = a^2 b^2 ou não saber colocar termos em evidência. Mas esta turma estš anormalmente problemštica, nem parece que passou pelo pré-cšlculo. Eu comecei o curso fazendo revisão de coisas como estudo de sinais de funções de primeiro e segundo grau, mas eles estão errando coisas ainda mais bšsicas. 🫤

Multiple sign-changing solutions for semilinear subelliptic Dirichlet problem
Hua Chen, Hong-Ge Chen, Jin-Ning Li, Xin Liao
https://arxiv.org/abs/2510.10120 https://

Multiple sign-changing solutions for semilinear subelliptic Dirichlet problem
We study the following perturbation from symmetry problem for the semilinear subelliptic equation \[ \left\{ \begin{array}{cc} -\triangle_{X} u=f(x,u)+g(x,u) & \mbox{in}~Ω, \\[2mm] u\in H_{X,0}^{1}(Ω),\hfill \end{array} \right. \] where $\triangle_{X}=-\sum_{i=1}^{m}X_{i}^{*}X_{i}$ is the self-adjoint sub-elliptic operator associated with Hörmander vector fields $X=(X_{1},X_{2},\ldots,X_{m})$, $Ω$ is an open bounded subset in $\mathbb{R}^n$, and $H_{X,0}^{1}(Ω)$ denotes the weigh…

Or one could use LibreOffice or Apache OpenOffice and not be dependent on some distant service provider.
Online office suites confuse me. It’s unclear what *modern* problem they address. Sharing files is a solved problem. Common data formats exist. https://mastodon.social/@DevOpsPink/11

Tatiana Mikhaleva (@DevOpsPink@mastodon.social)
Attached: 1 image Proton rolled out Proton Sheets - a spreadsheet Google can’t peek into. Gemini: “Show me your data?” You: “No.” Sheets: also no, but in Swiss.🇨🇭🔐 End-to-end encryption, zero-knowledge, even file names get the Swiss-bank treatment. You open a spreadsheet - Big Tech immediately cries. Somewhere in California, an AI whispers: “But… my training data…” Privacy 1 : 0 AI https://proton.me/blog/sheets-proton-drive #Proton #Privacy #Encryption #CyberSe…

The problem is we give sociopaths carte blanche and expect those resisting them to walk on eggshells and be paragons of meekness.
Well, fuck that.

Man kann mit diesen Schweizern nicht über Freiheit sprechen, ganz ein-fach, weil sie es nicht ertragen, dass man sie in Frage stellt, die Freiheit, und dass man sie nicht als ein schweizerisches Monopol betrachtet, sondern als ein Problem. Überhaupt fürchten sie sich vor jeder offenen Frage; sie denken immer gerade so weit, wie sie die Antwort schon in der Tasche haben, eine praktische Antwort, eine Antwort, die ihnen nützlich ist. Und insofern denken sie überhaupt nicht; sie rechtfertigen nur.

The Hurwitz problem for abelian differentials
Julien Boulanger, Rodolfo Guti\'errez-Romo, Erwan Lanneau
https://arxiv.org/abs/2510.09584 https://arxiv.…

The Hurwitz problem for abelian differentials
Fix $g \geq 2$. Let $\mathsf{t}(g)$ be the maximal order of the translation group among all genus-$g$ abelian differentials. By work of Schlage-Puchta and Weitze-Schmithüsen, $\mathsf{t}(g) \leq 4(g - 1)$. They also classify the $g$ attaining this bound. We assume $g$ is outside this class. We first prove that either $\mathsf{t}(g) = (2(m + 1) / m) (g - 1)$ for some $m \in \mathbb{N} \setminus \{0\}$, when regular genus-$g$ origamis exist, or $\mathsf{t}(g) = 2(g - 1)$, when they do not exis…

Locally Linear Convergence for Nonsmooth Convex Optimization via Coupled Smoothing and Momentum
Reza Rahimi Baghbadorani, Sergio Grammatico, Peyman Mohajerin Esfahani
https://arxiv.org/abs/2511.10239 https://arxiv.org/pdf/2511.10239 https://arxiv.org/html/2511.10239
arXiv:2511.10239v1 Announce Type: new
Abstract: We propose an adaptive accelerated smoothing technique for a nonsmooth convex optimization problem where the smoothing update rule is coupled with the momentum parameter. We also extend the setting to the case where the objective function is the sum of two nonsmooth functions. With regard to convergence rate, we provide the global (optimal) sublinear convergence guarantees of O(1/k), which is known to be provably optimal for the studied class of functions, along with a local linear rate if the nonsmooth term fulfills a so-call locally strong convexity condition. We validate the performance of our algorithm on several problem classes, including regression with the l1-norm (the Lasso problem), sparse semidefinite programming (the MaxCut problem), Nuclear norm minimization with application in model free fault diagnosis, and l_1-regularized model predictive control to showcase the benefits of the coupling. An interesting observation is that although our global convergence result guarantees O(1/k) convergence, we consistently observe a practical transient convergence rate of O(1/k^2), followed by asymptotic linear convergence as anticipated by the theoretical result. This two-phase behavior can also be explained in view of the proposed smoothing rule.
toXiv_bot_toot

#Reform der Pflegevericherung #Interview mit Katarina Planer, Professorin für #Pflege und Pflegemangement

Abschaffung des Pflegegrad 1: Bringt sie überhaupt etwas?
Die Bundesregierung überlegt, den Pflegegrad 1 abzuschaffen. Warum das Problem nicht am Pflegegrad 1, sondern woanders liegt, erklärt Pflegewirtin Katarina Planer von der Hochschule Esslingen.

@… below, is the apparent mismatch between 580.95.x and 580.105.x likely to cause an actual problem?
Or does it simply _look_ a little strange?
Thanks
New packages to be INSTALLED:
drm-66-kmod: 6.6.25.1500068_8 [FreeBSD-ports-kmods]
egl-wayland: 1.1.20 [FreeBSD-ports]
nvidia-driver: 580.95.05 [FreeBSD-port…

So am I understanding this correctly that the upcoming NPM authentication and token changes mean our only publishing workflow options henceforth are either switching to OICD Trusted Publishing[1] via GitHub Actions or using granular access tokens. The problem with the former is that I wanted to migrate my projects to Codeberg soon (which isn't supported). The problem with the latter is that granular tokens are unsuitable for publishing packages from a large monorepo, since these tokens a…

thi.ng/umbrella

A CSP approach to Graph Sandwich Problems
Manuel Bodirsky, Santiago Guzm\'an-Pro
https://arxiv.org/abs/2510.09128 https://arxiv.org/pdf/2510.09128

A CSP approach to Graph Sandwich Problems
The \emph{Sandwich Problem} (SP) for a graph class $\calC$ is the following computational problem. The input is a pair of graphs $(V,E_1)$ and $(V,E_2)$ where $E_1\subseteq E_2$, and the task is to decide whether there is an edge set $E$ where $E_1\subseteq E \subseteq E_2$ such that the graph $(V,E)$ belongs to $\calC$. In this paper we show that many SPs correspond to the constraint satisfaction problem (CSP) of an infinite $2$-edge-coloured graph $H$. We then notice that several known comple…

> The underlying problem today was a malfunction at Amazon Web Services, where something called "DNS resolution" was not working
BBC putting quotes around "DNS resolution" there, like it's indecipherable Gen-Z slang.
https://www.bbc.co.uk/news/live/c5y8k7k6v1rt

Snapchat, Roblox and Lloyds bank hit by Amazon Web Services internet outage - live updates
More than 1,000 companies have had 6.5 million reports of disruption, including Snapchat, Reddit, Roblox and Lloyds bank.

If I had a penny for every time I heard something like
"We're going to track increases in productivity that we gain by adopting GenAI"
1. So you're assuming it's an increase
2. Against what control group
3. With no acknowledgement of confounding variables or experiment design
4. Around the...famously open problem of measuring software engineering productivity?

Just keep in mind that the same party also doesn‘t see a problem when school kids die from gun shots. https://mastodon.social/@TwraSun/115547658428106400

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
Ruhan Habib
https://arxiv.org/abs/2510.02399 https://arxiv.org/pdf/2510.02399

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
In the $k$-mismatch problem, given a pattern and a text of length $n$ and $m$ respectively, we have to find if the text has a sub-string with a Hamming distance of at most $k$ from the pattern. This has been studied in the classical setting since 1982 and recently in the quantum computational setting by Jin and Nogler and Kociumaka, Nogler, and Wellnitz. We provide a simple quantum algorithm that solves the problem in an approximate manner, given a parameter $ε\in (0, 1]$. It returns an occurr…

Hithium just made a bold move into long-duration energy storage with three major launches: a massive 1,300Ah battery cell, a 6.9 MW/55.2 MWh system, and a lithium-sodium hybrid specifically designed for power-hungry AI data centers.
The goal? Solve renewable energy's intermittency problem while meeting AI's exploding electricity demands.

Hithium pushes into long-duration storage and AI data centres with 1,300Ah cell, 6.9 MW/55.2 MWh system, and lithium-sodium hybrid
Chinese battery maker Hithium unveils 1300Ah cell, integrated long-duration system, and lithium-sodium LDES solution for AI data centers.

Axion Quality Problem: Keep Calm and Baryon
Prateek Agrawal, Anson Hook, Vazha Loladze, Mario Reig
https://arxiv.org/abs/2510.07366 https://arxiv.org/pdf/2…

Axion Quality Problem: Keep Calm and Baryon
Axion models generically suffer from a severe quality problem when coupled to gravity. In this article we provide a very simple model with a high quality axion. The axion is a pseudo-Nambu-Goldstone boson of the baryon number symmetry, $U(1)_B$, of a new composite sector that breaks $U(1)_B$ spontaneously when it confines. A controlled example is a supersymmetric QCD (SQCD) with $N_c = N_f$. The axion shift symmetry is automatically protected due to the high dimension of the gauge-invariant bar…

The MacBookPro disaster is complete, more or less.
The problem: after installing macos 26.0.1 the MBP failed to reboot successfully. It kept going to the apple logo and the progress bar stopped, and eventually the mac went to Recovery Mode.
Tried:
1. re-install macos Tahoe - no luck.
2. reset NVRAM
3. reset SMC
4. re-install from Time Machine backup on NAS. Took 44 hours.
1/3

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.

RE: https://social.heise.de/@heiseonline/115685397665985024
Die Lösung ist kein Europäischer Torment Nexus. Niemals.
Die Datafikation und damit einhergehende Weltsicht ist das Problem.

Waves, structures, and the Riemann problem for a system of hyperbolic conservation laws
A. P. Chugainova, D. V. Treschev
https://arxiv.org/abs/2510.02070 https://

Waves, structures, and the Riemann problem for a system of hyperbolic conservation laws
A system of hyperbolic conservation laws $$ \partial_t u + \partial_x \partial_u Q = 0, \quad Q = u_1^3 / 3 + u_1 u_2^2, \qquad u = u(x,t) \in\mR^2, $$ as well as its viscous regularization $$ \partial_t u + \partial_x \partial_u Q = \calM \partial_x^2 u, \qquad \calM = \diag (μ_1,μ_2), \quad μ_1>0,\, μ_2>0, $$ are studied. It is assumed that admissible shocks are those that satisfy the requirement of existence of a structure (the traveling wave criterion). A solution of the Riemann…

Finite element approximation to linear, second order, parabolic problems with $L^1$ data
Gabriel Barrenechea, Abner J. Salgado
https://arxiv.org/abs/2510.05331 https://

Finite element approximation to linear, second order, parabolic problems with $L^1$ data
We consider the approximation to the solution of the initial boundary value problem for the heat equation with right hand side and initial condition that merely belong to $L^1$. Due to the low integrability of the data, to guarantee well-posedness, we must understand solutions in the renormalized sense. We prove that, under an inverse CFL condition, the solution of the standard implicit Euler scheme with mass lumping converges, in $L^\infty(0,T;L^1(Ω))$ and $L^q(0,T;W^{1,q}_0(Ω))$ ($q<\tfrac{…

On the Modular Chromatic Index of Random Hypergraphs
Gaia Carenini, Samuel Coulomb
https://arxiv.org/abs/2510.04334 https://arxiv.org/pdf/2510.04334…

On the Modular Chromatic Index of Random Hypergraphs
Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $χ_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or degree congruent to $1$ modulo $k$. For a random hypergraph $H$ drawn from the binomial model $\mathbf{H}(n,p,r)$, with edge probability $p \in (C\log(n)/n,1)$ for a large enough constant $C>0$ independent of $n$ and satisfying $n^{r-1}p(1-p)\to\infty$ as $n\t…

Als wir in dies Wohnung gezogen sind dachten wir ok cool, es gibt hier diese versenkbaren Mülltonnen.
Little did we know
Das Problem ist:
1. die Leute sind zu blöd. Wenn der Sack recht groß ist, dann fällt der nicht nur nicht nach unten beim schließen der Trommel, er verkanntet dann darin.
Danach hört man das ganze Wochenende Leute an dem Ding rütteln und zwar so laut, dass ich davon wach werde, danach werfen sie den Sack einfach daneben. Das machen dann 5 Leute, fertig…

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
Yilong Feng, Haolong Li, Xiaowei Wu, Shengwei Zhou
https://arxiv.org/abs/2510.00965 https://arxiv…

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
We revisit the online bipartite matching problem on $d$-regular graphs, for which Cohen and Wajc (SODA 2018) proposed an algorithm with a competitive ratio of $1-2\sqrt{H_d/d} = 1-O(\sqrt{(\log d)/d})$ and showed that it is asymptotically near-optimal for $d=ω(1)$. However, their ratio is meaningful only for sufficiently large $d$, e.g., the ratio is less than $1-1/e$ when $d\leq 168$. In this work, we study the problem on $(d,d)$-bounded graphs (a slightly more general class of graphs than $d…

Prescribed $p$-curvature problem on Riemannian manifolds with negative curvature
Jiaogen Zhang
https://arxiv.org/abs/2510.06577 https://arxiv.org/pdf/2510.…

Prescribed $p$-curvature problem on Riemannian manifolds with negative curvature
Let $(N,g)$ be a compact Riemannian manifold with negative curvature of dimension $n\geq 3$. This paper investigates the prescribed curvature problem defined by the $p$-fold sum of the modified Shouten tensor for $1\leq p\leq n$. As an application, we establish the existence of a metric $\tilde{g}$ conformal to $g$ such that \[ \mathcal{M}_{p}(\mathrm{Ric}_{\tilde{g}})=constant. \] In the case $p=1$, this resolves a well-known result of Gursky and Viaclovsky [Indiana Univ. Math. J. 52 (2003), n…

Endlösung der Stadtbildfrage als entscheidendes Element im Kampf gegen Rechtspopulismus? Naziopa wäre so stolz.
https://bsky.app/profile/did:plc:nqk7jmnrywou7anuefj3ezzd/post/3m35hz74xdk2j

from my link log —
One jobserver to rule them all: controlling parallelism across many concurrent builds.
https://blogs.gentoo.org/mgorny/2025/11/30/one-jobserver-to-rule-them-all/
saved 2025-12-01

One jobserver to rule them all
A common problem with running Gentoo builds is concurrency. Many packages include extensive build steps that are either fully serial, or cannot fully utilize the available CPU threads throughout. T…

A proud achievement of my half-century IT career happened in 1996 consulting to the #UNDP toward the first published edition of the Humanity Development Library.
It seemed easy enough: "It can be fairly estimated that 1/3, or about 20 million pages of UN, and as much University and NGO material are very useful. Those 20 million pages useful UN publications probably contain about 50% of solutions for major World problems. This information must be released in digital format for non-profit redistribution in all countries."
also portable and accessible to all platforms, everywhere.
Happily, not only did the project live on, but thanks to @… our once-intractable problem of global delivery is now globally solved!
So, whether or not this is timely, I don't know, but should you need to suddenly rebuild some semblance of civilization from scratch…
Humanity Development Library 2.0 CD-ROM 1998 : #HumanityLibrariesProject : #InternetArchive
https://archive.org/details/humanity-development-library-2.0

On the global linear Zarankiewicz problem
Pantelis E. Eleftheriou, Aris Papadopoulos
https://arxiv.org/abs/2510.03546 https://arxiv.org/pdf/2510.03546

On the global linear Zarankiewicz problem
The `global' Zarankiewicz problem for hypergraphs asks for an upper bound on the number of edges of a finite $r$-hypergraph $V$ in terms of the number $|V|$ of its vertices, assuming the edge relation is induced by a fixed $K_{k, \dots, k}$-free $r$-hypergraph $E$, for some $k\in\mathbb N$. In [4], such bounds of size $O(|V|^{r-1})$ were achieved for a semilinear $E$, namely, definable in a linear o-minimal structure. We establish the same bounds in five new settings: when $…

Something that just drives me up the wall about this particular area of Git (merge conflicts) is that, beyond the all-too-typical Git problem of sloppy terminology, this is bad feature design. In most situations, “use ours” and “user theirs” are •both• the wrong answer! There are two doors, and they’re •both• trapdoors.
If you have a merge conflict, that means that you changed something •and• somebody else changed something, and your job is to •synthesize• both changes. To use one is to discard the other, which is usually not what you want!
The thing Git (and every Git GUI) ought to surface is a three-way merge: show me what I changed and what they changed ••relative to the nearest common ancestor••. Yes yes yes, I know it’s possible to finagle that into view with Git. It should be the danged default. It is what I should see first. It is what I should see if I have no idea what I’m doing.
1/ https://hachyderm.io/@jeremydmiller/115741417416659492

VQhull: a Fast Planar Quickhull
Thomas Koopman, Jordy Aaldering, Bernard van Gastel, Sven-Bodo Scholz
https://arxiv.org/abs/2510.09417 https://arxiv.org/pd…

VQhull: a Fast Planar Quickhull
Finding the convex hull is a fundamental problem in computational geometry. Quickhull is a fast algorithm for finding convex hulls. In this paper, we present VQhull, a fast parallel implementation of Quickhull that exploits vector instructions, and coordinates CPU cores in a way that minimizes data movement. This implementation obtains a sequential runtime improvement of 1.6--16x, and a parallel runtime improvement of 1.5-11x compared to the state of the art on the Problem Based Benchmark Suite…

I got a new (used) laptop a few months ago. As is now standard, they've removed the physical mouse buttons and made the touchpad wider. "No problem," I thought, "I've been practicing with tap-to-click!"
After a little while the phantom clicks started driving me nuts. Part of it is due to the wideness, part of it due to sensitivity (moving my finger onto the pad sometimes triggers a click). So tap-to-click is now disabled.. [1/2]

A new elementary proof of the formula $\sum\limits_{n=1}^{\infty}\frac{1}{n^2}=\frac{\pi^2}{6}$
Jia Li
https://arxiv.org/abs/2510.03233 https://arxiv.org/p…

A new elementary proof of the formula $\sum\limits_{n=1}^{\infty}\frac{1}{n^2}=\frac{π^2}{6}$
In this article, we provide a new elementary proof of the Basel problem.

2027 is the planned manned moon landing.
Extende moon stays may require large, energized "shower rooms". For extravehicular personnel equipment. No demonstrations of dust-repellant clothes and tools have been done.
It will be a serious problem BEFORE it's fixed.
#Space #SpaceTechnology

Precise Attribute Intensity Control in Large Language Models via Targeted Representation Editing
Rongzhi Zhang, Liqin Ye, Yuzhao Heng, Xiang Chen, Tong Yu, Lingkai Kong, Sudheer Chava, Chao Zhang
https://arxiv.org/abs/2510.12121

Precise Attribute Intensity Control in Large Language Models via Targeted Representation Editing
Precise attribute intensity control--generating Large Language Model (LLM) outputs with specific, user-defined attribute intensities--is crucial for AI systems adaptable to diverse user expectations. Current LLM alignment methods, however, typically provide only directional or open-ended guidance, failing to reliably achieve exact attribute intensities. We address this limitation with three key designs: (1) reformulating precise attribute intensity control as a target-reaching problem, rather t…

On the Direct Problem in Differential Galois Theory for the Classical Groups
Daniel Robertz, Matthias Seiss
https://arxiv.org/abs/2510.07323 https://arxiv.…

On the Direct Problem in Differential Galois Theory for the Classical Groups
Let $G$ be a classical group of Lie rank $l$ and let $C$ be an algebraically closed field of characteristic zero. For $l$ differential indeterminates $\boldsymbol{v}=(v_1,\dots,v_l)$ over $C$ we constructed in a previous paper a general Picard-Vessiot extension $\mathcal{E}$ of the differential field $C\langle \boldsymbol{s}(\boldsymbol{v})\rangle$ having differential Galois group $G(C)$. Here $ \boldsymbol{s}(\boldsymbol{v})=(s_1(\boldsymbol{v}),\dots,s_l(\boldsymbol{v}))$ are certain differen…

Functional Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem
K. Mahesh Krishna
https://arxiv.org/abs/2510.09609 https://arxiv.org/pdf/2510.09609

Functional Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem
Celebrated breakthrough sparsity theorem obtained independently by Donoho and Elad \textit{[Proc. Natl. Acad. Sci. USA, 2003]} and Gribonval and Nielsen \textit{[IEEE Trans. Inform. Theory, 2003]} and Fuchs \textit{[IEEE Trans. Inform. Theory, 2004]} says that unique sparse solution to NP-Hard $\ell_0$-minimization problem can be obtained using unique solution to P-Type $\ell_1$-minimization problem. In this paper, we extend their result to abstract Banach spaces using 1-approximate Schauder fr…

Winding quotients for virtual period maps of rank 1
Kyoji Saito
https://arxiv.org/abs/2510.04558 https://arxiv.org/pdf/2510.04558

Winding quotients for virtual period maps of rank 1
We illustrate a rank 1 model of virtual period maps and their associated winding quotient, where the winding quotient is a new phenomenon appeared in a recent study of virtual period maps and it requires a reformulation of the classical inversion problem for the period maps. We answer to the new inversion problem by introducing the q-multiplicatively periodic function, whose pull-back to the winding covering space is the Weierstrass p-function up to a correction by Eisenstein series E2, and whi…

Crosslisted article(s) found for hep-th. https://arxiv.org/list/hep-th/new
[1/1]:
- Axion Quality Problem: Keep Calm and Baryon
Prateek Agrawal, Anson Hook, Vazha Loladze, Mario Reig

For now, here's where I am on student LLM-use:
1) The contemporary university's primary social function is certification.
2) Prompting LLMs does not require a degree. For universities, this is existential.
3) Admin tell faculty - academic freedom! - that we alone (without any support) can solve the problem. We can integrate LLMs or track down their illicit use.
4) My job is to teach, not to police students or hawk the hype. So I teach those who want to learn and …

Two-Sided Free Boundary Problems Arising From Branching-Selection Particle Systems
Jacob Mercer
https://arxiv.org/abs/2510.12701 https://arxiv.org/pdf/2510…

Two-Sided Free Boundary Problems Arising From Branching-Selection Particle Systems
We introduce and analyse a two-sided free boundary problem arising from a generalization of the well-known $N$-particle branching Brownian motion ($N$-BBM) model, called the $(N, p)$-BBM, where selection can occur on both the leftmost and rightmost particles according to a parameter $p\in(0,1)$. The main result here establishes that, as $N\to\infty$, the empirical distribution of the $(N,p)$-BBM converges to a deterministic hydrodynamic limit described by a free boundary problem on a finite int…

Some months ago, Trump ordered the halt of minting pennies. OK. Now there is a #Penny shortage coming. Fine.
Problem is: There is no accompanying #law.
"Without the production of new pennies, cash transactions would need to be rounded to the nearest nickel. There are some states and loca…

I was experiencing unusually high VRAM usage on the RX 7800 XT (GPU choking and cr@pping itself) in Ratchet & Clank: Rift Apart (and in a couple of other games). So I decided to use the AMD Cleanup Utility and reinstall the current 25.12.1 drivers. When I started the game again, the ray tracing settings in it were grayed out, and there's NO fixing it, no matter what I tried 😆 And the VRAM issue wasn't fixed 😄
(Grayed out RT settings aslo seem to be a problem on the 9000 s…

Gaussian beam interactions and inverse source problems for nonlinear wave equations
Matti Lassas, Tony Liimatainen, Valter Pohjola, Teemu Tyni
https://arxiv.org/abs/2510.11494 h…

Gaussian beam interactions and inverse source problems for nonlinear wave equations
We study the inverse source problem for the semilinear wave equation \[ (\Box_g + q_1)u + q_2 u^2 = F, \] on a globally hyperbolic Lorentzian manifold. We demonstrate that the coefficients $q_1$ and $q_2$, as well as the source term $F$, can be recovered up to a natural gauge symmetry inherent in the problem from local measurements. Furthermore, if $q_1$ is known, we establish the unique recovery of the source $F$, which is in a striking contrast to inverse source problems for linear equations …

DHS ICE plans to serve breakfast for lunch and dinner sometimes? Like they failed a word problem in grammar school.
Ordered: 16K breakfasts, 26k lunches/dinners.
Intending to feed people 3 meals/day, contract covers 16K breakfasts, 13K lunches & 13K dinners.
So... 3K person days of only 1 meal that day or breakfast for lunch or dinner?
42K meals, but odd way to order them.
Contract already awarded:

Polynomials and asymptotic constants in a resurgent problem from 't Hooft
David Broadhurst
https://arxiv.org/abs/2509.26297 https://arxiv.org/pdf/2509.…

Polynomials and asymptotic constants in a resurgent problem from 't Hooft
In a recent study of the quantum theory of harmonic oscillators, Gerard 't Hooft proposed the following problem: given $G(z)=\sum_{n>0}\sqrt{n}z^n$ for $|z|<1$, find its analytic continuation for $|z|\ge1$, excluding a branch-cut $z\in[1,\,\infty)$. A solution is provided by the bilateral convergent sum $G(z)=\frac12\sqrtπ\sum_{n\in{\mathbb Z}}(2nπ{\rm i}-\log(z))^{-3/2}$. On the negative real axis, $G(-e^u)$ has a sign-constant asymptotic expansion in $1/u^2$, for large p…

Simular, which is building AI agents for Mac and Windows PCs, raised a $21.5M Series A led by Felicis; Simular has released its 1.0 version for macOS (Julie Bort/TechCrunch)
https://techcrunch.com/2025/12/02/simular-relea…

Simular's AI agent wants to run your Mac, Windows PC for you | TechCrunch
Simular, a startup building AI agents for Mac OS and Windows, has solved the AI hallucination problem in a compelling way.

A Generalisation on Erd\H{o}s Distinct Subset Sums Problem
Zijie Gu
https://arxiv.org/abs/2510.06032 https://arxiv.org/pdf/2510.06032

A Generalisation on Erdős Distinct Subset Sums Problem
This paper investigates the Erdős distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better bounds in certain dimensions. This innovation improves previous low-dimensional results and provides a framework for choosing suitable methods depending on the dimension.

Truly, everyone's a "rogue capitalist" now.
It's almost like the problem with companies isn't whether their business model is based on showing you ads or charging you money,
but rather, whether they can abuse you for profit and get away with it.
-- Coty Doctorow
https://mamot.fr/@…

Cory Doctorow (@pluralistic@mamot.fr)
Attached: 1 image Apple has removed ICEBlock, a totally legal app that helps people track the movements of the masked snatch-squads who illegally terrorize brown people in America's cities, capitulating to a warrantless demand from Trump's DoJ boss Pam Bondi: https://www.404media.co/iceblock-owner-after-apple-removes-app-we-are-determined-to-fight-this/ -- If you'd like an essay-formatted version of this thread to read or share, here's a link to it on pluralistic.net, my surveillance-free,…

Convergence analysis of inexact MBA method for constrained upper-$\mathcal{C}^2$ optimization problems
Ruyu Liu, Shaohua Pan
https://arxiv.org/abs/2511.09940 https://arxiv.org/pdf/2511.09940 https://arxiv.org/html/2511.09940
arXiv:2511.09940v1 Announce Type: new
Abstract: This paper concerns a class of constrained optimization problems in which, the objective and constraint functions are both upper-$\mathcal{C}^2$. For such nonconvex and nonsmooth optimization problems, we develop an inexact moving balls approximation (MBA) method by a workable inexactness criterion for the solving of subproblems. By leveraging a global error bound for the strongly convex program associated with parametric optimization problems, we establish the full convergence of the iterate sequence under the partial bounded multiplier property (BMP) and the Kurdyka-{\L}ojasiewicz (KL) property of the constructed potential function, and achieve the local convergence rate of the iterate and objective value sequences if the potential function satisfies the KL property of exponent $q\in[1/2,1)$. A verifiable condition is also provided to check whether the potential function satisfies the KL property of exponent $q\in[1/2,1)$ at the given critical point. To the best of our knowledge, this is the first implementable inexact MBA method with a full convergence certificate for the constrained nonconvex and nonsmooth optimization problem.
toXiv_bot_toot

Crosslisted article(s) found for math.LO. https://arxiv.org/list/math.LO/new
[1/1]:
- The isomorphism problem for finitely generated bi-orderable groups
Filippo Calderoni, Adam Clay

Finite element analysis of an eigenvalue problem arising from neutron transport
Nicol\'as A. Barnafi, Felipe Lepe, Francisca Mu\~noz Riquelme
https://arxiv.org/abs/2510.05368

Finite element analysis of an eigenvalue problem arising from neutron transport
In two and three dimensions, we analyze a finite element method to approximate the solutions of an eigenvalue problem arising from neutron transport. We derive the eigenvalue problem of interest, which results to be non-symmetric. Under a standard finite element approximation based on piecewise polynomials of degree $k \geq 1$, and under the framework of the compact operators theory, we prove convergence and error estimates of the proposed method. We report a series of numerical tests in order …

Remember folks, no matter what they do – be it committing genocide or raping Palestinian prisoners – Israel are our allies. The US loves Israel no matter what. The UK loves Israel no matter what. Germany loves Israel no matter what. And if you have a problem with any of this, you’re a fucking antisemite and probably Hamas. https://

Engineering Dominating Patterns: A Fine-grained Case Study
Jonathan Dransfeld, Marvin K\"unnemann, Mirza Redzic, Marcus Wunderlich
https://arxiv.org/abs/2510.12232 https://…

Engineering Dominating Patterns: A Fine-grained Case Study
The \emph{Dominating $H$-Pattern} problem generalizes the classical $k$-Dominating Set problem: for a fixed \emph{pattern} $H$ and a given graph $G$, the goal is to find an induced subgraph $S$ of $G$ such that (1) $S$ is isomorphic to $H$, and (2) $S$ forms a dominating set in $G$. Fine-grained complexity results show that on worst-case inputs, any significant improvement over the naive brute-force algorithm is unlikely, as this would refute the Strong Exponential Time Hypothesis. Nevertheless…

Ist das der Startschuss? Ein Gerichtsurteil zwingt Alstom ihre Züge in Paris #y2k38 sicher zu machen. 1/3 der des Verkehrssystems würde komplett ausfallen. Alstom hat in den letzten 6 Jahren keine Lösung gefunden. Das ist nur die Soitze des Eisberges. y2k38 kein Problem?! Das sieht Alstom mittlerweile anders. Mehr werden folgen #Y2038

On minimizing surfaces of the CR invariant energy $E_1$
Jih-Hsin Cheng, Hung-Lin Chiu, Paul Yang, Yongbing Zhang
https://arxiv.org/abs/2509.25780 https://a…

On minimizing surfaces of the CR invariant energy $E_1$
We study a CR-invariant equation for vanishing $E_1$ surfaces in the 3-dimensional Heisenberg group. This is shown to be a hyperbolic equation. We prove the local uniqueness theorem for an initial value problem and classify all such global surfaces with rotational symmetry. We also show that the Clifford torus in the CR 3-sphere is not a local minimizer of $E_1$ by computing the second variation.

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
Akitoshi Kawamura, Yusuke Kobayashi
https://arxiv.org/abs/2510.06533 https://a…

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
In the covering version of the pinwheel scheduling problem, a daily task must be assigned to agents under the constraint that agent $i$ can perform the task at most once in any $a_i$-day interval. In this paper, we determine the optimal constant $α^* = 1.264\ldots {}$ such that every instance with $\sum_{i} \frac{1}{a_i} \ge α^*$ is schedulable. This resolves an open problem posed by Soejima and Kawamura (2020). Our proof combines Kawamura's (2024) techniques for the packing version with new …

The problem with the world is that we listen to people with money instead of people with sense.

Sharp local well-posedness of $C^1$ vortex patches
Seungjae Lee
https://arxiv.org/abs/2509.26046 https://arxiv.org/pdf/2509.26046

Sharp local well-posedness of $C^1$ vortex patches
It is well known that the boundary dynamics of vortex patches is globally well-posed in the Hölder space $C^{1,α}$ for $0<α<1$, whereas the well-posedness in $C^1$ remains an open problem, even locally. In this paper, we establish the local well-posedness for vortex patches in the space $C^{1,φ}$ defined via a modulus of continuity $φ$ that satisfies certain structural assumptions. Our class includes curves that are strictly rougher than the Hölder-continuous ones, with prototypical examp…

The maximum product of sizes of cross-\(t\)-intersecting families
Jingjun Bao, Lijun Ji
https://arxiv.org/abs/2510.11724 https://arxiv.org/pdf/2510.11724…

The maximum product of sizes of cross-\(t\)-intersecting families
Two families of sets \(\mathcal{A}\) and \(\mathcal{B}\) are called \emph{cross-\(t\)-intersecting} if \(|A \cap B| \geq t\) for all \(A \in \mathcal{A}\) and \(B \in \mathcal{B}\). Determining the maximum product of sizes for such cross-\(t\)-intersecting families is an active problem in extremal set theory. In this paper, we verify the following cross-\(t\)-intersecting version of the Erdős-Ko-Rado theorem: For \(k\geq l \geq t \geq 3\) and \(\min\{m,n\} \geq (t+1)(k-t+1)\), the ma…

Replaced article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- A tactical time slot management problem under mixed logit demand
Dorsa Abdolhamidi, Virginie Lurkin

Algorithm for constructing optimal explicit finite-difference formulas in the Hilbert space
R. S. Karimov, D. D. Atoev
https://arxiv.org/abs/2510.06643 https://

Algorithm for constructing optimal explicit finite-difference formulas in the Hilbert space
This work presents problems of constructing finite-difference formulas in the Hilbert space, i.e., setting problems of constructing finite-difference formulas using functional methods. The work presents a functional statement of the problem of optimizing finite-difference formulas in the space $W_{2}^{\left(m,m-1\right)} \left(0,1\right)$. Here, representations of optimal coefficients of explicit finite-difference formulas of the Adams type on classes $W_{2}^{\left(m,m-1\right)} \left(0,1\right…

Sublinear Metric Steiner Forest via Maximal Independent Set
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
https://arxiv.org/abs/2510.11627 https://

Sublinear Metric Steiner Forest via Maximal Independent Set
In this work we consider the Metric Steiner Forest problem in the sublinear time model. Given a set $V$ of $n$ points in a metric space where distances are provided by means of query access to an $n\times n$ distance matrix, along with a set of $k$ terminal pairs $(s_1,t_1), \dots, (s_k,t_k)\in V\times V$, the goal is to find a minimum-weight subset of edges that connects each terminal pair. Although sublinear time algorithms have been studied for estimating the weight of a minimum spanning tre…

Crosslisted article(s) found for math.NT. https://arxiv.org/list/math.NT/new
[1/1]:
- On the Direct Problem in Differential Galois Theory for the Classical Groups
Daniel Robertz, Matthias Seiss

Existence and Nonexistence Breaking Results For a Weighted Elliptic Problem in Half-Space
J. M. Do \'O, R. F. Freire, J. Giacomoni, E. S. Medeiros
https://arxiv.org/abs/2510.05999

Existence and Nonexistence Breaking Results For a Weighted Elliptic Problem in Half-Space
In this paper we study the problem $-\mathrm{div}(ρ(x_N)\nabla u)=a|u|^{p-2}u$ in $\mathbb{R}^N_+$, $-\partial u/\partial x_N=b|u|^{q-2}u$ in $\mathbb{R}^{N-1}$ where $a,b \in \mathbb{R}$, $p,q\in (1,\infty)$ and $ρ$ is a positive weight. We establish regularity results for weak solutions and, using a variational approach combined with a new Pohozaev-type identity, we show that the introduction of the weighted operator $-\mathrm{div}(ρ(x_N)\nabla u)$ can reverse the known…

Temporal Variabilities Limit Convergence Rates in Gradient-Based Online Optimization
Bryan Van Scoy, Gianluca Bianchin
https://arxiv.org/abs/2510.12512 https://

Temporal Variabilities Limit Convergence Rates in Gradient-Based Online Optimization
This paper investigates the fundamental performance limits of gradient-based algorithms for time-varying optimization. Leveraging the internal model principle and root locus techniques, we show that temporal variabilities impose intrinsic limits on the achievable rate of convergence. For a problem with condition ratio $κ$ and time variation whose model has degree $n$, we show that the worst-case convergence rate of any minimal-order gradient-based algorithm is $ρ_\text{TV} = (\frac{κ-1}{κ+1…

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
Yashaswini Mathur, Prafullkumar Tale
https://arxiv.org/abs/2510.06102 https://arx…

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
We study the \textsc{Labeled Contractibility} problem, where the input consists of two vertex-labeled graphs $G$ and $H$, and the goal is to determine whether $H$ can be obtained from $G$ via a sequence of edge contractions. Lafond and Marchand~[WADS 2025] initiated the parameterized complexity study of this problem, showing it to be \(\W[1]\)-hard when parameterized by the number \(k\) of allowed contractions. They also proved that the problem is fixed-parameter tractable when parameterized …

Clique number of xor-powers of Kneser graphs
Zolt\'an F\"uredi, Andr\'as Imolay, \'Ad\'am Schweitzer
https://arxiv.org/abs/2510.01509 https://

Clique number of xor-powers of Kneser graphs
Let $f_\ell(n, k)$ denote the clique number of the xor-product of $\ell$ isomorphic Kneser graphs KG(n,k). Alon and Lubetzky investigated the case of complete graphs as a coding theory problem and showed $f_\ell(n,1)\leq \ell n +1$. Imolay, Kocsis, and Schweitzer proved that $f_2(n,k)\leq n/k +c(k)$. Here, the order of magnitude of $c(k)$ is determined to be $Θ\left( k \binom{2k}{k} \right)$. By explicit constructions and by an algebraic proof, it is shown that $\ell n- 2\ell-1 \leq f_\ell(n…

Replaced article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
Yaguang Yang
https://arxiv.org/abs/1212.5929
- Quantum computing and the stable set problem
Alja\v{z} Krpan, Janez Povh, Dunja Pucher
https://arxiv.org/abs/2405.12845 https://mastoxiv.page/@arXiv_mathOC_bot/112483516437815686
- Mean Field Game with Reflected Jump Diffusion Dynamics: A Linear Programming Approach
Zongxia Liang, Xiang Yu, Keyu Zhang
https://arxiv.org/abs/2508.20388 https://mastoxiv.page/@arXiv_mathOC_bot/115111048711698998
- Differential Dynamic Programming for the Optimal Control Problem with an Ellipsoidal Target Set a...
Sungjun Eom, Gyunghoon Park
https://arxiv.org/abs/2509.07546 https://mastoxiv.page/@arXiv_mathOC_bot/115179281556444440
- On the Moreau envelope properties of weakly convex functions
Marien Renaud, Arthur Leclaire, Nicolas Papadakis
https://arxiv.org/abs/2509.13960 https://mastoxiv.page/@arXiv_mathOC_bot/115224514482363803
- Automated algorithm design via Nevanlinna-Pick interpolation
Ibrahim K. Ozaslan, Tryphon T. Georgiou, Mihailo R. Jovanovic
https://arxiv.org/abs/2509.21416 https://mastoxiv.page/@arXiv_mathOC_bot/115286533597711930
- Optimal Control of a Bioeconomic Crop-Energy System with Energy Reinvestment
Othman Cherkaoui Dekkaki
https://arxiv.org/abs/2510.11381 https://mastoxiv.page/@arXiv_mathOC_bot/115372322896073250
- Point Convergence Analysis of the Accelerated Gradient Method for Multiobjective Optimization: Co...
Yingdong Yin
https://arxiv.org/abs/2510.26382 https://mastoxiv.page/@arXiv_mathOC_bot/115468018035252078
- History-Aware Adaptive High-Order Tensor Regularization
Chang He, Bo Jiang, Yuntian Jiang, Chuwen Zhang, Shuzhong Zhang
https://arxiv.org/abs/2511.05788
- Equivalence of entropy solutions and gradient flows for pressureless 1D Euler systems
Jos\'e Antonio Carrillo, Sondre Tesdal Galtung
https://arxiv.org/abs/2312.04932 https://mastoxiv.page/@arXiv_mathAP_bot/111560077272113052
- Kernel Modelling of Fading Memory Systems
Yongkang Huo, Thomas Chaffey, Rodolphe Sepulchre
https://arxiv.org/abs/2403.11945 https://mastoxiv.page/@arXiv_eessSY_bot/112121123836064435
- The Maximum Theoretical Ground Speed of the Wheeled Vehicle
Altay Zhakatayev, Mukatai Nemerebayev
https://arxiv.org/abs/2502.15341 https://mastoxiv.page/@arXiv_physicsclassph_bot/114057765769441123
- Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
Giacomo Greco, Luca Tamanini
https://arxiv.org/abs/2504.11133 https://mastoxiv.page/@arXiv_mathPR_bot/114346453424694503
- Optimizing the ground state energy of the three-dimensional magnetic Dirichlet Laplacian with con...
Matthias Baur
https://arxiv.org/abs/2504.21597 https://mastoxiv.page/@arXiv_mathph_bot/114431404740241516
- A localized consensus-based sampling algorithm
Arne Bouillon, Alexander Bodard, Panagiotis Patrinos, Dirk Nuyens, Giovanni Samaey
https://arxiv.org/abs/2505.24861 https://mastoxiv.page/@arXiv_mathNA_bot/114612580684567066
- A Novel Sliced Fused Gromov-Wasserstein Distance
Moritz Piening, Robert Beinert
https://arxiv.org/abs/2508.02364 https://mastoxiv.page/@arXiv_csLG_bot/114976243138728278
- Minimal Regret Walras Equilibria for Combinatorial Markets via Duality, Integrality, and Sensitiv...
Alo\"is Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
https://arxiv.org/abs/2511.09021 https://mastoxiv.page/@arXiv_csGT_bot/115541243299714775
toXiv_bot_toot