If $\sum_n n! c_n z^n$ is entire and $c_n$ does not terminate, then $\sum_n c_n z^n$ has infinitely many zeros
Alann Rosas
https://arxiv.org/abs/2510.10054 https://

If $\sum_n n! c_n z^n$ is entire and $c_n$ does not terminate, then $\sum_n c_n z^n$ has infinitely many zeros
We prove that if $\sum_n n! c_n z^n$ is entire and $c_n$ does not terminate, then $\sum_n c_n z^n$ has infinitely many zeros. We then use this result to give alternative proofs that the Le Roy functions $f_r(z)=\sum_{n=0}^\infty \frac{z^n}{(n!)^r}$ for $r>1$ and Bessel functions $J_α(z)=\sum_{m=0}^\infty \frac{(-1)^m}{m!Γ(m+α+1)}\left(\frac{z}{2}\right)^{2m+α}$ for $α\in\mathbb R$ have infinitely many zeros.

On some conjectural supercongruences involving the sequence $t_n(x)$
Hui-Li Han, Chen Wang
https://arxiv.org/abs/2510.11338 https://arxiv.org/pdf/2510.1133…

On some conjectural supercongruences involving the sequence $t_n(x)$
In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine $\sum_{n=0}^{p-1}t_n(x)^2$ and $\sum_{n=0}^{p-1}(n+1)t_n(x)^2$ modulo $p^2$; for example, we establish that \begin{align*} \sum_{n=0}^{p-1}t_n(x)^2\equiv\begin{cases} \left(\dfrac{-1}{p}\right)\pmod{p^2},&\text{if }2x\equiv-1\pmod{p},\\[8pt] (-1)^{\langle x\rangle…

🇺🇦 Auf radioeins läuft...
Rosalía:
🎵 Porcelana
#NowPlaying #Rosalía
#newRelease 🆕 album
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

Bounded Littlewood identities with fixed number of odd rows or odd columns
JiSun Huh, Jang Soo Kim, Christian Krattenthaler, Soichi Okada
https://arxiv.org/abs/2510.11054 https:…

Bounded Littlewood identities with fixed number of odd rows or odd columns
A Littlewood identity is an identity equating a sum of Schur functions with an infinite product. A bounded Littlewood identity is one where the sum is taken over the partitions with a bounded number of rows or columns. The price to pay is that the infinite product has to be replaced by a determinant. The focus of this article is on refinements of such bounded Littlewood identities where one also prescribes the number of odd-length rows or columns of the partitions. Goulden [{\it Discrete Math.}…

Affine-Orthogonal Manifolds and Deformation to Levi-Civita Connections
Mihail Cocos
https://arxiv.org/abs/2510.09648 https://arxiv.org/pdf/2510.09648

Affine-Orthogonal Manifolds and Deformation to Levi-Civita Connections
We study a class of affine manifolds equipped with a flat affine connection $\nabla$ and a global Riemannian metric $g$ that is diagonal in local affine coordinates. These structures are closely related to \emph{Hessian manifolds}, where the metric locally arises as the Hessian of a smooth potential. For example, the Hopf manifold $(\mathbb{R}^{n+1}\setminus \{0\}) / \langle x \mapsto 2x \rangle$ with metric $g = (\sum_i x_i^2)^{-1} \sum_i dx_i^2$ admits a proper deformation of $\nabla$ into it…

On the Ratat-Goormaghtigh equation and integer points close to the graph of a smooth function
Tomohiro Yamada
https://arxiv.org/abs/2510.11252 https://arxi…

On the Ratat-Goormaghtigh equation and integer points close to the graph of a smooth function
We prove that the sum of reciprocals $1/x$ of integer solutions of $(x^m-1)/(x-1)=N$ with $x, m\geq 2$ for a given integer $N$ except the smallest $x$ is smaller than $5.9037$. If we limit $x$ to be prime, then the sum is smaller than $0.73194$.

VeritasFi: An Adaptable, Multi-tiered RAG Framework for Multi-modal Financial Question Answering
Zhenghan Tai, Hanwei Wu, Qingchen Hu, Jijun Chi, Hailin He, Lei Ding, Tung Sum Thomas Kwok, Bohuai Xiao, Yuchen Hua, Suyuchen Wang, Peng Lu, Muzhi Li, Yihong Wu, Liheng Ma, Jerry Huang, Jiayi Zhang, Gonghao Zhang, Chaolong Jiang, Jingrui Tian, Sicheng Lyu, Zeyu Li, Boyu Han, Fengran Mo, Xinyue Yu, Yufei Cui, Ling Zhou, Xinyu Wang

VeritasFi: An Adaptable, Multi-tiered RAG Framework for Multi-modal Financial Question Answering
Retrieval-Augmented Generation (RAG) is becoming increasingly essential for Question Answering (QA) in the financial sector, where accurate and contextually grounded insights from complex public disclosures are crucial. However, existing financial RAG systems face two significant challenges: (1) they struggle to process heterogeneous data formats, such as text, tables, and figures; and (2) they encounter difficulties in balancing general-domain applicability with company-specific adaptation. To…

Accelerated stochastic first-order method for convex optimization under heavy-tailed noise
Chuan He, Zhaosong Lu
https://arxiv.org/abs/2510.11676 https://a…

Accelerated stochastic first-order method for convex optimization under heavy-tailed noise
We study convex composite optimization problems, where the objective function is given by the sum of a prox-friendly function and a convex function whose subgradients are estimated under heavy-tailed noise. Existing work often employs gradient clipping or normalization techniques in stochastic first-order methods to address heavy-tailed noise. In this paper, we demonstrate that a vanilla stochastic algorithm -- without additional modifications such as clipping or normalization -- can achieve op…

Active IRS Assisted Joint Uplink and Downlink Communications
Qiaoyan Peng, Qingqing Wu, Guangji Chen, Wen Chen, Shaodan Ma
https://arxiv.org/abs/2510.10045 https://

Active IRS Assisted Joint Uplink and Downlink Communications
In this paper, we investigate an intelligent reflecting surface (IRS) aided wireless communication system, where active IRSs (AIRSs) are deployed to assist communication between a base station (BS) and users of both the uplink (UL) and downlink (DL). We aim to maximize the weighted sum rate (WSR) of UL and DL communications through joint optimization of BS, AIRS beamforming, and AIRS element allocation. First, we study three deployment schemes, namely distributed AIRSs, BS-side AIRS, and user-s…

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
Pan Peng, Christian Sohler, Yi Xu
https://arxiv.org/abs/2510.11547 https://arxiv.org/pd…

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
Single-linkage clustering is a fundamental method for data analysis. Algorithmically, one can compute a single-linkage $k$-clustering (a partition into $k$ clusters) by computing a minimum spanning tree and dropping the $k-1$ most costly edges. This clustering minimizes the sum of spanning tree weights of the clusters. This motivates us to define the cost of a single-linkage $k$-clustering as the weight of the corresponding spanning forest, denoted by $\mathrm{cost}_k$. Besides, if we consider …

Finite element analysis of a nonlinear heat Equation with damping and pumping effects
Rishabh Shukla, Wasim Akram, Manil T. Mohan
https://arxiv.org/abs/2510.10210 https://

Finite element analysis of a nonlinear heat Equation with damping and pumping effects
We study the following nonlinear heat equation with damping and pumping effects (a reaction-diffusion equation) posed on a bounded simply connected convex domain $Ω\subset \mathbb{R}^d$, $d \geq 1$ with Lipschitz boundary $\partialΩ$: $$ \frac{\partial u(t)}{\partial t} - νΔu(t) + α|u(t)|^{p-2}u(t) - \sum_{\ell=1}^M β_{\ell} |u(t)|^{q_{\ell}-2}u(t) = f(t), \quad t>0, $$ subject to homogeneous Dirichlet boundary conditions and the initial condition $u(0)=u_0$, where $2 …

The generalized Zagreb index for non-plane and plane recursive trees
Qunqiang Feng, Michael Fuchs, Tsan-Cheng Yu
https://arxiv.org/abs/2510.10569 https://a…

The generalized Zagreb index for non-plane and plane recursive trees
The Zagreb index, which is defined as the sum of squares of degrees of the nodes of a tree, was studied in previous works by martingale techniques for random non-plane recursive trees and classes of random trees which are close to random plane recursive trees. These techniques are not easily amended to the generalized Zagreb index, which is defined similar but with squares replaced by higher powers. In this paper, we use the moment transfer approach to (i) obtain the first-order asymptotics of …

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…

Completely Positive Biquadratic Tensors
Liqun Qi, Chunfeng Cui, Haibin Chen, Yi Xu
https://arxiv.org/abs/2510.10972 https://arxiv.org/pdf/2510.10972…

Completely Positive Biquadratic Tensors
In this paper, we systemically introduce completely positive biquadratic (CPB) tensors and copositive biquadratic tensors. We show that all weakly CPB tensors are sum of squares tensors, the CPB tensor cone and the copositive biquadratic tensor cone are dual cone to each other. We also show that the outer product of two completely positive matrices is a CPB tensor, and the outer product of two copositive matrices is a copositive biquadratic tensor. We then study two easily checkable subclasses …

Watch Dallas Cowboys-New York Giants fight perfectly sum up disaster season https://www.si.com/nfl/cowboys/onsi/news/watch-dallas-cowboys-giants-fight-perfectly-sum-up-disaster-season

Vandermonde Cells Through the Lens of Positive Geometry
Fatemeh Mohammadi, Sebastian Seemann
https://arxiv.org/abs/2510.11614 https://arxiv.org/pdf/2510.11…

Vandermonde Cells Through the Lens of Positive Geometry
We study the geometric and algebraic structure of Vandermonde cells, defined as images of the standard probability simplex under the Vandermonde map given by consecutive power sum polynomials. Motivated by their combinatorial equivalence to cyclic polytopes, which are well-known examples of positive geometries and tree amplituhedra, we investigate whether Vandermonde cells admit the structure of positive geometries. We derive explicit parametrizations and algebraic equations for their boundary …

Hamilton-Jacobi Reachability for Viability Analysis of Constrained Waste-to-Energy Systems under Adversarial Uncertainty
Achraf Bouhmady, Othman Cherkaoui Dekkaki
https://arxiv.org/abs/2510.11396

Hamilton-Jacobi Reachability for Viability Analysis of Constrained Waste-to-Energy Systems under Adversarial Uncertainty
This paper investigates the problem of maintaining the safe operation of Waste-to-Energy (WtE) systems under operational constraints and uncertain waste inflows. We model this as a robust viability problem, formulated as a zero-sum differential game between a control policy and an adversarial disturbance. Within a Hamilton-Jacobi framework, the viability kernel is characterized as the zero sublevel set of a value function satisfying a constrained Hamilton-Jacobi-Bellman (HJB) equation in the vi…

from my link log —
Sum types in Julia and Rust.
https://andreaskroepelin.de/blog/sum_types/
saved 2020-08-31 https://dotat.at/:/D7RR…

Nike quietly sold its digital products subsidiary RTFKT on December 16 for an undisclosed sum, roughly one year after Nike shuttered the NFT unit (Matthew Kish/Oregonian)
https://www.oregonlive.com/business/2026/01/n…

Nike sells RTFKT: Digital products subsidiary quietly offloaded in December
The sale comes as CEO Elliott Hill refocuses Nike on sports and questions persist about Converse’s future after a 30% sales drop.

Movable Antenna Enhanced Covert Dual-Functional Radar-Communication: Joint Beamforming and Antenna Position Optimization
Ran Yang, Zheng Dong, Peng Cheng, Lin Zhang, Wanting Lyu, Yue Xiu, Ning Wei, Chadi Assi
https://arxiv.org/abs/2510.09949

Movable Antenna Enhanced Covert Dual-Functional Radar-Communication: Joint Beamforming and Antenna Position Optimization
Movable antenna (MA) has emerged as a promising technology to flexibly reconfigure wireless channels by adjusting antenna placement. In this paper, we study a dual-functional radar-communication (DFRC) system enhanced with movable antennas. To ensure communication security, we aim to maximize the achievable sum rate by jointly optimizing the transmit beamforming vectors, receiving filter, and antenna placement, subject to radar signal-to-noise ratio (SNR) performance and transmission covertness…

On the distinction between Kloosterman sums and multiplicative functions
Yang Zhang
https://arxiv.org/abs/2510.10721 https://arxiv.org/pdf/2510.10721

On the distinction between Kloosterman sums and multiplicative functions
Let $S(a,b;n)$ be the Kloosterman sum. For any integers $a\neq0,b\neq0,k\geqslant2$, any given complex number $η\not=0$ and multiplicative function $f: \mathbb{N} \rightarrow \mathbb{C}$, we show that \[ |\{n\leqslant X:S(a,b;n)=ηf(n), n \text{ square-free }k\text{-almost prime}\}|\leqslant π(\dfrac{X}{L_k})+O(X^{1-\frac{1}{2k}}) \] and \[ |\{n\leqslant X:S(a,b;n)=ηf(n), n \text{ square-free}\}|\leqslant π(X)+O(Xe^{-\sqrt{\log X}}) \] as $X\rightarrow \infty$. Here, $L_…

RE: https://flipboard.social/@newsguyusa/115861173721374216
Hey, this is a great idea! While we're at it, we should send lump sum payments to everyone who lives in the US, too. We could call it.. Universal Bribery Income or something. This "UB…

That’s a fascinating website by @…
https://nonzerosum.games/

NON-ZERO-SUM GAMES
~ a world-help site ~

"I've been using OmniOutliner for 20 years, and it's truly the best (and most trusted) system I've found to stop trying to use my brain as a filing cabinet."
— Phil Alden Robinson, Director and Screenwriter (whose films include Field of Dreams, Sneakers, and The Sum of All Fears)
https://en.w…

“Notes on Being a Man”, by Scott Galloway. An interview by Jordan Klepper on The Daily Show.
Nearly one in five men in their 30s still live with their parents, and 15% report having no close friends. Men are also four times more likely to die by suicide than women.
“Guiding boys to become men is not a zero sum game. Everyone benefits.”
htt…

🇺🇦 #NowPlaying on KEXP's #VarietyMix
ROSALÍA:
🎵 Porcelana
#ROSALÍA
#newRelease 🆕 album
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

Yeah, Jimmy “I’m actually quite in favour of business and capitalism and all that”* Wales, the surveillance capitalist and Fandom-president adtech man who once told me he doesn’t believe in any form of government regulation – not even in food standards or healthcare – can go fuck himself.
Find better heroes. Or even better yet, get over the whole stupid concept itself.
*

Gauss and p-adic numbers
Franz Lemmermeyer
https://arxiv.org/abs/2510.11559 https://arxiv.org/pdf/2510.11559

Gauss and p-adic numbers
In his notebooks, Gauss recorded various calculations with "infinite congruences". These infinite congruences are p-adic numbers; Gauss computes a square root of $5$ in the $11$-adic integers in order to find an $11$-adic approximation to a quadratic Gauss sum, computes a nontrivial square root of $1$ in $10$-adic integers, and computes the $10$-adic logarithms of small natural numbers.

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

I made a nice sum of money on the prediction markets betting on the winner of this year's FIFA Peace Prize.

A summit has begun in Brussels to decide the fate of aid to Ukraine #shorts: https://benborges.xyz/2025/12/03/a-summit-has-begun-in.html

“Would it be particularly helpful to have some text that would be •typical• in a given context, even if the text is possibly •incorrect•?”
∑ vet potential applications of LLMs with this one weird question!

Accenture agrees to acquire UK AI startup Faculty, which works with the UK government, for an undisclosed sum; Faculty CEO Marc Warner will become Accenture CTO (Mark Bergen/Bloomberg)
https://www.bloomberg.com/news/articles/20

When people talk about the Enlightenment as if it were an intellectual garden party where everyone sipped wine and agreed about reason, they're missing the part where producing and distributing ideas was (in fact) dangerous and thankless work.
Today we have more information than any civilization in history.
But aside from Wikipedia, we've organized the sum total of our collective knowledge into formats optimized for making people angry at strangers in pursuit of private …

The Case for Blogging in the Ruins
In 1751, Denis Diderot began publishing his Encyclopédie, a project that would eventually span 28 volumes and take more than two decades to complete. The French government banned it twice. The Catholic Church condemned it, Diderot's collaborators abandoned him, his publisher secretly censored entries behind his back, and he worked

"Debt does matter, but the debt that matters in a capitalist economy is not so much public debt, but corporate debt. The latest estimates are that in the major economies, some 30%-plus of companies have so much debt that they do not earn enough profits to service that debt."
...
"the stock market may be booming ... but the rest of the economy is not so buoyant; and there appear to be cockroaches eating into the clean running of the world of debt. "
Michae…

Debt and the cockroaches
Let the Financial Times sum it up: “US stocks ride AI hype and trade truce to 6-month winning streak S&P 500 and Nasdaq post longest runs of monthly gains in years.” The FT points out that US s…

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
Taira Tsuchiya
https://arxiv.org/abs/2510.11691 https://arxiv.org/pdf…

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
In two-player zero-sum games, the learning dynamic based on optimistic Hedge achieves one of the best-known regret upper bounds among strongly-uncoupled learning dynamics. With an appropriately chosen learning rate, the social and individual regrets can be bounded by $O(\log(mn))$ in terms of the numbers of actions $m$ and $n$ of the two players. This study investigates the optimality of the dependence on $m$ and $n$ in the regret of optimistic Hedge. To this end, we begin by refining existing …

🤼‍♂️ Japan's sumo association turns 100, but the sport's rituals have a much older role shaping ideas about the country
https://theconversation.com/japans-sumo-association-turns-100-but…

Japan’s sumo association turns 100 – but the sport’s rituals have a much older role shaping ideas about the country
As Japan’s national sport, sumo has shaped perceptions of its culture since the mid-1800s.

Sonnet 049 - XLIX
Against that time, if ever that time come,
When I shall see thee frown on my defects,
When as thy love hath cast his utmost sum,
Called to that audit by advis'd respects;
Against that time when thou shalt strangely pass,
And scarcely greet me with that sun, thine eye,
When love, converted from the thing it was,
Shall reasons find of settled gravity;
Against that time do I ensconce me here,
Within the knowledge …

""Rousseau invites endless introspection. Franklin invites progress. The first is about how you feel; the second is about what you build.
I find the Franklin model far more useful. Not because it’s truer in some cosmic sense, but because it gives you agency. You can’t always change how you feel, but you can always decide what to do next.""

Had Fun

Bought a car/micro-camper

Bought a van to do up as a micro-camper, and did a temporary rush job of that conversion myself while waiting in the list for the pro to do it.
Then the pro gave himself a health criss the week it was booked so I took apart my temp job and only got another temp kit-job in it's place.
Went out in it like four times during that and then broke my wrist and couldn't really use it or improve it.
Then had to take it apart even more to try
and figure out where the ad-blue hole was.
I will do a proper permanent job of the
floor and walls and ceiling and adjustments to the kit-job to make it the nicest it's been so far during the spring next year.
My assumption that the prior conversion
into a van and for wheelchair-access meant the microcamper conversion was half-done already turned out to be false.
If I buy a new one, it'll be one that has never been wheelchair adapted.
But it's going okay. Only scraped it once so far.
Fewer than aimed for or booked, but I broke my wrist and had to cancel the second half of the summer.
Went to a conference about money and computers and fringe decentralized social media and it wasn't as boring as you might expect and felt pretty much like a festival.
Exactly the target number! It's lovely.
Took 3 times longer than I'd hoped and
50% more money than I'd planned for really.
Still improvements to make but they will
be incremental and gradual over the coming year or two now.
It's been interest-only for 20 years so a big old lump sum payment that I never really expected to be able to make. Expected to have to sell and move at the end of the mortgage term.
But surprisingly the stocks ISA got high enough to pay it off after all, so I did that.
Cash-flow ruined by that and the bedroom but should start to feel a bit richer next year.

On Dynamic Programming Theory for Leader-Follower Stochastic Games
Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur, Fran\c{c}ois Schwarzentruber
https://arxiv.org/abs/2512.05667 https://arxiv.org/pdf/2512.05667 https://arxiv.org/html/2512.05667
arXiv:2512.05667v1 Announce Type: new
Abstract: Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best responds, yielding a strong Stackelberg equilibrium (SSE) with leader-favourable tie-breaking. This paper introduces a dynamic programming (DP) framework that applies Bellman recursion over credible sets-state abstractions formally representing all rational follower best responses under partial leader commitments-to compute SSEs. We first prove that any LF-GSSG admits a lossless reduction to a Markov decision process (MDP) over credible sets. We further establish that synthesising an optimal memoryless deterministic leader policy is NP-hard, motivating the development of {\epsilon}-optimal DP algorithms with provable guarantees on leader exploitability. Experiments on standard mixed-motive benchmarks-including security games, resource allocation, and adversarial planning-demonstrate empirical gains in leader value and runtime scalability over state-of-the-art methods.
toXiv_bot_toot

Created two small linters improving an ergonomics of type switches in Go by adding exhaustive match check. With those tools adding a new case become a lint error.
https://github.com/gomoni/sumlint
1. oneoflint does an exhaustive check for code implementing protobuf's oneof

GitHub - gomoni/sumlint: Exhaustiveness checks for your interface "sum types" using a lightweight naming convention + `go vet`.
Exhaustiveness checks for your interface "sum types" using a lightweight naming convention + `go vet`. - gomoni/sumlint

Was watching a talk by Sarah Wilson at TEDxSydney: "How to respond to a societal collapse"
Takeaway: If you're looking for an alternate word for "clusterfuck" (like if you're doing an RCA for US-EAST-1) I'm here to share that with you.
#ClusterFuck #Metacrisis

🇺🇦 #NowPlaying on KEXP's #MiddayShow
Rochelle Jordan:
🎵 Sum
#RochelleJordan
https://rochellejordan.bandcamp.com/track/sum
https://open.spotify.com/track/3MIVJlKGcLfYNLso4pp6dn

The whole day so far, after doing some chores around the city, is depressing a few layers high ∑ and a few layers deep ↓
I am somewhere in the middle ∝ and miraculously alright, but I don't like it.

Larry Summers "stepping back" from public roles after Epstein files release (Rebecca Falconer/Axios)
https://www.axios.com/2025/11/18/larry-summers-harvard-epstein
http://www.memeorandum.com/251117/p166#a251117p166

The annual fundraiser support for Wikimedia from the richest man in the world is a dystopian right-wing infused parody site of #Wikipedia.
So if you‘d rather support free access to the sum of all human knowledge instead of billionaire tech bros, you get a chance to donate out of spite.

00
=
@@
\(\Sigma\lambda\)
#meme

Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
David Pennock, Daniel Schoepflin, Kangning Wang
https://arxiv.org/abs/2512.05235 https://arxiv.org/pdf/2512.05235 https://arxiv.org/html/2512.05235
arXiv:2512.05235v1 Announce Type: new
Abstract: We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among $n$ teams in a league. Such a mechanism should satisfy the natural properties of monotonicity and Condorcet consistency. Moreover, from the league's perspective, the winner-determination tournament rule should be strategyproof, meaning that no team can do better by losing a game on purpose.
Past work considered settings in which each team is fully selfish, caring only about its own probability of winning, and settings in which each team is fully selfless, caring only about the total winning probability of itself and the team to which it deliberately loses. More recently, researchers considered a mixture of these two settings with a parameter $\lambda$. Intermediate selfishness $\lambda$ means that a team will not lose on purpose unless its pair gains at least $\lambda s$ winning probability, where $s$ is the individual team's sacrifice from its own winning probability. All of the dozens of previously known tournament rules require $\lambda = \Omega(n)$ to be strategyproof, and it has been an open problem to find such a rule with the smallest $\lambda$.
In this work, we make significant progress by designing a tournament rule that is strategyproof with $\lambda = 11$. Along the way, we propose a new notion of multiplicative pairwise non-manipulability that ensures that two teams cannot manipulate the outcome of a game to increase the sum of their winning probabilities by more than a multiplicative factor $\delta$ and provide a rule which is multiplicatively pairwise non-manipulable for $\delta = 3.5$.
toXiv_bot_toot

Did you choose your major poorly in college, and are so obsessed with being in London that you are willing to accept a sub-living wage to reside there? Or is your partner well enough paid to maintain you, but you don't want to be bored at home? Are you independently wealthy, perhaps? Please consider subsidizing the British State with your labor in exchange for a token sum of £38k per year.

The $40 billion Trump is sending Argentina is roughly on par with the $41.8 billion it owes the International Monetary Fund
— by far the largest debt on the organization’s books,
half of which was taken out under Milei earlier this year.
There is no benefit to working Americans from this,
and the president isn’t even pretending there is.

Trump: no money for health care, plenty for Argentina
Argentina’s libertarian president, Javier Milei, is the lucky winner of $40 billion that Donald Trump managed to conjure from thin air. Less lucky are the Americans who rely on the government programs Trump has gutted to be able to “save” that sum.

🇺🇦 #NowPlaying on #BBC6Music's #LaurenLaverne
ROSALÍA:
🎵 Porcelana
#ROSALÍA
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

Coinbase agrees to acquire prediction markets startup The Clearing Company for an undisclosed sum; the startup was founded in 2025 and raised a $15M seed (Yogita Khatri/The Block)
https://www.theblock.co/post/383497/coinbase-to-acquire-…

🇺🇦 #NowPlaying on KEXP's #DriveTime
ROSALÍA:
🎵 Porcelana
#ROSALÍA
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

Improved Bounds for the Index Conjecture in Zero-Sum Theory
Andrew Pendleton
https://arxiv.org/abs/2510.11976 https://arxiv.org/pdf/2510.11976

Improved Bounds for the Index Conjecture in Zero-Sum Theory
The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the last 30 years, it is only recently that the conjecture has been proven for $n>10^{20}$. In this paper, we prove that said upper bound can be reduced to $4.6\cdot10^{13}$, and lower under certain coprimality conditions. Further, we verify the conjecture for $n<1.…

Quantum Deception: Honey-X Deception using Quantum Games
Efstratios Reppas, Ali Wadi, Brendan Gould, Kyriakos G. Vamvoudakis
https://arxiv.org/abs/2510.11848 https://

Quantum Deception: Honey-X Deception using Quantum Games
In this paper, we develop a framework for deception in quantum games, extending the Honey-X paradigm from classical zero-sum settings into the quantum domain. Building on a view of deception in classical games as manipulation of a player's perception of the payoff matrix, we formalize quantum deception as controlled perturbations of the payoff Hamiltonian subject to a deception budget. We show that when victims are aware of possible deception, their equilibrium strategies surprisingly coincide …

Hybrid centralized-distributed precoding in fronthaul-constrained CF-mMIMO systems
Zahra Mobini, Hien Quoc Ngo, Ardavan Rahimian, Anvar Tukmanov, David Townend, Michail Matthaiou, Simon L. Cotton
https://arxiv.org/abs/2510.12406

Hybrid centralized-distributed precoding in fronthaul-constrained CF-mMIMO systems
We investigate a fronthaul-limited cell-free massive multiple-input multiple-output (CF-mMIMO) system and propose a hybrid centralized-distributed precoding strategy that dynamically adapts to varying fronthaul and spectral efficiency (SE) requirements. The proposed approach divides users into two groups: one served by centralized precoding and the other by distributed precoding. We formulate a novel optimization problem for user grouping and power control aimed at maximizing the sum SE, subjec…

The $\alpha$--regression for compositional data: a unified framework for standard, spatially-lagged, and geographically-weighted regression models
Michail Tsagris
https://arxiv.org/abs/2510.12663

The $α$--regression for compositional data: a unified framework for standard, spatially-lagged, and geographically-weighted regression models
Compositional data-vectors of non--negative components summing to unity--frequently arise in scientific applications where covariates influence the relative proportions of components, yet traditional regression approaches struggle with the unit-sum constraint and zero values. This paper revisits the $α$--regression framework, which uses a flexible power transformation parameterized by $α$ to interpolate between raw data analysis and log-ratio methods, naturally handling zeros without imputati…

Crypto trading firm FalconX agrees to acquire 21shares, one of the main crypto ETF managers, for an undisclosed sum; 21shares had $11B in assets in September (Vicky Ge Huang/Wall Street Journal)
https://www.wsj.com/fin…

H-harmonic reproducing kernels on the ball
Mat\v{e}j Morav\'ik
https://arxiv.org/abs/2510.11821 https://arxiv.org/pdf/2510.11821

H-harmonic reproducing kernels on the ball
We consider the Szegő reproducing kernel associated with the space of $H$-harmonic functions on the unit ball in n-dimensional space, i.e. functions that are characterized by being annihilated by the hyperbolic Laplacian. This paper derives an explicit series expansion for the reproducing kernel in terms of a triple hypergeometric function introduced of Exton. Moreover, we demonstrate that the Szegő kernel admits a representation as a finite sum of hypergeometric functions. We further show th…

When Can Communication Lead to Efficiency?
Itai Arieli, Yakov Babichenko, Atulya Jain, Rann Smorodinsky
https://arxiv.org/abs/2510.12508 https://arxiv.org/…

When Can Communication Lead to Efficiency?
We study games with incomplete information and characterize when a feasible outcome is Pareto efficient. We show that any outcome with excessive randomization over actions is inefficient. Generically, efficiency requires that the total number of actions taken across states be strictly less than the sum of the number of players and states. We then examine the efficiency of equilibrium outcomes in communication models. Generically, a cheap talk outcome is efficient only if it is pure. When the se…

🇺🇦 #NowPlaying on #BBC6Music's #CraigCharles
ROSALÍA:
🎵 Porcelana
#ROSALÍA
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

🇺🇦 #NowPlaying on BBCRadio3's #ThroughTheNight
Claudio Monteverdi, Gabriele Palomba, La Venexiana & Gabriele Palomba:
🎵 Nigra sum, sed formosa
#ClaudioMonteverdi #GabrielePalomba #LaVenexiana

Harnack inequality for Bessel operators
Giorgio Metafune, Luigi Negro, Chiara Spina
https://arxiv.org/abs/2510.12529 https://arxiv.org/pdf/2510.12529

Harnack inequality for Bessel operators
We prove uniqueness results and Harnack inequality for Bessel operators \begin{align*} %\label{def L transf alpha} D_t-Δ_{x} -2a\cdot\nabla_xD_y- D_{yy}- \frac cy D_y % \nonumber \\[1ex]&=y^α\sum_{i,j=1}^{N+1}a_{ij}D_{ij}+y^{α-1}\left(v,\nabla\right)-by^{α-2}. \end{align*} in the strip $[0,T]\times \mathbb{R}^{N+1}_+=\{0 \leq t \leq T, x \in \mathbb{R}^N, y>0\}$ under Neumann boundary conditions at $y=0$.

🇺🇦 #NowPlaying on #BBC6Music's #CraigCharles
ROSALÍA:
🎵 Porcelana
#ROSALÍA
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

Periods detecting Eisenstein series and sums of $L$-values I
Weixiao Lu, Guodong Xi
https://arxiv.org/abs/2510.12446 https://arxiv.org/pdf/2510.12446

Periods detecting Eisenstein series and sums of $L$-values I
We study the automorphic period associated to a $G$-Hamiltonian variety $M$ whose dual is $\check{M} = T^*(\check{G}/\check{L})$, where $\check{G}$ is a general linear group and $\check{L}$ is a Levi subgroup. For certain cuspidal Eisenstein series, we prove that their period is equal to a finite sum of special values of $L$-functions. This sum is indexed by the fixed points of the associated extended $L$-parameter on $\check{M}$, confirming a conjecture by Ben-Zvi-Sakellaridis-Venkatesh in thi…

🇺🇦 #NowPlaying on #BBC6Music's #ChrisHawkins
ROSALÍA:
🎵 Porcelana
#ROSALÍA
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

🇺🇦 #NowPlaying on KEXP's #PacificNotions
Ouri:
🎵 V Stories (∑)
#Ouri
#newRelease 🆕 album
https://ourimusic.bandcamp.com/track/v-stories
https://open.spotify.com/track/5CmtMhy3jlMPHq5YI8XcjJ

🇺🇦 #NowPlaying on #BBC6Music's #CraigCharles
ROSALÍA:
🎵 Porcelana
#ROSALÍA
https://beatsbyalpaca.bandcamp.com/track/rosal-a-porcelana-alpacas-ego-sum-mix
https://open.spotify.com/track/3hETtcSLmNncBjPMLHtVZs

🇺🇦 #NowPlaying on BBCRadio3's #ThroughTheNight
Henning Voss, Wojciech Parchem, Miroslaw Borzynski, Sine Nomine Chamber Choir, Concerto Polacco Baroque Orchestra, Grzegorz Gerwazy Gorczycki, Olga Pasichnyk & Marek Toporowski:
🎵 Laetatus Sum
#HenningVoss #WojciechParchem

🇺🇦 #NowPlaying on #KEXP's #Early
foamboy:
🎵 SUMMERING
#foamboy
#newRelease 🆕 single
https://foamboy.bandcamp.com/track/summering
https://open.spotify.com/track/600axZKBKvEHZuZnPDz0JF

🇺🇦 #NowPlaying on #BBC6Music's #LaurenLaverne
HAIM:
🎵 Summer Girl
#HAIM
https://tresfou.bandcamp.com/track/summer-girl-haim
https://open.spotify.com/track/4O3ob7NxMcZLgJ8ucIahPS

🇺🇦 #NowPlaying on #BBC6Music's #RileyAndCoe
Terry:
🎵 Bureau (6 Music Session, 5 Sep 2018)
#Terry
https://nahtwee.bandcamp.com/track/summer-follows-spring-terry-hall
https://open.spotify.com/track/1JsxMEdjPO4Hj3TnpZu8Rt

🇺🇦 #NowPlaying on #BBC6Music's #GuyGarveysFinestHour
Kim Deal:
🎵 Summerland
#KimDeal
https://kimdeal.bandcamp.com/track/summerland
https://open.spotify.com/track/039UNzELUQod4eq1Pve9Av

🇺🇦 #NowPlaying on #BBC6Music's #GuyGarveysFinestHour
Kim Deal:
🎵 Summerland
#KimDeal
https://kimdeal.bandcamp.com/track/summerland
https://open.spotify.com/track/039UNzELUQod4eq1Pve9Av